mlsanityData to 7 Oct 2026

Enhanced Exploration in Neural Feature Selection for Deep Click-Through Rate Prediction Models via Ensemble of Gating Layers

arXiv 2112.03487 ↗First posted 7 Dec 2021cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Feature selection has been an essential step in developing industry-scale deep Click-Through Rate (CTR) prediction systems. The goal of neural feature selection (NFS) is to choose a relatively small subset of features with the best explanatory power as a means to remove redundant features and reduce computational cost. Inspired by gradient-based neural architecture search (NAS) and network pruning methods, people have tackled the NFS problem with Gating approach that inserts a set of differentiable binary gates to drop less informative features. The binary gates are optimized along with the network parameters in an efficient end-to-end manner. In this paper, we analyze the gradient-based solution from an exploration-exploitation perspective and use empirical results to show that Gating approach might suffer from insufficient exploration. To improve the exploration capacity of gradient-based solutions, we propose a simple but effective ensemble learning approach, named Ensemble Gating. We choose two public datasets, namely Avazu and Criteo, to evaluate this approach. Our experiments show that, without adding any computational overhead or introducing any hyper-parameter (except the size of the ensemble), our method is able to consistently improve Gating approach and find a better subset of features on the two datasets with three different underlying deep CTR prediction models.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 34 references that are in the map. First posted on arXiv 7 Dec 2021.

Builds on

24 of 34 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  3. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  6. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  7. 2018DARTS: Differentiable Architecture Searchcited by 1,782
  8. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  9. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  10. 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 666
  11. 2016Deep Exploration via Bootstrapped DQNcited by 518
  12. 2017Deep & Cross Network for Ad Click Predictionscited by 392
12 more
  1. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
  2. 2018SNAS: Stochastic Neural Architecture Searchcited by 288
  3. 2019Self-Supervised Exploration via Disagreementcited by 263
  4. 2017MorphNet: Fast & Simple Resource-Constrained Structure Learning of Deep Networkscited by 92
  5. 2016Training Sparse Neural Networkscited by 73
  6. 2021Learnable Embedding Sizes for Recommender Systemscited by 42
  7. 2019Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systemscited by 41
  8. 2019Neural Input Search for Large Scale Recommendation Modelscited by 39
  9. 2020Differentiable Neural Input Search for Recommender Systemscited by 16
  10. 2018Feature Selection using Stochastic Gatescited by 12
  11. 2017Learning Binary Residual Representations for Domain-specific Video Streamingcited by 7
  12. 2020Adaptive Dense-to-Sparse Paradigm for Pruning Online Recommendation System with Non-Stationary Datacited by 4

Built on by

Not cited yet.