Robust Collaborative Filtering to Popularity Distribution Shift
ACM Transactions on Information Systems · 31.05.2024 · 42 (3) · 1-25
DOI: 10.1145/3627159 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Information Systems, online erschienen am 22.01.2024. Verfasst von An Zhang und 4 weiteren Autor:innen. Die Arbeit wurde bisher 25-mal zitiert (Crossref) und nennt 74 Literaturangaben. Gefördert von: National Natural Science Foundation of China, University Synergy Innovation Program of Anhui Province.
Abstract (Originalsprache)
In leading collaborative filtering (CF) models, representations of users and items are prone to learn popularity bias in the training data as shortcuts. The popularity shortcut tricks are good for in-distribution (ID) performance but poorly generalized to out-of-distribution (OOD) data, i.e., when popularity distribution of test data shifts w.r.t. the training one. To close the gap, debiasing strategies try to assess the shortcut degrees and mitigate them from the representations. However, there exist two deficiencies: (1) when measuring the shortcut degrees, most strategies only use statistical metrics on a single aspect (i.e., item frequency on item and user frequency on user aspect), failing to accommodate the compositional degree of a user–item pair; (2) when mitigating shortcuts, many strategies assume that the test distribution is known in advance. This results in low-quality debiased representations. Worse still, these strategies achieve OOD generalizability with a sacrifice on ID performance. In this work, we present a simple yet effective debiasing strategy, PopGo , which quantifies and reduces the interaction-wise popularity shortcut without any assumptions on the test data. It first learns a shortcut model, which yields a shortcut degree of a user–item pair based on their popularity representations. Then, it trains the CF model by adjusting the predictions with the interaction-wise shortcut degrees. By taking both causal- and information-theoretical looks at PopGo, we can justify why it encourages the CF model to capture the critical popularity-agnostic features while leaving the spurious popularity-relevant patterns out. We use PopGo to debias two high-performing CF models (matrix factorization [ 28 ] and LightGCN [ 19 ]) on four benchmark datasets. On both ID and OOD test sets, PopGo achieves significant gains over the state-of-the-art debiasing strategies (e.g., DICE [ 71 ] and MACR [ 58 ]). Codes and datasets are available at https://github.com/anzhang314/PopGo .
Förderung
- National Natural Science Foundation of China
- University Synergy Innovation Program of Anhui Province
Zitieren
APA
Zhang, A., Ma, W., Zheng, J., Wang, X., & Chua, T. (2024). Robust Collaborative Filtering to Popularity Distribution Shift. ACM Transactions on Information Systems, 42(3), 1-25. https://doi.org/10.1145/3627159
Vancouver
Zhang A, Ma W, Zheng J, Wang X, Chua T. Robust Collaborative Filtering to Popularity Distribution Shift. ACM Transactions on Information Systems. 2024;42(3):1-25. doi:10.1145/3627159
BibTeX
@article{Zhang2024,
author = {Zhang, An and Ma, Wenchang and Zheng, Jingnan and Wang, Xiang and Chua, Tat-Seng},
title = {Robust Collaborative Filtering to Popularity Distribution Shift},
journal = {ACM Transactions on Information Systems},
year = {2024},
volume = {42},
number = {3},
pages = {1--25},
doi = {10.1145/3627159}
}
EUVIMED