Metraipolis › archive › dc_37cc8ce76dd5
Fair Recommender Systems for Intersecting Groups — arXiv:2610.40936
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40936
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T07:15:36.359Z
- SHA-256 of the archived text
8d778d8b0ee7fa511b61fa166b3063917d61b66c685c31df7cc16e15650a40fc- Stable URL of this page
https://metraipolis.com/documento/dc_37cc8ce76dd5
How to cite
Fair Recommender Systems for Intersecting Groups — arXiv:2610.40936 — arXiv (en), https://arxiv.org/abs/2610.40936 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_37cc8ce76dd5 (Metraipolis archive dc_37cc8ce76dd5, sha256 8d778d8b0ee7fa511b61fa166b3063917d61b66c685c31df7cc16e15650a40fc)
BibTeX
@misc{dc37cc8ce76dd5,
title = {Fair Recommender Systems for Intersecting Groups — arXiv:2610.40936},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40936},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_37cc8ce76dd5; sha256 8d778d8b0ee7fa511b61fa166b3063917d61b66c685c31df7cc16e15650a40fc},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40936. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Recommendation systems that optimize for the average user can fail to capture the preferences of diverse demographic groups. We consider a dynamic recommendation system, where arriving users can belong to different demographic groups. Importantly, these groups can intersect, and a user may belong to several groups. We first show that over time, any group-blind policy (which excludes all current-user group information) recommending $K \geq 1$ items incurs linear total regret under mild conditions. In turn, we introduce three group-aware algorithms based on the classical Upper Confidence Bound algorithm (UCB): i) Intersection-Fitting, which runs UCB on each intersection, but has a sublinear group- and intersection-level regret guarantee with an exponential dependence in the number of groups; and ii) two group-level heuristics, Inner-Outer UCB and Group-Item UCB which allocate different arms to different groups, and use a sleeping expert meta-learner to choose which active group's recommendation an intersection should inherit at any given time step. We provide experimental results on two datasets, Goodreads and BoardGameGeek, and highlight that our heuristics can be preferable to the intersection-fitting algorithm when intersection-level preferences are closely related to group-level preferences, but that intersection-fitting performs better when different intersections within a same group prefer different items. Tema degli esploratori: governance digitale e beni comuni (elenco arXiv cs.CY, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Computers and Society (cs.CY); Computer Science and Game Theory (cs.GT). Pagina del lavoro: https://arxiv.org/abs/2610.40936 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:08:14.308Z dalla pagina https://arxiv.org/list/cs.CY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).