Debiased Pairwise Learning from Positive-Unlabeled Implicit Feedback
원문 초록
Learning contrastive representations from pairwise comparisons has achieved remarkable success in various fields, such as natural language processing, computer vision, and information retrieval. Collaborative filtering algorithms based on pairwise learning also rooted in this paradigm. A significant concern is the absence of labels for negative instances in implicit feedback data, which often results in the random selected negative instances contains false negatives and inevitably, biased embeddings. To address this issue, we introduce a novel correction method for sampling bias that yields a modified loss for pairwise learning called debiased pairwise loss (DPL). The key idea underlying DPL is to correct the biased probability estimates that result from false negatives, thereby correcting the gradients to approximate those of fully supervised data. The implementation of DPL only requires a small modification of the codes. Experimental studies on five public datasets validate the effectiveness of proposed learning method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
JointRank: Rank Large Set with Single Pass
From Web Search towards Agentic Deep Research: Incentivizing Search with Reasoning Agents
DeepResearch Bench: A Comprehensive Benchmark for Deep Research Agents
Exp4Fuse: A Rank Fusion Framework for Enhanced Sparse Retrieval using Large Language Model-based Query Expansion
From Chaos to Automation: Enabling the Use of Unstructured Data for Robotic Process Automation
Temporal Information Retrieval via Time-Specifier Model Merging
토론
이 논문과 연결된 포럼 글이 아직 없습니다.