Papers › Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR...

Memorize, Factorize, or be Naïve: Learning Optimal Feature Interaction Methods for CTR Prediction

3 Aug 2021arXiv:2108.01265archive 2025-07-28

Fuyuan Lyu, Xing Tang, Huifeng Guo, Ruiming Tang, Xiuqiang He, Rui Zhang, Xue Liu

Click-through rate prediction is one of the core tasks in commercial recommender systems. It aims to predict the probability of a user clicking a particular item given user and item features. As feature interactions bring in non-linearity, they are widely adopted to improve the performance of CTR prediction models. Therefore, effectively modelling feature interactions has attracted much attention in both the research and industry field. The current approaches can generally be categorized into three classes: (1) naïve methods, which do not model feature interactions and only use original features; (2) memorized methods, which memorize feature interactions by explicitly viewing them as new features and assigning trainable embeddings; (3) factorized methods, which learn latent vectors for original features and implicitly model feature interactions through factorization functions. Studies have shown that modelling feature interactions by one of these methods alone are suboptimal due to the unique characteristics of different feature interactions. To address this issue, we first propose a general framework called OptInter which finds the most suitable modelling method for each feature interaction. Different state-of-the-art deep CTR models can be viewed as instances of OptInter. To realize the functionality of OptInter, we also introduce a learning algorithm that automatically searches for the optimal modelling method. We conduct extensive experiments on four large datasets. Our experiments show that OptInter improves the best performed state-of-the-art baseline deep CTR models by up to 2.21%. Compared to the memorized method, which also outperforms baselines, we reduce up to 91% parameters. In addition, we conduct several ablation studies to investigate the influence of different components of OptInter. Finally, we provide interpretable discussions on the results of OptInter.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 9 code samples harvested from 1 repository linked to this paper: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 9 samples from 1 repository, 3 ran (3 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

fuyuanlyu/OptInter officialmentioned on GitHubpytorchApache-2.0Syntology: 9 samples, 3 ran (0 instrument-failed) · 6 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested: 3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

3ran
6unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from fuyuanlyu/OptInter. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

fuyuanlyu/OptInter official repository 9 samples, 3 ran (0 instrument-failed) · 6 unverified
load_arch learn/utils.py ran Apache-2.0 (permissive) · 8cb7d5a42a010de5 · report fixture: signature model_path:str/0/str · returned ndarray · level recorded 2026-09-25
read_data in 132 papers preprocess/utils.py ran Apache-2.0 (permissive) · a2c3d1cc9f9b9ecc · report fixture: signature source_dir:str/0/str, CONTS:int/0/int, CATES:int/0/int, name:str/0/str · returned tuple · level recorded 2026-09-25
read_data in 132 papers learn/loader/Avazuloader.py ran Apache-2.0 (permissive) · 5620bdba80e2e81c · report fixture: signature raw_rec:bytes/0/? · returned tuple · level recorded 2026-09-25
adjust_learning_rate in 125 papers learn/AvazuTrain.py unverified Apache-2.0 (permissive) · 067e7a974281c414 · report
count_parameters_in_GB learn/utils.py unverified Apache-2.0 (permissive) · 63aa1d8e45e966b0 · report
getmodel learn/model/model.py unverified Apache-2.0 (permissive) · ef41f556ce32018e · report
process_cate preprocess/utils.py unverified Apache-2.0 (permissive) · fa15da1bc0b819c0 · report
process_cont preprocess/utils.py unverified Apache-2.0 (permissive) · b0c4dfdeb480df6a · report
read_data_comb learn/loader/Avazuloader.py unverified Apache-2.0 (permissive) · 10b06b1696ce85f7 · report

Tasks

Click-Through Rate PredictionRecommendation Systems

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Click-Through Rate Prediction Avazu OptInter AUC 0.8062 #1 of 15 Archive leaderboard report
Click-Through Rate Prediction Avazu OptInter LogLoss 0.3637 #1 of 15 Archive leaderboard report
Click-Through Rate Prediction Avazu OptInter-M AUC 0.8060 #2 of 15 Archive leaderboard report
Click-Through Rate Prediction Avazu OptInter-M LogLoss 0.3638 #2 of 15 Archive leaderboard report
Click-Through Rate Prediction Criteo OptInter AUC 0.8101 #22 of 39 Archive leaderboard report
Click-Through Rate Prediction Criteo OptInter Log Loss 0.4417 #22 of 39 Archive leaderboard report
Click-Through Rate Prediction iPinYou OptInter AUC 0.7825 #4 of 7 Archive leaderboard report
Click-Through Rate Prediction iPinYou OptInter LogLoss 0.005604 #4 of 7 Archive leaderboard report
Click-Through Rate Prediction iPinYou OptInter-M AUC 0.7800 #5 of 7 Archive leaderboard report
Click-Through Rate Prediction iPinYou OptInter-M LogLoss 0.00564 #5 of 7 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections