Memory-efficient Embedding for Recommendations
Not on the map. Why?
Abstract (arXiv)
Practical large-scale recommender systems usually contain thousands of feature fields from users, items, contextual information, and their interactions. Most of them empirically allocate a unified dimension to all feature fields, which is memory inefficient. Thus it is highly desired to assign different embedding dimensions to different feature fields according to their importance and predictability. Due to the large amounts of feature fields and the nuanced relationship between embedding dimensions with feature distributions and neural network architectures, manually allocating embedding dimensions in practical recommender systems can be very difficult. To this end, we propose an AutoML based framework (AutoDim) in this paper, which can automatically select dimensions for different feature fields in a data-driven fashion. Specifically, we first proposed an end-to-end differentiable framework that can calculate the weights over various dimensions for feature fields in a soft and continuous manner with an AutoML based optimization algorithm; then we derive a hard and discrete embedding component architecture according to the maximal weights and retrain the whole recommender framework. We conduct extensive experiments on benchmark datasets to validate the effectiveness of the AutoDim framework.
Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 7; 2022: 3; 2023: 1; 2024: 3; 2025: 1.
15 papers.
Sort:
- 2022Learning Vector-Quantized Item Representation for Transferable Sequential Recommenderscited by 112
- 2021Learnable Embedding Sizes for Recommender Systemscited by 42
- 2021Deep Learning for Click-Through Rate Estimationcited by 33
- 2021AutoLoss: Automated Loss Function Search in Recommendationscited by 31
- 2021The Authors Matter: Understanding and Mitigating Implicit Bias in Deep Text Classificationcited by 18
- 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Predictioncited by 12
- 2021Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layercited by 12
- 2024Human-inspired Perspectives: A Survey on AI Long-term Memorycited by 12
- 2021Binary Code based Hash Embedding for Web-scale Applicationscited by 11
- 2022Adaptive Low-Precision Training for Embeddings in Click-Through Rate Predictioncited by 11
- 2024OptDist: Learning Optimal Distribution for Customer Lifetime Value Predictioncited by 8
- 2024Centrality-aware Product Retrieval and Rankingcited by 3
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems24 Jun 2025
- 2024Human-inspired Perspectives: A Survey on AI Long-term Memory1 Nov 2024
- 2024Centrality-aware Product Retrieval and Ranking21 Oct 2024
- 2024OptDist: Learning Optimal Distribution for Customer Lifetime Value Prediction16 Aug 2024
- 2023Proxy-based Item Representation for Attribute and Context-aware Recommendation11 Dec 2023
- 2022Adaptive Low-Precision Training for Embeddings in Click-Through Rate Prediction12 Dec 2022
- 2022Learning Vector-Quantized Item Representation for Transferable Sequential Recommenders22 Oct 2022
- 2022Efficient Mixed Dimension Embeddings for Matrix Factorization18 May 2022
- 2021Binary Code based Hash Embedding for Web-scale Applications24 Aug 2021
- 2021Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layer24 Aug 2021
- 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Prediction3 Aug 2021
- 2021AutoLoss: Automated Loss Function Search in Recommendations12 Jun 2021
3 more
- 2022Learning Vector-Quantized Item Representation for Transferable Sequential Recommenderscited by 112
- 2021Learnable Embedding Sizes for Recommender Systemscited by 42
- 2021Deep Learning for Click-Through Rate Estimationcited by 33
- 2021AutoLoss: Automated Loss Function Search in Recommendationscited by 31
- 2021The Authors Matter: Understanding and Mitigating Implicit Bias in Deep Text Classificationcited by 18
- 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Predictioncited by 12
- 2021Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layercited by 12
- 2024Human-inspired Perspectives: A Survey on AI Long-term Memorycited by 12
- 2021Binary Code based Hash Embedding for Web-scale Applicationscited by 11
- 2022Adaptive Low-Precision Training for Embeddings in Click-Through Rate Predictioncited by 11
- 2024OptDist: Learning Optimal Distribution for Customer Lifetime Value Predictioncited by 8
- 2024Centrality-aware Product Retrieval and Rankingcited by 3
12 most cited of 15 All 15 (JSON)
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems24 Jun 2025
- 2024Human-inspired Perspectives: A Survey on AI Long-term Memory1 Nov 2024
- 2024Centrality-aware Product Retrieval and Ranking21 Oct 2024
- 2024OptDist: Learning Optimal Distribution for Customer Lifetime Value Prediction16 Aug 2024
- 2023Proxy-based Item Representation for Attribute and Context-aware Recommendation11 Dec 2023
- 2022Adaptive Low-Precision Training for Embeddings in Click-Through Rate Prediction12 Dec 2022
- 2022Learning Vector-Quantized Item Representation for Transferable Sequential Recommenders22 Oct 2022
- 2022Efficient Mixed Dimension Embeddings for Matrix Factorization18 May 2022
- 2021Binary Code based Hash Embedding for Web-scale Applications24 Aug 2021
- 2021Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layer24 Aug 2021
- 2021Memorize, Factorize, or be Na"ive: Learning Optimal Feature Interaction Methods for CTR Prediction3 Aug 2021
- 2021AutoLoss: Automated Loss Function Search in Recommendations12 Jun 2021
12 newest of 15 All 15 (JSON)