mlsanityData to 7 Oct 2026

Differentiable Neural Input Search for Recommender Systems

arXiv 2006.04466 ↗First posted 8 Jun 2020cs.LG cs.IRcited by 16

Not on the map. Why?

Abstract (arXiv)

Latent factor models are the driving forces of the state-of-the-art recommender systems, with an important insight of vectorizing raw input features into dense embeddings. The dimensions of different feature embeddings are often set to a same value empirically, which limits the predictive performance of latent factor models. Existing works have proposed heuristic or reinforcement learning-based methods to search for mixed feature embedding dimensions. For efficiency concern, these methods typically choose embedding dimensions from a restricted set of candidate dimensions. However, this restriction will hurt the flexibility of dimension selection, leading to suboptimal performance of search results. In this paper, we propose Differentiable Neural Input Search (DNIS), a method that searches for mixed feature embedding dimensions in a more flexible space through continuous relaxation and differentiable optimization. The key idea is to introduce a soft selection layer that controls the significance of each embedding dimension, and optimize this layer according to model's validation performance. DNIS is model-agnostic and thus can be seamlessly incorporated with existing latent factor models for recommendation. We conduct experiments with various architectures of latent factor models on three public real-world datasets for rating prediction, Click-Through-Rate (CTR) prediction, and top-k item recommendation. The results demonstrate that our method achieves the best predictive performance compared with existing neural input search approaches with fewer embedding parameters and less time cost.

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

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 4; 2023: 3; 2024: 2; 2025: 1.

16 papers.

Sort:

  1. 2021Investigating Bi-Level Optimization for Learning and Vision from a Unified Perspective: A Survey and Beyondcited by 151
  2. 2021Learnable Embedding Sizes for Recommender Systemscited by 42
  3. 2021Deep Learning for Click-Through Rate Estimationcited by 33
  4. 2022A Comprehensive Survey on Trustworthy Recommender Systemscited by 32
  5. 2021AutoLoss: Automated Loss Function Search in Recommendationscited by 31
  6. 2023Embedding in Recommender Systems: A Surveycited by 19
  7. 2023Experimental Analysis of Large-scale Learnable Vector Storage Compressioncited by 12
  8. 2023Dynamic Embedding Size Search with Minimum Regret for Streaming Recommender Systemcited by 7
  9. 2021Random Offset Block Embedding Array (ROBE) for CriteoTB Benchmark MLPerf DLRM Model : 1000× Compression and 3.1× Faster Inferencecited by 4
  10. 2022i-Razor: A Differentiable Neural Input Razor for Feature Selection and Dimension Search in DNN-Based Recommender Systemscited by 4
  11. 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systemscited by 3
  12. 2022The trade-offs of model size in large recommendation models : A 10000 × compressed criteo-tb DLRM model (100 GB parameters to mere 10MB)cited by 2
4 more
  1. 2022Efficient Mixed Dimension Embeddings for Matrix Factorizationcited by 1
  2. 2024Fine-Grained Embedding Dimension Optimization During Training for Recommender Systemscited by 1
  3. 2021Enhanced Exploration in Neural Feature Selection for Deep Click-Through Rate Prediction Models via Ensemble of Gating Layerscited by 0
  4. 2024AdaS&S: a One-Shot Supernet Approach for Automatic Embedding Size Search in Deep Recommender Systemcited by 0