Pith. sign in

REVIEW 1 cited by

Unbiased Collaborative Filtering with Fair Sampling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.13840 v2 pith:KKWVCRQR submitted 2025-02-19 cs.IR cs.AI

classification cs.IRcs.AI
keywords methodpropensitybiasdatademonstratefactorsfairinfluence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recommender systems leverage extensive user interaction data to model preferences; however, directly modeling these data may introduce biases that disproportionately favor popular items. In this paper, we demonstrate that popularity bias arises from the influence of propensity factors during training. Building on this insight, we propose a fair sampling (FS) method that ensures each user and each item has an equal likelihood of being selected as both positive and negative instances, thereby mitigating the influence of propensity factors. The proposed FS method does not require estimating propensity scores, thus avoiding the risk of failing to fully eliminate popularity bias caused by estimation inaccuracies. Comprehensive experiments demonstrate that the proposed FS method achieves state-of-the-art performance in both point-wise and pair-wise recommendation tasks. The code implementation is available at https://github.com/jhliu0807/Fair-Sampling.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bidirectional Knowledge Distillation for Enhancing Sequential Recommendation with Large Language Models

    cs.IR 2025-05 conditional novelty 6.0 of 10

    An alternating distillation loop between a conventional recommender and an LLM recommender improves top-K accuracy on four datasets without adding inference-time parameters.

Pith tools