Cover Image

Optimal Robust Recourse with $L^p$-Bounded Model Change

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kyaw, Phone, Kayastha, Kshitij, Jabbari, Shahin
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning-Augmented Robust Algorithmic Recourse
by: Kayastha, Kshitij, et al.
Published: (2024)

From Search To Sampling: Generative Models For Robust Algorithmic Recourse
by: Garg, Prateek, et al.
Published: (2025)

Local and Regional Counterfactual Rules: Summarized and Robust Recourses
by: Amoukou, Salim I., et al.
Published: (2022)

Argumentative Ensembling for Robust Recourse under Model Multiplicity
by: Jiang, Junqi, et al.
Published: (2025)

Optimal Recourse Summaries via Bi-Objective Decision Tree Learning
by: Chatzis, Ioannis, et al.
Published: (2026)

Dynamic Consistent $k$-Center Clustering with Optimal Recourse
by: Forster, Sebastian, et al.
Published: (2024)

Fairness in Criminal Justice Risk Assessments: The State of the Art
by: Berk, Richard A., et al.
Published: (2017)

Algorithmic Recourse with Missing Values
by: Kanamori, Kentaro, et al.
Published: (2023)

Relevance-aware Algorithmic Recourse
by: Kim, Dongwhi, et al.
Published: (2024)

ElliCE: Efficient and Provably Robust Algorithmic Recourse via the Rashomon Sets
by: Turbal, Bohdan, et al.
Published: (2026)

Pareto Optimal Algorithmic Recourse in Multi-cost Function
by: Chen, Wen-Ling, et al.
Published: (2025)

Feature Responsiveness Scores: Model-Agnostic Explanations for Recourse
by: Cheon, Harry, et al.
Published: (2024)

Towards Non-Adversarial Algorithmic Recourse
by: Leemann, Tobias, et al.
Published: (2024)

Online Algorithmic Recourse by Collective Action
by: Creager, Elliot, et al.
Published: (2023)

Improvement-Focused Causal Recourse (ICR)
by: König, Gunnar, et al.
Published: (2022)

Performative Validity of Recourse Explanations
by: König, Gunnar, et al.
Published: (2025)

The Risks of Recourse in Binary Classification
by: Fokkema, Hidde, et al.
Published: (2023)

Algorithmic Recourse in Abnormal Multivariate Time Series
by: Han, Xiao, et al.
Published: (2023)

Learning Decision Trees and Forests with Algorithmic Recourse
by: Kanamori, Kentaro, et al.
Published: (2024)

PAR: Plausibility-aware Amortized Recourse Generation
by: Sabu, Anagha, et al.
Published: (2026)

Algorithmic Recourse of In-Context Learning for Tabular Data
by: Dong, Wenshuo, et al.
Published: (2026)

Optimality of Sub-network Laplace Approximations: New Results and Methods
by: Raha, Swarnali, et al.
Published: (2026)

The Disagreement Problem in Explainable Machine Learning: A Practitioner's Perspective
by: Krishna, Satyapriya, et al.
Published: (2022)

Reinforcement Learning for Durable Algorithmic Recourse
by: Ceccon, Marina, et al.
Published: (2025)

Personalized Algorithmic Recourse with Preference Elicitation
by: De Toni, Giovanni, et al.
Published: (2022)

Time Can Invalidate Algorithmic Recourse
by: De Toni, Giovanni, et al.
Published: (2024)

Coverage-Validity-Aware Algorithmic Recourse
by: Bui, Ngoc, et al.
Published: (2023)

Causal Algorithmic Recourse: Foundations and Methods
by: Plecko, Drago, et al.
Published: (2026)

The Importance of Time in Causal Algorithmic Recourse
by: Beretta, Isacco, et al.
Published: (2023)

Cost-Adaptive Recourse Recommendation by Adaptive Preference Elicitation
by: Nguyen, Duy, et al.
Published: (2024)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)

Perfect Counterfactuals in Imperfect Worlds: Modelling Noisy Implementation of Actions in Sequential Algorithmic Recourse
by: Xuan, Yueqing, et al.
Published: (2024)

Recourse under Model Multiplicity via Argumentative Ensembling (Technical Report)
by: Jiang, Junqi, et al.
Published: (2023)

COMRECGC: Global Graph Counterfactual Explainer through Common Recourse
by: Fournier, Gregoire, et al.
Published: (2025)

Personalized Path Recourse for Reinforcement Learning Agents
by: Hong, Dat, et al.
Published: (2023)

HR-Bandit: Human-AI Collaborated Linear Recourse Bandit
by: Cao, Junyu, et al.
Published: (2024)

Tracking Dynamic Gaussian Density with a Theoretically Optimal Sliding Window Approach
by: Wang, Yinsong, et al.
Published: (2024)

The Cost of Consistency: Submodular Maximization with Constant Recourse
by: Dütting, Paul, et al.
Published: (2024)

Prediction without Preclusion: Recourse Verification with Reachable Sets
by: Kothari, Avni, et al.
Published: (2023)

To Give or Not to Give? The Impacts of Strategically Withheld Recourse
by: Chen, Yatong, et al.
Published: (2025)