SOGAR learns Pareto-optimal recourse summaries by solving a bi-objective decision tree problem, yielding stable low-cost effective group actions that outperform prior methods on effectiveness and cost.
Murtree: Optimal decision trees via dynamic programming and search.Journal of Machine Learning Research, 23(26):1–47
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Recourse Summaries via Bi-Objective Decision Tree Learning
SOGAR learns Pareto-optimal recourse summaries by solving a bi-objective decision tree problem, yielding stable low-cost effective group actions that outperform prior methods on effectiveness and cost.