Balancing Interpretability And Performance In Reinforcement Learning: An Adaptive Spectral Based Linear Approach

Abstract

Reinforcement learning (RL) has been widely applied to sequential decision making, where interpretability and performance are both critical for practical adoption. Current approaches typically focus on performance and rely on post hoc explanations to account for interpretability. Different from these approaches, we focus on designing an interpretability-oriented yet performance-enhanced RL approach. Specifically, we propose a spectral based linear RL method that extends the ridge regression-based approach through a spectral filter function. The proposed method clarifies the role of regularization in controlling estimation error and further enables the design of an adaptive regularization parameter selection strategy guided by the bias-variance trade-off principle. Theoretical analysis establishes near-optimal bounds for both parameter estimation and generalization error. Extensive experiments on simulated environments and real-world datasets from Kuaishou and Taobao demonstrate that ou

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyyi2025balancing

Related papers

• Spectral Representation-based Reinforcement Learning (2025)0.00
• Interpretable Performance Analysis Towards Offline Reinforcement Learning: A Dataset Perspective (2021)0.00
• Spectral Normalisation For Deep Reinforcement Learning: An Optimisation Perspective (2021)0.00
• Spectral Bellman Method: Unifying Representation And Exploration In RL (2025)0.00
• A Survey On Interpretable Reinforcement Learning (2021)0.00
• Provably Optimal Reinforcement Learning Under Safety Filtering (2025)0.00
• Social Interpretable Reinforcement Learning (2024)3.58
• Conditionally Elicitable Dynamic Risk Measures For Deep Reinforcement Learning (2022)0.00