mlsanityData to 7 Oct 2026

Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layer

arXiv 2108.11513 ↗First posted 24 Aug 2021cs.LG cs.AIcited by 12

Not on the map. Why?

Abstract (arXiv)

Embedding learning for categorical features is crucial for the deep learning-based recommendation models (DLRMs). Each feature value is mapped to an embedding vector via an embedding learning process. Conventional methods configure a fixed and uniform embedding size to all feature values from the same feature field. However, such a configuration is not only sub-optimal for embedding learning but also memory costly. Existing methods that attempt to resolve these problems, either rule-based or neural architecture search (NAS)-based, need extensive efforts on the human design or network training. They are also not flexible in embedding size selection or in warm-start-based applications. In this paper, we propose a novel and effective embedding size selection scheme. Specifically, we design an Adaptively-Masked Twins-based Layer (AMTL) behind the standard embedding layer. AMTL generates a mask vector to mask the undesired dimensions for each embedding vector. The mask vector brings flexibility in selecting the dimensions and the proposed layer can be easily added to either untrained or trained DLRMs. Extensive experimental evaluations show that the proposed scheme outperforms competitive baselines on all the benchmark tasks, and is also memory-efficient, saving 60% memory usage without compromising any performance metrics.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 17 of its 20 references that are in the map. First posted on arXiv 24 Aug 2021.

Builds on

17 of 20 references.

References · 17

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  3. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  4. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  5. 2016Wide & Deep Learning for Recommender Systemscited by 745
  6. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
  7. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  8. 2017Deep & Cross Network for Ad Click Predictionscited by 392
  9. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
  10. 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 277
  11. 2019Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systemscited by 68
  12. 2020AutoEmb: Automated Embedding Dimensionality Search in Streaming Recommendationscited by 47
5 more
  1. 2019Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systemscited by 41
  2. 2019Neural Input Search for Large Scale Recommendation Modelscited by 39
  3. 2020Model Size Reduction Using Frequency Based Double Hashing for Recommender Systemscited by 33
  4. 2020Memory-efficient Embedding for Recommendationscited by 15
  5. 2021Graph Intention Network for Click-through Rate Prediction in Sponsored Searchcited by 14

Built on by

Cited by year

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

12 papers.