Re-weighting Negative Samples for Model-Agnostic Matching
Jiazhen Lou, Hong Wen, Fuyu Lv, Jing Zhang, Tengfei Yuan, Zhao Li

TL;DR
This paper introduces UMA$^2$, a novel approach that re-weights negative samples in large-scale matching for recommender systems, improving model performance by addressing negative sample bias.
Contribution
It proposes a model-agnostic framework with a negative samples debiasing network to enhance negative sampling in large-scale matching tasks.
Findings
UMA$^2$ outperforms state-of-the-art methods in offline experiments.
UMA$^2$ improves online A/B test metrics.
The method effectively re-weights negative samples for better matching accuracy.
Abstract
Recommender Systems (RS), as an efficient tool to discover users' interested items from a very large corpus, has attracted more and more attention from academia and industry. As the initial stage of RS, large-scale matching is fundamental yet challenging. A typical recipe is to learn user and item representations with a two-tower architecture and then calculate the similarity score between both representation vectors, which however still struggles in how to properly deal with negative samples. In this paper, we find that the common practice that randomly sampling negative samples from the entire space and treating them equally is not an optimal choice, since the negative samples from different sub-spaces at different stages have different importance to a matching model. To address this issue, we propose a novel method named Unbiased Model-Agnostic Matching Approach (UMA). It…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Graph Neural Networks · Topic Modeling
MethodsTest
