A Bellman-Ford-style dynamic program over an actionability graph returns all Pareto-optimal recourse paths for multiple non-differentiable metric costs, with an epsilon-net sampling scheme proposed for scalability.
In: International Working Conference on Requirements Engineering: Foundation for Software Qual- ity
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Pareto Optimal Algorithmic Recourse in Multi-cost Function
A Bellman-Ford-style dynamic program over an actionability graph returns all Pareto-optimal recourse paths for multiple non-differentiable metric costs, with an epsilon-net sampling scheme proposed for scalability.