Papers › AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks
AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networks
Weiping Song, Chence Shi, Zhiping Xiao, Zhijian Duan, Yewen Xu, Ming Zhang, Jian Tang
Click-through rate (CTR) prediction, which aims to predict the probability of a user clicking on an ad or an item, is critical to many online applications such as online advertising and recommender systems. The problem is very challenging since (1) the input features (e.g., the user id, user age, item id, item category) are usually sparse and high-dimensional, and (2) an effective prediction relies on high-order combinatorial features (a.k.a. cross features), which are very time-consuming to hand-craft by domain experts and are impossible to be enumerated. Therefore, there have been efforts in finding low-dimensional representations of the sparse and high-dimensional raw features and their meaningful combinations. In this paper, we propose an effective and efficient method called the AutoInt to automatically learn the high-order feature interactions of input features. Our proposed algorithm is very general, which can be applied to both numerical and categorical input features. Specifically, we map both the numerical and categorical features into the same low-dimensional space. Afterwards, a multi-head self-attentive neural network with residual connections is proposed to explicitly model the feature interactions in the low-dimensional space. With different layers of the multi-head self-attentive neural networks, different orders of feature combinations of input features can be modeled. The whole model can be efficiently fit on large-scale raw data in an end-to-end fashion. Experimental results on four real-world datasets show that our proposed approach not only outperforms existing state-of-the-art approaches for prediction but also offers good explainability. Code is available at: https://github.com/DeepGraphLearning/RecommenderSystems.
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):
get_harvested_code_for_paper(arxiv_id="1810.11921")get_code(code_sha256="…")with a sample'scode_sha256from the list belowget_citation_path(paper_1="1810.11921", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="1810.11921")
Code
No sample from the archive's official repository (DeepGraphLearning/RecommenderSystems) is linked to this paper; the 3 samples below come from 1 community repository. Syntology harvested code from DeepGraphLearning/RecommenderSystems for another paper.
DeepGraphLearning/RecommenderSystems: Syntology's graph links these samples to Session-based Social Recommendation via Dynamic Graph Attention Networks (arXiv:1902.09362; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified); nothing checks that they implement this paper's method.
Syntology 3 code samples harvested from 1 repository linked to this paper: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.
By repository: community (archive-listed): 3 samples from 1 repository, 1 ran (1 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.
No sample is linked to this paper from 10 of its repositories that Syntology harvested for other papers:
- DeepGraphLearning/RecommenderSystems, official repository: harvested for another paper, listed under the repository
- manujosephv/pytorch_tabular, community (archive-listed): harvested for another paper, listed under the repository
- massquantity/LibRecommender, community (archive-listed): harvested for another paper, listed under the repository
- shenweichen/DeepCTR, community (archive-listed): harvested for another paper, listed under the repository
- shenweichen/DeepCTR-Torch, community (archive-listed): harvested for another paper, listed under the repository
- xue-pai/FuxiCTR, community (archive-listed): harvested for another paper, listed under the repository
- DataCanvasIO/DeepTables, community (archive-listed): harvested for another paper, listed under the repository
- MindSpore-scientific/code-4, community (archive-listed): harvested for another paper, listed under the repository
- PaddlePaddle/PaddleRec, community (archive-listed): harvested for another paper, listed under the repository
- alibaba/EasyRec, community (archive-listed): harvested for another paper, listed under the repository
Levels written on 2026-09-26 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.
19 repositories listed; official and paper-mentioned ones first.
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.
A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.
Code Syntology ran Syntology
3 samples harvested: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 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.
Licence: 0 of the 3 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 shichence/AutoInt. “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. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.
4826b8c64d0b0c38 · report
fixture: signature x:int/0/int · returned int · level recorded 2026-09-26 census: 70 implementations from 82 papers, 51 distinct outputs across 11 buckets, one shared input per bucket model.py unverified MIT (permissive) ·
3feb4890a602698e · report
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Click-Through Rate Prediction | Avazu | AutoInt | AUC | 0.7752 | #11 of 15 | Archive leaderboard | report |
| Click-Through Rate Prediction | Avazu | AutoInt | LogLoss | 0.3823 | #11 of 15 | Archive leaderboard | report |
| Click-Through Rate Prediction | Criteo | AutoInt | AUC | 0.8061 | #27 of 39 | Archive leaderboard | report |
| Click-Through Rate Prediction | Criteo | AutoInt | Log Loss | 0.4454 | #27 of 39 | Archive leaderboard | report |
| Click-Through Rate Prediction | KDD12 | AutoInt | AUC | 0.7881 | #5 of 5 | Archive leaderboard | report |
| Click-Through Rate Prediction | KDD12 | AutoInt | Log Loss | 0.1545 | #5 of 5 | Archive leaderboard | report |
| Click-Through Rate Prediction | KKBox | AutoInt+ | AUC | 0.8534 | #4 of 6 | Archive leaderboard | report |
| Click-Through Rate Prediction | MovieLens 1M | AutoInt | AUC | 0.846 | #6 of 6 | Archive leaderboard | report |
| Click-Through Rate Prediction | MovieLens 1M | AutoInt | Log Loss | 0.3784 | #6 of 6 | 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.
Methods
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