mlsanityData to 14 Oct 2026

TayFCS: Towards Light Feature Combination Selection for Deep Recommender Systems

arXiv 2507.03895 ↗First posted 5 Jul 2025cs.IR cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Feature interaction modeling is crucial for deep recommendation models. A common and effective approach is to construct explicit feature combinations to enhance model performance. However, in practice, only a small fraction of these combinations are truly informative. Thus it is essential to select useful feature combinations to reduce noise and manage memory consumption. While feature selection methods have been extensively studied, they are typically limited to selecting individual features. Extending these methods for high-order feature combination selection presents a significant challenge due to the exponential growth in time complexity when evaluating feature combinations one by one. In this paper, we propose TayFCS, a lightweight feature combination selection method that significantly improves model performance. Specifically, we propose the Taylor Expansion Scorer (TayScorer) module for field-wise Taylor expansion on the base model. Instead of evaluating all potential feature combinations' importance by repeatedly running experiments with feature adding and removal, this scorer only needs to approximate the importance based on their sub-components' gradients. This can be simply computed with one backward pass based on a trained recommendation model. To further reduce information redundancy among feature combinations and their sub-components, we introduce Logistic Regression Elimination (LRE), which estimates the corresponding information gain based on the model prediction performance. Experimental results on three benchmark datasets validate both the effectiveness and efficiency of our approach. Furthermore, online A/B test results demonstrate its practical applicability and commercial value.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 39 references that are in the map. First posted on arXiv 5 Jul 2025.

Builds on

21 of 39 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2016Wide & Deep Learning for Recommender Systemscited by 747
  3. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
  4. 2017Deep & Cross Network for Ad Click Predictionscited by 393
  5. 2020The power of quantum neural networkscited by 379
  6. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 278
  7. 2016Product-based Neural Networks for User Response Predictioncited by 145
  8. 2020Higher-Order Explanations of Graph Neural Networks via Relevant Walkscited by 138
  9. 2020Open Benchmarking for Click-Through Rate Predictioncited by 53
  10. 2021MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Maskcited by 48
  11. 2019AutoCross: Automatic Feature Crossing for Tabular Data in Real-World Applicationscited by 40
  12. 2022AutoField: Automating Feature Selection in Deep Recommender Systemscited by 30
9 more
  1. 2023Towards Deeper, Lighter and Interpretable Cross Network for CTR Predictioncited by 20
  2. 2019Efficient Neural Interaction Function Search for Collaborative Filteringcited by 16
  3. 2020Multi-Interactive Attention Network for Fine-grained Feature Learning in CTR Predictioncited by 14
  4. 2022CL4CTR: A Contrastive Learning Framework for CTR Predictioncited by 14
  5. 2023MAP: A Model-agnostic Pretraining Framework for Click-through Rate Predictioncited by 10
  6. 2023MvFS: Multi-view Feature Selection for Recommender Systemcited by 10
  7. 2023APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendationcited by 10
  8. 2024MergeNet: Knowledge Migration across Heterogeneous Models, Tasks, and Modalitiescited by 6
  9. 2023Deep Task-specific Bottom Representation Network for Multi-Task Recommendationcited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.