Metraipolis › archive › dc_a3aec0b2bfa9
A Distribution Mapping Approach to Counterfactually Fair Reinforcement Learning — arXiv:2608.08743
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08743
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T08:55:08.659Z
- SHA-256 of the archived text
9cb18bf569df7d08386799a3784b05949029c064afce49f904c77f82cc1440ff- Stable URL of this page
https://metraipolis.com/documento/dc_a3aec0b2bfa9
How to cite
A Distribution Mapping Approach to Counterfactually Fair Reinforcement Learning — arXiv:2608.08743 — arXiv (en), https://arxiv.org/abs/2608.08743 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a3aec0b2bfa9 (Metraipolis archive dc_a3aec0b2bfa9, sha256 9cb18bf569df7d08386799a3784b05949029c064afce49f904c77f82cc1440ff)
BibTeX
@misc{dca3aec0b2bfa9,
title = {A Distribution Mapping Approach to Counterfactually Fair Reinforcement Learning — arXiv:2608.08743},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08743},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a3aec0b2bfa9; sha256 9cb18bf569df7d08386799a3784b05949029c064afce49f904c77f82cc1440ff},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08743. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Reinforcement learning (RL) seeks to optimize sequential decisions to maximize population-level benefits over time. However, when deployed in high-stakes settings such as healthcare, RL decisions might systematically restrict some subpopulation's access to valuable services in a manner contrary to the values and goals of stakeholders. Counterfactual fairness (CF) offers a promising framework to address this problem based on causal reasoning. This paper develops a data preprocessing algorithm that, when used in tandem with policy learning, enables CF in RL. Our algorithm relies on a novel quantile distribution mapping method for sequentially estimating the counterfactual states and rewards in the data preprocessing step, subsuming common additivity assumptions used for counterfactual prediction as a special case. We theoretically prove that the per-step level of counterfactual unfairness and infinite-horizon suboptimality gap can be bounded under mild regularity conditions. We also empirically test our algorithm in numerical experiments as well as in application to a real-world interventional digital health dataset. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-08-11 in cs.CY). Categorie arXiv: Machine Learning (stat.ML) ; Computers and Society (cs.CY); Machine Learning (cs.LG); Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2608.08743 — 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-19T08:51:53.767Z dalla pagina https://arxiv.org/catchup/cs.CY/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).