Cited by 44Privacy-Preserving Technologies in DataRecommender Systems and TechniquesEthics and Social Impacts of AI

Fairness-aware Federated Matrix Factorization

Liu, Shuchang, Ge, Yingqiang, Xu, Shuyuan, Zhang, Yongfeng, Marian, Amelie·2022·Proceedings of the 16th ACM Conference on Recommender Systems

Abstract

Achieving fairness over different user groups in recommender systems is an important problem. The majority of existing works achieve fairness through constrained optimization that combines the recommendation loss and the fairness constraint. To achieve fairness, the algorithm usually needs to know each user’s group affiliation feature such as gender or race. However, such involved user group feature is usually sensitive and requires protection. In this work, we seek a federated learning solution for the fair recommendation problem and identify the main challenge as an algorithmic conflict between the global fairness objective and the localized federated optimization process. On one hand, the fairness objective usually requires access to all users’ group information. On the other hand, the federated learning systems restrain the personal data in each user’s local space. As a resolution, we propose to communicate group statistics during federated optimization and use differential privacy techniques to avoid exposure of users’ group information when users require privacy protection. We illustrate the theoretical bounds of the noisy signal used in our method that aims to enforce privacy without overwhelming the aggregated statistics. Empirical results show that federated learning may naturally improve user group fairness and the proposed framework can effectively control this fairness with low communication overheads.

Integrity signals

Registry

Crossref · 10.1145/3523227.3546771

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Liu, S., Ge, Y., Xu, S., Zhang, Y., & Marian, A.
Affiliations
  • Rutgers, The State University of New Jersey (US)
  • Computer Science, Rutgers University, United States
Venue
Proceedings of the 16th ACM Conference on Recommender Systems
Publisher
ACM
Published
2022-09-13
Pages
168-178
OpenAlex
W4296591849
Cited by
43
References
28
Citations by year
2026: 8 · 2025: 13 · 2024: 12 · 2023: 10
FWCI
4.84
Type
conference paper
Language
en
Open access
closed
Locations
ACM Conference on Recommender Systems (RecSys) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Social Sciences › Safety Research › Ethics and Social Impacts of AI
Keywords
federated learning, recommendation fairness, recommender systems, matrix factorization, differential privacy, communication overhead

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review