Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendation
Not on the map. Why?
Abstract (arXiv)
Optimization metrics are crucial for building recommendation systems at scale. However, an effective and efficient metric for practical use remains elusive. While Top-K ranking metrics are the gold standard for optimization, they suffer from significant computational overhead. Alternatively, the more efficient accuracy and AUC metrics often fall short of capturing the true targets of recommendation tasks, leading to suboptimal performance. To overcome this dilemma, we propose a new optimization metric, Lower-Left Partial AUC (LLPAUC), which is computationally efficient like AUC but strongly correlates with Top-K ranking metrics. Compared to AUC, LLPAUC considers only the partial area under the ROC curve in the Lower-Left corner to push the optimization focus on Top-K. We provide theoretical validation of the correlation between LLPAUC and Top-K ranking metrics and demonstrate its robustness to noisy user feedback. We further design an efficient point-wise recommendation loss to maximize LLPAUC and evaluate it on three datasets, validating its effectiveness and robustness.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 29 Feb 2024.
Builds on
21 of 47 references.
References · 21
- 2021Convex optimizationcited by 2,479
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2017Neural Collaborative Filteringcited by 1,108
- 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
- 2020Denoising Implicit Feedback for Recommendationcited by 80
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
- 2021A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendationcited by 59
- 2017Learning with Average Top-k Losscited by 52
- 2021Recall@k Surrogate Loss with Large Batches and Similarity Mixupcited by 49
- 2024Alleviating Structural Distribution Shift in Graph Anomaly Detectioncited by 31
- 2022When AUC meets DRO: Optimizing Partial AUC for Deep Learning with Non-Convex Convergence Guaranteecited by 29
- 2022Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergencecited by 21
9 more
- 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
- 2022Large-scale Optimization of Partial AUC in a Range of False Positive Ratescited by 15
- 2022Rumor Detection with Self-supervised Learning on Texts and Social Graphcited by 15
- 2016Support Vector Algorithms for Optimizing the Partial Area Under the ROC Curvecited by 12
- 2015Two-Way Partial AUC and Its Propertiescited by 11
- 2021Implicit Rate-Constrained Optimization of Non-decomposable Objectivescited by 9
- 2022Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithmcited by 5
- 2022CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender Systemscited by 4
- 2020Rich-Item Recommendations for Rich-Users: Exploiting Dynamic and Static Side Informationcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 4.
9 papers.
- 2025ROC-n-reroll: How verifier imperfection affects test-time scalingcited by 11
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendationcited by 9
- 2025Breaking the Top-K Barrier: Advancing Top-K Ranking Metrics Optimization in Recommender Systemscited by 9
- 2025Advancing Loss Functions in Recommender Systems: A Comparative Study with a R'enyi Divergence-Based Solutioncited by 2
- 2026Talos: Optimizing Top-K Accuracy in Recommender Systemscited by 1
- 2025FairPOT: Balancing AUC Performance and Fairness with Proportional Optimal Transportcited by 0
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendationcited by 0
- 2026DSL: Understanding and Improving Softmax Recommender Systems with Competition-Aware Scalingcited by 0
- 2026SeedER: Seed-Expand-Retrieve for Efficient Knowledge Graph Retrievalcited by 0
- 2026SeedER: Seed-Expand-Retrieve for Efficient Knowledge Graph Retrieval22 May 2026
- 2026DSL: Understanding and Improving Softmax Recommender Systems with Competition-Aware Scaling6 Feb 2026
- 2026Talos: Optimizing Top-K Accuracy in Recommender Systems27 Jan 2026
- 2026Correct and Weight: A Simple Yet Effective Loss for Implicit Feedback Recommendation7 Jan 2026
- 2025FairPOT: Balancing AUC Performance and Fairness with Proportional Optimal Transport5 Aug 2025
- 2025Breaking the Top-K Barrier: Advancing Top-K Ranking Metrics Optimization in Recommender Systems4 Aug 2025
- 2025ROC-n-reroll: How verifier imperfection affects test-time scaling16 Jul 2025
- 2025Advancing Loss Functions in Recommender Systems: A Comparative Study with a R'enyi Divergence-Based Solution18 Jun 2025
- 2024PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation31 Oct 2024