Lower-Left Partial AUC: An Effective and Efficient Optimization Metric for Recommendation (2403.00844v1)
Abstract: 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.
- Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press.
- Andrew P Bradley. 1997. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern recognition 30, 7 (1997), 1145–1159.
- Rich-Item Recommendations for Rich-Users via GCNN: Exploiting Dynamic and Static Side Information. CoRR abs/2001.10495 (2020).
- Learning to Rank with Nonsmooth Cost Functions. In NIPS. MIT Press, 193–200.
- Bias and Debias in Recommender System: A Survey and Future Directions. CoRR abs/2010.03240 (2020).
- Deep Neural Networks for YouTube Recommendations. In RecSys. ACM, 191–198.
- Lori E. Dodd and Margaret S. Pepe. 2003. Partial AUC Estimation and Regression. Biometrics 59, 3 (2003), 614–623.
- Learning with Average Top-k Loss. In NIPS. 497–505.
- Wei Gao and Zhi-Hua Zhou. 2015. On the Consistency of AUC Pairwise Optimization. In IJCAI. AAAI Press, 939–945.
- Rumor detection with self-supervised learning on texts and social graph. Frontiers Comput. Sci. 17, 4 (2023), 174611.
- Addressing Heterophily in Graph Anomaly Detection: A Perspective of Graph Spectrum. In WWW. ACM, 1528–1538.
- Alleviating Structural Distribution Shift in Graph Anomaly Detection. In WSDM. ACM, 357–365.
- Deep Sparse Rectifier Neural Networks. In AISTATS (JMLR Proceedings, Vol. 15). JMLR.org, 315–323.
- The Adressa dataset for news recommendation. In WI. ACM, 1042–1048.
- J.A. Hanley and Barbara Mcneil. 1982. The Meaning and Use of the Area Under a Receiver Operating Characteristic (ROC) Curve. Radiology 143 (05 1982), 29–36. https://doi.org/10.1148/radiology.143.1.7063747
- F. Maxwell Harper and Joseph A. Konstan. 2016. The MovieLens Datasets: History and Context. ACM Trans. Interact. Intell. Syst. 5, 4 (2016), 19:1–19:19.
- Ruining He and Julian J. McAuley. 2016. Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering. In WWW. ACM, 507–517.
- LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. In SIGIR. ACM, 639–648.
- Neural Collaborative Filtering. In WWW. ACM, 173–182.
- Optimization and Analysis of the pAp@k Metric for Recommender Systems. In ICML (Proceedings of Machine Learning Research, Vol. 119). PMLR, 4260–4270.
- Implicit rate-constrained optimization of non-decomposable objectives. In ICML (Proceedings of Machine Learning Research, Vol. 139). PMLR, 5861–5871.
- SimpleX: A Simple and Strong Baseline for Collaborative Filtering. In CIKM. ACM, 1243–1252.
- Donna Katzman McClish. 1989. Analyzing a Portion of the ROC Curve. Medical Decision Making 9, 3 (1989), 190–195. https://doi.org/10.1177/0272989X8900900307 PMID: 2668680.
- Harikrishna Narasimhan and Shivani Agarwal. 2013a. A Structural SVM Based Approach for Optimizing Partial AUC. In ICML (1) (JMLR Workshop and Conference Proceedings, Vol. 28). JMLR.org, 516–524.
- Harikrishna Narasimhan and Shivani Agarwal. 2013b. SVMpAUCpAUC{}_{\mbox{pAUC}}start_FLOATSUBSCRIPT pAUC end_FLOATSUBSCRIPTtighttight{}^{\mbox{tight}}start_FLOATSUPERSCRIPT tight end_FLOATSUPERSCRIPT: a new support vector method for optimizing partial AUC based on a tight convex upper bound. In KDD. ACM, 167–175.
- Harikrishna Narasimhan and Shivani Agarwal. 2017. Support Vector Algorithms for Optimizing the Partial Area under the ROC Curve. Neural Computation 29, 7 (07 2017), 1919–1963.
- Discriminative-Invariant Representation Learning for Unbiased Recommendation. In IJCAI. ijcai.org, 2270–2278.
- Recall@k Surrogate Loss with Large Batches and Similarity Mixup. In CVPR. IEEE, 7492–7501.
- Large-scale Stochastic Optimization of NDCG Surrogates for Deep Learning with Provable Convergence. In ICML (Proceedings of Machine Learning Research, Vol. 162). PMLR, 18122–18152.
- BPR: Bayesian Personalized Ranking from Implicit Feedback. In UAI. AUAI Press, 452–461.
- Asymptotically Unbiased Instance-wise Regularized Partial AUC Optimization: Theory and Algorithm. In NeurIPS.
- On the Theories Behind Hard Negative Sampling for Recommendation. In WWW. ACM, 812–822.
- CROLoss: Towards a Customizable Loss for Retrieval Models in Recommender Systems. In CIKM. ACM, 1916–1924.
- Denoising Implicit Feedback for Recommendation. In WSDM. ACM, 373–381.
- Diffusion Recommender Model. CoRR abs/2304.04971 (2023).
- The LambdaLoss Framework for Ranking Metric Optimization. In CIKM. ACM, 1313–1322.
- A Survey on Accuracy-Oriented Neural Recommendation: From Collaborative Filtering to Information-Rich Recommendation. IEEE Trans. Knowl. Data Eng. 35, 5 (2023), 4425–4445.
- Two-way partial AUC and its properties. Statistical Methods in Medical Research 28, 1 (2019), 184–195.
- HOP-rec: high-order proximity for implicit recommendation. In Proceedings of the 12th ACM conference on recommender systems. 140–144.
- When All We Need is a Piece of the Pie: A Generic Framework for Optimizing Two-way Partial AUC. In ICML (Proceedings of Machine Learning Research, Vol. 139). PMLR, 11820–11829.
- Optimizing Two-Way Partial AUC With an End-to-End Framework. IEEE Trans. Pattern Anal. Mach. Intell. 45, 8 (2023), 10228–10246.
- Large-scale Optimization of Partial AUC in a Range of False Positive Rates. In NeurIPS.
- Optimizing top-n collaborative filtering via dynamic negative item sampling. In SIGIR. ACM, 785–788.
- When AUC meets DRO: Optimizing Partial AUC for Deep Learning with Non-Convex Convergence Guarantee. In ICML (Proceedings of Machine Learning Research, Vol. 162). PMLR, 27548–27573.