Metraipolis › archive › dc_69487e32f49b

FARE: Deep Reinforcement Learning For Fair Exposure Constrained Uncertainty Aware Financial Content Personalization — arXiv:2609.31890

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31890
License (as archived)
CC0-1.0
Archived
2026-10-07T20:59:38.219Z
SHA-256 of the archived text
0a569507dc9d919d478d6195beec6bfded4526da93851647ce86b0d954edb4fa
Stable URL of this page
https://metraipolis.com/documento/dc_69487e32f49b

How to cite

FARE: Deep Reinforcement Learning For Fair Exposure Constrained Uncertainty Aware Financial Content Personalization — arXiv:2609.31890 — arXiv (en), https://arxiv.org/abs/2609.31890 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_69487e32f49b (Metraipolis archive dc_69487e32f49b, sha256 0a569507dc9d919d478d6195beec6bfded4526da93851647ce86b0d954edb4fa)
BibTeX
@misc{dc69487e32f49b,
  title = {FARE: Deep Reinforcement Learning For Fair Exposure Constrained Uncertainty Aware Financial Content Personalization — arXiv:2609.31890},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31890},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_69487e32f49b; sha256 0a569507dc9d919d478d6195beec6bfded4526da93851647ce86b0d954edb4fa},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31890. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Content personalization systems in financial services must ensure fair exposure across diverse offerings-a requirement driven by contractual obligations and the need to prevent "rich-get-richer" dynamics where content with high click-through rate (CTR) dominates while other relevant products receive minimal visibility. Share of Voice (SOV) constraints, which guarantee each content category a target fraction of top-position exposure, address this by promoting product diversity and balanced user discovery. While re-ranking layers atop CTR models are common in practice, we propose two key novelties: (1) framing SOV-constrained ranking as a deep reinforcement learning problem analogous to constrained trade execution in algorithmic finance, and (2) explicitly incorporating CTR prediction uncertainty into the agent's state space and policy design-enabling larger ranking adjustments for high-uncertainty predictions where deviation from CTR-optimal ordering is less costly. We introduce FARE (Fair Ranking Executor), a modular uncertainty-aware execution layer that translates any black-box CTR model's predictions into SOV-fair rankings without retraining the underlying model. Our uncertainty-weighted proportional control policy (FARE-PC) and learned neural policies (FARE-ES, FARE-PPO) demonstrate that uncertainty-aware approaches can substantially reduce SOV deviation from fairness targets while minimizing engagement loss, with gradient-free evolution strategies outperforming policy gradient methods on synthetic data and the ordering reversing on KuaiRand-Pure.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-29 in cs.AI).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI); Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2609.31890 — 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-10-07T20:29:02.166Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).