mlsanityData to 7 Oct 2026

Adap-τ: Adaptively Modulating Embedding Magnitude for Recommendation

arXiv 2302.04775 ↗First posted 9 Feb 2023cs.IR cs.AIcited by 19

Not on the map. Why?

Abstract (arXiv)

Recent years have witnessed the great successes of embedding-based methods in recommender systems. Despite their decent performance, we argue one potential limitation of these methods -- the embedding magnitude has not been explicitly modulated, which may aggravate popularity bias and training instability, hindering the model from making a good recommendation. It motivates us to leverage the embedding normalization in recommendation. By normalizing user/item embeddings to a specific value, we empirically observe impressive performance gains (9% on average) on four real-world datasets. Although encouraging, we also reveal a serious limitation when applying normalization in recommendation -- the performance is highly sensitive to the choice of the temperature τ which controls the scale of the normalized embeddings. To fully foster the merits of the normalization while circumvent its limitation, this work studied on how to adaptively set the proper τ. Towards this end, we first make a comprehensive analyses of τ to fully understand its role on recommendation. We then accordingly develop an adaptive fine-grained strategy Adap-τ for the temperature with satisfying four desirable properties including adaptivity, personalized, efficiency and model-agnostic. Extensive experiments have been conducted to validate the effectiveness of the proposal. The code is available at urlhttps://github.com/junkangwu/Adaptau.

Key facts. Cited by 19 papers in the map (data through 7 Oct 2026). Builds on 25 of its 38 references that are in the map. First posted on arXiv 9 Feb 2023.

Builds on

25 of 38 references.

References · 25

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  3. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  5. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  6. 2017Neural Collaborative Filteringcited by 1,108
  7. 2019Neural Graph Collaborative Filteringcited by 660
  8. 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
  9. 2020Understanding the Behaviour of Contrastive Losscited by 397
  10. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  11. 2020Self-supervised Graph Learning for Recommendationcited by 305
  12. 2017NormFace: L2 Hypersphere Embedding for Face Verificationcited by 237
13 more
  1. 2017Neural Factorization Machines for Sparse Predictive Analyticscited by 183
  2. 2021Are Graph Augmentations Necessary? Simple Graph Contrastive Learning for Recommendationcited by 173
  3. 2020Embedding-based Retrieval in Facebook Searchcited by 155
  4. 2018DeepInf: Social Influence Prediction with Deep Learningcited by 128
  5. 2019Learning Disentangled Representations for Recommendationcited by 110
  6. 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 100
  7. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 93
  8. 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
  9. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
  10. 2022On the Effectiveness of Sampled Softmax Loss for Item Recommendationcited by 39
  11. 2020Contrastive Learning for Debiased Candidate Generation in Large-Scale Recommender Systemscited by 38
  12. 2020Graph Convolutional Network for Recommendation with Low-pass Collaborative Filterscited by 32
  13. 2021Multi-Sample based Contrastive Loss for Top-k Recommendationcited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 9; 2025: 5; 2026: 2.

19 papers.

Sort:

  1. 2023A Survey on Popularity Bias in Recommender Systemscited by 42
  2. 2024Large Language Models are Learnable Planners for Long-Term Recommendationcited by 24
  3. 2024How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspectivecited by 21
  4. 2024Language Representations Can be What Recommenders Need: Findings and Potentialscited by 18
  5. 2024Popularity-Aware Alignment and Contrast for Mitigating Popularity Biascited by 9
  6. 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendationcited by 9
  7. 2024Intersectional Two-sided Fairness in Recommendationcited by 8
  8. 2024Preference Diffusion for Recommendationcited by 8
  9. 2025Graph Spectral Filtering with Chebyshev Interpolation for Recommendationcited by 7
  10. 2024Temporal Linear Item-Item Model for Sequential Recommendationcited by 3
  11. 2025Exploring Large Action Sets with Hyperspherical Embeddings using von Mises-Fisher Samplingcited by 3
  12. 2023CDR: Conservative Doubly Robust Learning for Debiased Recommendationcited by 2
7 more
  1. 2024Exploring Heterogeneity and Uncertainty for Graph-based Cognitive Diagnosis Models in Intelligent Educationcited by 2
  2. 2025On the Role of Weight Decay in Collaborative Filtering: A Popularity Perspectivecited by 2
  3. 2025Macro Graph of Experts for Billion-Scale Multi-Task Recommendationcited by 2
  4. 2025Advancing Loss Functions in Recommender Systems: A Comparative Study with a R'enyi Divergence-Based Solutioncited by 2
  5. 2023ALNSynergy: a graph convolutional network with multi-representation alignment for drug synergy predictioncited by 1
  6. 2026Talos: Optimizing Top-K Accuracy in Recommender Systemscited by 1
  7. 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendationcited by 0