Enhancing Cross-Category Learning in Recommendation Systems with Multi-Layer Embedding Training
Not on the map. Why?
Abstract (arXiv)
Modern DNN-based recommendation systems rely on training-derived embeddings of sparse features. Input sparsity makes obtaining high-quality embeddings for rarely-occurring categories harder as their representations are updated infrequently. We demonstrate a training-time technique to produce superior embeddings via effective cross-category learning and theoretically explain its surprising effectiveness. The scheme, termed the multi-layer embeddings training (MLET), trains embeddings using factorization of the embedding layer, with an inner dimension higher than the target embedding dimension. For inference efficiency, MLET converts the trained two-layer embedding into a single-layer one thus keeping inference-time model size unchanged. Empirical superiority of MLET is puzzling as its search space is not larger than that of the single-layer embedding. The strong dependence of MLET on the inner dimension is even more surprising. We develop a theory that explains both of these behaviors by showing that MLET creates an adaptive update mechanism modulated by the singular vectors of embeddings. When tested on multiple state-of-the-art recommendation models for click-through rate (CTR) prediction tasks, MLET consistently produces better models, especially for rare items. At constant model quality, MLET allows embedding dimension, and model size, reduction by up to 16x, and 5.8x on average, across the models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 34 references that are in the map. First posted on arXiv 27 Sep 2023.
Builds on
22 of 34 references.
References · 22
- 2016An overview of gradient descent optimization algorithmscited by 1,033
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
- 2018Quantizing deep convolutional networks for efficient inference: A whitepapercited by 521
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
- 2017Deep & Cross Network for Ad Click Predictionscited by 393
- 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 320
- 2018On the Optimization of Deep Networks: Implicit Acceleration by Overparameterizationcited by 284
- 2018xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systemscited by 278
- 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
- 2019Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systemscited by 68
10 more
- 2021TT-Rec: Tensor Train Compression for Deep Learning Recommendation Modelscited by 58
- 2018ExpandNets: Linear Over-parameterization to Train Compact Convolutional Networkscited by 53
- 2017Compression-aware Training of Deep Networkscited by 46
- 2019Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systemscited by 41
- 2019Tensorized Embedding Layers for Efficient Model Compressioncited by 27
- 2020Mixed-Precision Embedding Using a Cachecited by 18
- 2018Near-lossless Binarization of Word Embeddingscited by 13
- 2018On Periodic Functions as Regularizers for Quantization of Neural Networkscited by 8
- 2019Click-Through Rate Prediction with the User Memory Networkcited by 5
- 2019Block based Singular Value Decomposition approach to matrix factorization for recommender systemscited by 1
Built on by
Not cited yet.