mlsanityData to 7 Oct 2026

Differentiable NAS Framework and Application to Ads CTR Prediction

arXiv 2110.14812 ↗First posted 25 Oct 2021cs.LG cs.AI cs.IRcited by 6

Not on the map. Why?

Abstract (arXiv)

Neural architecture search (NAS) methods aim to automatically find the optimal deep neural network (DNN) architecture as measured by a given objective function, typically some combination of task accuracy and inference efficiency. For many areas, such as computer vision and natural language processing, this is a critical, yet still time consuming process. New NAS methods have recently made progress in improving the efficiency of this process. We implement an extensible and modular framework for Differentiable Neural Architecture Search (DNAS) to help solve this problem. We include an overview of the major components of our codebase and how they interact, as well as a section on implementing extensions to it (including a sample), in order to help users adopt our framework for their applications across different categories of deep learning models. To assess the capabilities of our methodology and implementation, we apply DNAS to the problem of ads click-through rate (CTR) prediction, arguably the highest-value and most worked on AI problem at hyperscalers today. We develop and tailor novel search spaces to a Deep Learning Recommendation Model (DLRM) backbone for CTR prediction, and report state-of-the-art results on the Criteo Kaggle CTR prediction dataset.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 25 of its 32 references that are in the map. First posted on arXiv 25 Oct 2021.

Builds on

25 of 32 references.

References · 25

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
  4. 2017Neural Collaborative Filteringcited by 1,108
  5. 2018MnasNet: Platform-Aware Neural Architecture Search for Mobilecited by 937
  6. 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 666
  7. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  8. 2018FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Searchcited by 480
  9. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  10. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  11. 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
  12. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
13 more
  1. 2018Streaming End-to-end Speech Recognition For Mobile Devicescited by 230
  2. 2020FBNetV2: Differentiable Neural Architecture Search for Spatial and Channel Dimensionscited by 152
  3. 2018Mixed Precision Quantization of ConvNets via Differentiable Neural Architecture Searchcited by 122
  4. 2019Practice on Long Sequential User Behavior Modeling for Click-Through Rate Predictioncited by 118
  5. 2019The Architectural Implications of Facebook's DNN-based Personalized Recommendationcited by 83
  6. 2019Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systemscited by 68
  7. 2020DeepRecSys: A System for Optimizing End-To-End At-scale Neural Recommendation Inferencecited by 54
  8. 2020AdaBERT: Task-Adaptive BERT Compression with Differentiable Neural Architecture Searchcited by 51
  9. 2020Towards Automated Neural Interaction Discovery for Click-Through Rate Predictioncited by 37
  10. 2020Time-based Sequence Model for Personalization and Recommendation Systemscited by 11
  11. 2019Efficient Deep Neural Networkscited by 3
  12. 2018Visualizing and Understanding Deep Neural Networks in CTR Predictioncited by 2
  13. 2019Distributed Equivalent Substitution Training for Large-Scale Recommender Systemscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 3; 2024: 0; 2025: 0; 2026: 1.

6 papers.