Are Recommenders Self-Aware? Label-Free Recommendation Performance Estimation via Model Uncertainty
Not on the map. Why?
Abstract (arXiv)
Can a recommendation model be self-aware? This paper investigates the recommender's self-awareness by quantifying its uncertainty, which provides a label-free estimation of its performance. Such self-assessment can enable more informed understanding and decision-making before the recommender engages with any users. To this end, we propose an intuitive and effective method, probability-based List Distribution uncertainty (LiDu). LiDu measures uncertainty by determining the probability that a recommender will generate a certain ranking list based on the prediction distributions of individual items. We validate LiDu's ability to represent model self-awareness in two settings: (1) with a matrix factorization model on a synthetic dataset, and (2) with popular recommendation algorithms on real-world datasets. Experimental results show that LiDu is more correlated with recommendation performance than a series of label-free performance estimators. Additionally, LiDu provides valuable insights into the dynamic inner states of models throughout training and inference. This work establishes an empirical connection between recommendation uncertainty and performance, framing it as a step towards more transparent and self-evaluating recommender systems.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 42 references that are in the map. First posted on arXiv 31 Jul 2025.
Builds on
20 of 42 references.
References · 20
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
- 2018Self-Attentive Sequential Recommendationcited by 1,184
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2018Evidential Deep Learning to Quantify Classification Uncertaintycited by 732
- 2018Predictive Uncertainty Estimation via Prior Networkscited by 557
- 2021Revisiting the Calibration of Modern Neural Networkscited by 390
- 2024Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoderscited by 224
- 2024Variational Bayesian Last Layerscited by 69
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
8 more
- 2021Not All Relevance Scores are Equal: Efficient Uncertainty and Calibration Modeling for Deep Retrieval Modelscited by 18
- 2020Convolutional Gaussian Embeddings for Personalized Recommendation with Uncertaintycited by 11
- 2023Predictive Uncertainty-based Bias Mitigation in Rankingcited by 7
- 2024ReChorus2.0: A Modular and Task-Flexible Recommendation Librarycited by 5
- 2020Auto-Ensemble: An Adaptive Learning Rate Scheduling based Deep Learning Model Ensemblingcited by 4
- 2023Uncertainty Calibration for Counterfactual Propensity Estimation in Recommendationcited by 2
- 2023Mitigating Exploitation Bias in Learning to Rank with an Uncertainty-aware Empirical Bayes Approachcited by 2
- 2025From Aggregation to Selection: User-Validated Distributed Social Recommendationcited by 1
Built on by
Not cited yet.