Towards Hybrid-grained Feature Interaction Selection for Deep Sparse Network
Not on the map. Why?
Abstract (arXiv)
Deep sparse networks are widely investigated as a neural network architecture for prediction tasks with high-dimensional sparse features, with which feature interaction selection is a critical component. While previous methods primarily focus on how to search feature interaction in a coarse-grained space, less attention has been given to a finer granularity. In this work, we introduce a hybrid-grained feature interaction selection approach that targets both feature field and feature value for deep sparse networks. To explore such expansive space, we propose a decomposed space which is calculated on the fly. We then develop a selection algorithm called OptFeature, which efficiently selects the feature interaction from both the feature field and the feature value simultaneously. Results from experiments on three large real-world benchmark datasets demonstrate that OptFeature performs well in terms of accuracy and efficiency. Additional studies support the feasibility of our method.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 23 Oct 2023.
Builds on
25 of 35 references.
References · 25
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2017Deep & Cross Network for Ad Click Predictionscited by 392
- 2017Large-Scale Evolution of Image Classifierscited by 348
- 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 326
- 2018Learning to Explain: An Information-Theoretic Perspective on Model Interpretationcited by 248
- 2019The Evolved Transformercited by 180
- 2018Neural Architecture Optimizationcited by 164
- 2016Product-based Neural Networks for User Response Predictioncited by 145
13 more
- 2016Deep Learning over Multi-field Categorical Data: A Case Study on User Response Predictioncited by 67
- 2020Open Benchmarking for Click-Through Rate Predictioncited by 53
- 2020AutoFIS: Automatic Feature Interaction Selection in Factorization Models for Click-Through Rate Predictioncited by 52
- 2018Product-based Neural Networks for User Response Prediction over Multi-field Categorical Datacited by 44
- 2022Bidirectional Learning for Offline Infinite-width Model-based Optimizationcited by 35
- 2022Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Modelscited by 33
- 2022Sparse Interaction Additive Networks via Feature Interaction Detection and Sparse Selectioncited by 28
- 2022Gradient-based Bi-level Optimization for Deep Learning: A Surveycited by 26
- 2023Bidirectional Learning for Offline Model-based Biological Sequence Designcited by 20
- 2021Generalized Data Weighting via Class-level Gradient Manipulationcited by 15
- 2022OptEmbed: Learning Optimal Embedding Table for Click-through Rate Predictioncited by 14
- 2023Optimizing Feature Set for Click-Through Rate Predictioncited by 13
- 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Predictioncited by 12
Built on by
Citing papers per year: 2024: 2.
2 papers.