Cited by 171Recommender Systems and TechniquesInformation Retrieval and Search BehaviorAdvanced Bandit Algorithms Research

AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Prediction

Liu, Bin, Zhu, Chenxu, Li, Guilin, Zhang, Weinan, Lai, Jincai, Tang, Ruiming, He, Xiuqiang, Li, Zhenguo +1 more·2020·Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Abstract

Learning feature interactions is crucial for click-through rate (CTR) prediction in recommender systems. In most existing deep learning models, feature interactions are either manually designed or simply enumerated. However, enumerating all feature interactions brings large memory and computation cost. Even worse, useless interactions may introduce noise and complicate the training process. In this work, we propose a two-stage algorithm called Automatic Feature Interaction Selection (AutoFIS). AutoFIS can automatically identify important feature interactions for factorization models with computational cost just equivalent to training the target model to convergence. In the search stage, instead of searching over a discrete set of candidate feature interactions, we relax the choices to be continuous by introducing the architecture parameters. By implementing a regularized optimizer over the architecture parameters, the model can automatically identify and remove the redundant feature interactions during the training process of the model. In the re-train stage, we keep the architecture parameters serving as an attention unit to further boost the performance. Offline experiments on three large-scale datasets (two public benchmarks, one private) demonstrate that AutoFIS can significantly improve various FM based models. AutoFIS has been deployed onto the training platform of Huawei App Store recommendation service, where a 10-day online A/B test demonstrated that AutoFIS improved the DeepFM model by 20.3% and 20.1% in terms of CTR and CVR respectively.

Integrity signals

Registry

Crossref · 10.1145/3394486.3403314

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The search strategy shifts from discrete reinforcement learning to differentiable searching, which adaptively selects architectures within one-shot learning to circumvent computational burden, for more efficient convergence.

    “The search strategy shifts from the discrete reinforcement learning process, which iteratively samples architectures for training and is time-consuming, into the differentiable searching, which adaptively selects architectures within one-shot learning to circumvent the computational burden, for more efficient convergence.”

The citation lists haven’t been fetched yet

References 24 · Cited by 171

Authors
Liu, B., Zhu, C., Li, G., Zhang, W., Lai, J., Tang, R., He, X., Li, Z., & Yu, Y.
Affiliations
  • Huawei Technologies (China) (CN)
  • Shanghai Jiao Tong University (CN)
Venue
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2020-08-20
Pages
2636-2645
OpenAlex
W3081190557
Cited by
171
References
24
Citations by year
2026: 13 · 2025: 21 · 2024: 25 · 2023: 43 · 2022: 27 · 2021: 40 · 2020: 2
FWCI
21.24
Type
conference paper
Language
en
Open access
closed
Locations
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
Keywords
click-through rate prediction, recommender systems, factorization machines, DeepFM, automatic feature selection, attention mechanism

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review