Metraipolis › archive › dc_17de21620091

Diverse and Plausible Algorithmic Recourse via Tractable Recourse Distributions — arXiv:2608.04677

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04677
License (as archived)
CC0-1.0
Archived
2026-10-31T11:34:53.623Z
SHA-256 of the archived text
fe1583cbc9a1544d1225f187a364c02805cf40ce56eeaeec318f9d309af6eb51
Stable URL of this page
https://metraipolis.com/documento/dc_17de21620091

How to cite

Diverse and Plausible Algorithmic Recourse via Tractable Recourse Distributions — arXiv:2608.04677 — arXiv (en), https://arxiv.org/abs/2608.04677 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17de21620091 (Metraipolis archive dc_17de21620091, sha256 fe1583cbc9a1544d1225f187a364c02805cf40ce56eeaeec318f9d309af6eb51)
BibTeX
@misc{dc17de21620091,
  title = {Diverse and Plausible Algorithmic Recourse via Tractable Recourse Distributions — arXiv:2608.04677},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04677},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17de21620091; sha256 fe1583cbc9a1544d1225f187a364c02805cf40ce56eeaeec318f9d309af6eb51},
  year = {2026}
}

Archived text

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

Algorithmic recourse seeks to help individuals reverse unfavorable automated decisions by recommending actionable changes that achieve a desired outcome. As an individual usually has several distinct routes to a favorable decision, and different people can act on different ones, a recourse system should offer multiple realistic alternatives rather than one. Existing approaches formulate recourse as an optimization problem that constructs one or a small set of counterfactuals rather than modeling the underlying space of feasible solutions, and in practice each sacrifices diversity, plausibility, or feasibility to secure the others. We propose Tractable Recourse Distributions, a probabilistic framework that represents the space of feasible alternatives for a given factual instance as a probability distribution over favorable outcomes. For commonly used cost functions based on proximity and the number of feature changes, we show that this distribution admits an exact representation as a probabilistic circuit, obtained by exponentially tilting the circuit; each individual's distribution is therefore available in closed form, without retraining the model. Sampling from these distributions naturally produces diverse and plausible recourses, while the tilting parameters provide explicit control over their proximity and sparsity. Experiments on standard algorithmic recourse benchmark datasets demonstrate that the proposed framework attains diversity, plausibility, and feasibility simultaneously, while retaining sufficient probability mass over feasible counterfactuals for rejection sampling to be practical. A visual study on MNIST illustrates how the tilt strength trades proximity against validity.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-06 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.04677 — 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-31T11:24:48.791Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).