mlsanityData to 7 Oct 2026

An Embedding Learning Framework for Numerical Features in CTR Prediction

arXiv 2012.08986 ↗First posted 16 Dec 2020cs.IR cs.AI cs.LGcited by 37

Not on the map. Why?

Abstract (arXiv)

Click-Through Rate (CTR) prediction is critical for industrial recommender systems, where most deep CTR models follow an Embedding & Feature Interaction paradigm. However, the majority of methods focus on designing network architectures to better capture feature interactions while the feature embedding, especially for numerical features, has been overlooked. Existing approaches for numerical features are difficult to capture informative knowledge because of the low capacity or hard discretization based on the offline expertise feature engineering. In this paper, we propose a novel embedding learning framework for numerical features in CTR prediction (AutoDis) with high model capacity, end-to-end training and unique representation properties preserved. AutoDis consists of three core components: meta-embeddings, automatic discretization and aggregation. Specifically, we propose meta-embeddings for each numerical field to learn global knowledge from the perspective of field with a manageable number of parameters. Then the differentiable automatic discretization performs soft discretization and captures the correlations between the numerical features and meta-embeddings. Finally, distinctive and informative embeddings are learned via an aggregation function. Comprehensive experiments on two public and one industrial datasets are conducted to validate the effectiveness of AutoDis. Moreover, AutoDis has been deployed onto a mainstream advertising platform, where online A/B test demonstrates the improvement over the base model by 2.1% and 2.7% in terms of CTR and eCPM, respectively. In addition, the code of our framework is publicly available in MindSpore(https://gitee.com/mindspore/mindspore/tree/master/modelzoo/research/recommend/autodis).

Key facts. Cited by 37 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Dec 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 9; 2023: 7; 2024: 8; 2025: 5; 2026: 5.

37 papers.

Sort:

By area:

  1. 2022On Embeddings for Numerical Features in Tabular Deep Learningcited by 185
  2. 2023ExcelFormer: A neural network surpassing GBDTs on tabular datacited by 33
  3. 2022Click-Through Rate Prediction in Online Advertising: A Literature Reviewcited by 31
  4. 2023Embedding in Recommender Systems: A Surveycited by 19
  5. 2022Tele-Knowledge Pre-training for Fault Analysiscited by 18
  6. 2022Alleviating Cold-start Problem in CTR Prediction with A Variational Embedding Learning Frameworkcited by 13
  7. 2024Ads Recommendation in a Collapsed and Entangled Worldcited by 13
  8. 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Predictioncited by 12
  9. 2022Adaptive Low-Precision Training for Embeddings in Click-Through Rate Predictioncited by 11
  10. 2023COPR: Consistency-Oriented Pre-Ranking for Online Advertisingcited by 10
  11. 2024ERASE: Benchmarking Feature Selection Methods for Deep Recommender Systemscited by 9
  12. 2024OptDist: Learning Optimal Distribution for Customer Lifetime Value Predictioncited by 8
25 more
  1. 2024Deep Feature Embedding for Tabular Datacited by 7
  2. 2022Learning Enhanced Representations for Tabular Data via Neighborhood Propagationcited by 6
  3. 2022Multi-Objective Personalized Product Retrieval in Taobao Searchcited by 6
  4. 2022A Comprehensive Survey on Automated Machine Learning for Recommendationscited by 4
  5. 2025Addressing Cold-start Problem in Click-Through Rate Prediction via Supervised Diffusion Modelingcited by 4
  6. 2021Burn After Reading: Online Adaptation for Cross-domain Streaming Datacited by 3
  7. 2022Toward An Optimal Selection of Dialogue Strategies: A Target-Driven Approach for Intelligent Outbound Robotscited by 2
  8. 2023Exploiting Graph Structured Cross-Domain Representation for Multi-Domain Recommendationcited by 2
  9. 2023From Principle to Practice: Vertical Data Minimization for Machine Learningcited by 2
  10. 2025(GG) MoE vs. MLP on Tabular Datacited by 2
  11. 2025Enhancing Interpretability and Effectiveness in Recommendation with Numerical Features via Learning to Contrast the Counterfactual samplescited by 2
  12. 2023AutoAssign+: Automatic Shared Embedding Assignment in Streaming Recommendationcited by 1
  13. 2024Feature Distribution Shift Mitigation with Contrastive Pretraining for Intrusion Detectioncited by 1
  14. 2024Retrieval-Oriented Knowledge for Click-Through Rate Predictioncited by 1
  15. 2021Given Users Recommendations Based on Reviews on Yelpcited by 0
  16. 2023Item Cold Start Recommendation via Adversarial Variational Auto-encoder Warm-upcited by 0
  17. 2024Enhancing Multi-field B2B Cloud Solution Matching via Contrastive Pre-trainingcited by 0
  18. 2024Cognitive Evolutionary Learning to Select Feature Interactions for Recommender Systemscited by 0
  19. 2025Breaker: Removing Shortcut Cues with User Clustering for Single-slot Recommendation Systemcited by 0
  20. 2025Toward a benchmark for CTR prediction in online advertising: datasets, evaluation protocols and perspectivescited by 0
  21. 2026Distribution-Aware End-to-End Embedding for Streaming Numerical Features in Click-Through Rate Predictioncited by 0
  22. 2026KMLP: A Scalable Hybrid Architecture for Web-Scale Tabular Data Modelingcited by 0
  23. 2026Quality Over Clicks: Iterative Reinforcement Learning for Early-Stage E-Commerce Query Suggestioncited by 0
  24. 2026Revisiting Content-Based Music Recommendation: Efficient Feature Aggregation from Large-Scale Music Modelscited by 0
  25. 2026Continuity and Ordinality Matter: Constraining Time Series Tokens for Effective Time Series Analysis with Large Language Modelscited by 0