TL;DR
This paper provides a theoretical foundation for Hard Negative Sampling in recommendation systems, linking it to optimizing One-way Partial AUC and Top-K metrics, and offers practical guidelines validated by experiments.
Contribution
It establishes the first theoretical analysis connecting HNS with Top-K recommendation performance and provides practical guidelines for its effective application.
Findings
HNS with BPR is equivalent to optimizing OPAUC.
OPAUC correlates more strongly with Top-K metrics than AUC.
Guidelines for controlling sampling hardness improve recommendation performance.
Abstract
Negative sampling has been heavily used to train recommender models on large-scale data, wherein sampling hard examples usually not only accelerates the convergence but also improves the model accuracy. Nevertheless, the reasons for the effectiveness of Hard Negative Sampling (HNS) have not been revealed yet. In this work, we fill the research gap by conducting thorough theoretical analyses on HNS. Firstly, we prove that employing HNS on the Bayesian Personalized Ranking (BPR) learner is equivalent to optimizing One-way Partial AUC (OPAUC). Concretely, the BPR equipped with Dynamic Negative Sampling (DNS) is an exact estimator, while with softmax-based sampling is a soft estimator. Secondly, we prove that OPAUC has a stronger connection with Top-K evaluation metrics than AUC and verify it with simulation experiments. These analyses establish the theoretical foundation of HNS in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
