🤖 AI Summary
Continuous-action reinforcement learning (RL) suffers from poor interpretability, hindering trust and debugging in safety-critical applications.
Method: This paper introduces the first differentiable, constraint-aware counterfactual explanation framework for continuous-action RL. It generates minimal-perturbation action sequences via gradient-based optimization, ensuring adherence to policy constraints and state-dependent dynamics while answering “what if” questions about alternative actions. The approach integrates a continuous-action distance metric, explicit embedding of policy constraints, and a model-agnostic post-hoc explanation mechanism.
Contribution/Results: Evaluated on diabetes management and lunar landing tasks, the method achieves >92% counterfactual validity and 87% generalization to unseen states. It significantly improves explanation fidelity and computational efficiency over prior methods, enabling reliable policy inspection and debugging—critical for deploying RL in high-stakes domains.
📝 Abstract
Reinforcement Learning (RL) has shown great promise in domains like healthcare and robotics but often struggles with adoption due to its lack of interpretability. Counterfactual explanations, which address"what if"scenarios, provide a promising avenue for understanding RL decisions but remain underexplored for continuous action spaces. We propose a novel approach for generating counterfactual explanations in continuous action RL by computing alternative action sequences that improve outcomes while minimizing deviations from the original sequence. Our approach leverages a distance metric for continuous actions and accounts for constraints such as adhering to predefined policies in specific states. Evaluations in two RL domains, Diabetes Control and Lunar Lander, demonstrate the effectiveness, efficiency, and generalization of our approach, enabling more interpretable and trustworthy RL applications.