paper-with-me

Papers

SHAP-Guided Kernel Actor-Critic for Explainable Reinforcement Learning

2025-12-04 · Na Li, Hangguan Shan, Wei Ni, Wenjie Zhang, Xinyu Li arxiv

Actor-critic (AC) methods are a cornerstone of reinforcement learning (RL) but offer limited interpretability. Current explainable RL methods seldom use state attributions to assist training. Rather, they treat all state features equally, thereby neglecting the heterogeneous impacts of individual state dimensions on the reward. We propose RKHS-SHAP-based Advanced Actor-Critic (RSA2C), an attribution-aware, kernelized, two-timescale AC algorithm, including Actor, Value Critic, and Advantage Critic. The Actor is instantiated in a vector-valued reproducing kernel Hilbert space (RKHS) with a Mahalanobis-weighted operator-valued kernel, while the Value Critic and Advantage Critic reside in scalar RKHSs. These RKHS-enhanced components use sparsified dictionaries: the Value Critic maintains its own dictionary, while the Actor and Advantage Critic share one. State attributions, computed from the Value Critic via RKHS-SHAP (kernel mean embedding for on-manifold and conditional mean embedding for off-manifold expectations), are converted into Mahalanobis-gated weights that modulate Actor gradients and Advantage Critic targets. We derive a global, non-asymptotic convergence bound under state perturbations, showing stability through the perturbation-error term and efficiency through the convergence-error term. Empirical results on three continuous-control environments show that RSA2C achieves efficiency, stability, and interpretability. Our code is available at https://github.com/Na-Li66/RSA2C.

📄 PDF Abstract BibTeX arXiv:2512.05291

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

PolySHAP: Extending KernelSHAP with Interaction-Informed Polynomial Regression

2026-01-26 · Fabian Fumagalli, R. Teal Witter, Christopher Musco arxiv

Shapley values have emerged as a central game-theoretic tool in explainable AI (XAI). However, computing Shapley values exactly requires $2^d$ game evaluations for a model with $d$ features. Lundberg and Lee's KernelSHAP…

Feature Importance for Time Series Data: Improving KernelSHAP

2022-10-05 · Mattia Villani, Joshua Lockhart, Daniele Magazzeni

Feature importance techniques have enjoyed widespread attention in the explainable AI literature as a means of determining how trained machine learning models make their predictions. We consider Shapley value based appro…

Event DetectionFeature ImportanceTime SeriesTime Series Analysis

Achieving Transparency in Distributed Machine Learning with Explainable Data Collaboration

2022-12-06 · Anna Bogdanova, Akira Imakura, Tetsuya Sakurai, Tomoya Fujii 외

Transparency of Machine Learning models used for decision support in various industries becomes essential for ensuring their ethical use. To that end, feature attribution methods such as SHAP (SHapley Additive exPlanatio…

Privacy Preserving

Provably Accurate Shapley Value Estimation via Leverage Score Sampling

2024-10-02 · Christopher Musco, R. Teal Witter

Originally introduced in game theory, Shapley values have emerged as a central tool in explainable machine learning, where they are used to attribute model predictions to specific input features. However, computing Shapl…

Active LearningAttribute

XStacking: Explanation-Guided Stacked Ensemble Learning

2025-07-23 · Moncef Garouani, Ayah Barhrhouj, Olivier Teste arxiv

Ensemble Machine Learning (EML) techniques, especially stacking, have been shown to improve predictive performance by combining multiple base models. However, they are often criticized for their lack of interpretability.…

Ensemble Learning