PBiLoss: Popularity-Aware Regularization to Improve Fairness in Graph-Based Recommender Systems
Mohammad Naeimi, Mostafa Haghir Chehreghani

TL;DR
PBiLoss is a regularization technique that explicitly reduces popularity bias in graph neural network recommender systems, improving fairness without sacrificing accuracy.
Contribution
It introduces a novel loss function with sampling strategies to counteract popularity bias, adaptable to various graph-based recommendation models.
Findings
Reduces popularity bias metrics by up to 10%
Maintains recommendation accuracy and diversity
Effective across multiple datasets and models
Abstract
Recommender systems based on graph neural networks (GNNs) have been proved to perform well on user-item interactions. However, they commonly suffer from popularity bias -- the tendency to over-recommend popular items -- resulting in less personalization, unfair exposure and lower recommendation diversity. Current solutions address popularity bias through different stages of the recommendation pipeline, including pre-processing methods that may distort data distributions, in-processing approaches which can complicate optimization, and post-processing techniques that are limited in correcting bias already embedded in the learned representations. To address these limitations, we propose PBiLoss, a novel regularization-based loss function designed to explicitly counteract popularity bias in graph-based recommenders. PBiLoss augments traditional training objectives by penalizing the model's…
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.
