Interpretable reinforcement learning with decision-tree pruning

• URL: http://arxiv.org/abs/2608.07151v1
• Date: Fri, 07 Aug 2026 12:14:33 GMT
• Title: Interpretable reinforcement learning with decision-tree pruning
• Abstract summary: Reinforcement learning policies are difficult to inspect, but interpreting them is a prerequisite for trustworthiness.<n>We present a pruning process that simplifies such rule-based policies while preserving task performance.<n>We investigate this approach on classic control and MuJoCo benchmarks, where pruning traces reveal consistent interpretability improvements.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Reinforcement learning policies are difficult to inspect, but interpreting them is a prerequisite for trustworthiness. Converting a trained policy into explicit decision-tree rules improves transparency and the resulting artifacts often remain too complex for human understanding. We present a pruning process that simplifies such rule-based policies while preserving task performance and making edits to the policy auditable. The process defines a small set of structural and usage-aware operators and evaluates candidate edits by re-executing the policy to measure return and interpretability proxies. This exposes an transformation process from complex to compact policy structures. We investigate this approach on classic control and MuJoCo benchmarks, where pruning traces reveal consistent interpretability improvements while maintaining high performance.

Related papers

• A Methodology for Auditable Trustworthiness Levels in AI Lifecycle Governance [0.3384279376065155]
  We propose a lightweight methodology for auditable trustworthiness levels in AI governance.<n>The methodology has two components: a formal framework for representing and learning trustworthiness levels, and a lightweight AI lifecycle governance procedure.<n>Our methodology does not replace legal or other expert judgment.
  arXiv  Detail & Related papers  (2026-07-17T17:11:22Z)
• Kintsugi: Learning Policies by Repairing Executable Knowledge Bases [31.289004484222847]
  Kintsugi represents task-level policy knowledge as composable typed entries.<n>Between rollouts, a tool-constrained editing loop diagnoses trajectory failures, localizes them to editable KB layers, and proposes candidate edits.<n>A deterministic verification gate admits an edit only when the candidate type-checks, the resulting KB executes, and focused validation success or trajectory-health metrics improve without violating protected-regression checks.
  arXiv  Detail & Related papers  (2026-05-10T11:51:18Z)
• PolicyBank: Evolving Policy Understanding for LLM Agents [51.86716874651299]
  PolicyBank maintains structured, tool-level policy insights and iteratively refines them.<n>PolicyBank closes up to 82% of the gap toward a human oracle.
  arXiv  Detail & Related papers  (2026-04-16T20:29:30Z)
• Polaris: A Gödel Agent Framework for Small Language Models through Experience-Abstracted Policy Repair [0.9780193377233132]
  We introduce Polaris, a Gdel agent for compact models that performs policy repair via experience abstraction.<n>Unlike response level self correction or parameter tuning, Polaris makes policy level changes with small, auditable patches that persist in the policy.<n>As part of the loop, the agent engages in meta reasoning: it explains its errors, proposes concrete revisions to its own policy, and then updates the policy.
  arXiv  Detail & Related papers  (2026-03-24T12:25:32Z)
• Verification of Robust Properties for Access Control Policies [51.736723807086385]
  Existing methods for verifying access control policies require the policy to be complete and fully determined before verification can proceed.<n>We introduce robust property verification: the problem of determining what a policy's structure commits it to regardless of how pending decisions are resolved and regardless of subsequent extension.<n>We show that despite quantifying universally over all possible policy extensions the judgment reduces to proof search in a second-order logic programming language.
  arXiv  Detail & Related papers  (2026-03-13T17:14:38Z)
• Scaling Policy Compliance Assessment in Language Models with Policy Reasoning Traces [12.671657542087624]
  Policy Reasoning Traces (PRT) is a form of specialized generated reasoning chains that serve as a reasoning bridge to improve an LLM's policy compliance assessment capabilities.<n>Our empirical evaluations demonstrate that the use of PRTs for both inference-time and training-time scenarios significantly enhances the performance of open-weight and commercial models.
  arXiv  Detail & Related papers  (2025-09-27T13:10:21Z)
• Bounded Robustness in Reinforcement Learning via Lexicographic Objectives [54.00072722686121]
  Policy robustness in Reinforcement Learning may not be desirable at any cost. We study how policies can be maximally robust to arbitrary observational noise. We propose a robustness-inducing scheme, applicable to any policy algorithm, that trades off expected policy utility for robustness.
  arXiv  Detail & Related papers  (2022-09-30T08:53:18Z)
• Policy Regularization for Legible Behavior [0.0]
  In Reinforcement Learning interpretability generally means to provide insight into the agent's mechanisms. This paper borrows from the Explainable Planning literature methods that focus on the legibility of the agent. In our formulation, the decision boundary introduced by legibility impacts the states in which the agent's policy returns an action that has high likelihood also in other policies.
  arXiv  Detail & Related papers  (2022-03-08T10:55:46Z)
• Constructing a Good Behavior Basis for Transfer using Generalized Policy Updates [63.58053355357644]
  We study the problem of learning a good set of policies, so that when combined together, they can solve a wide variety of unseen reinforcement learning tasks. We show theoretically that having access to a specific set of diverse policies, which we call a set of independent policies, can allow for instantaneously achieving high-level performance.
  arXiv  Detail & Related papers  (2021-12-30T12:20:46Z)
• DDPG++: Striving for Simplicity in Continuous-control Off-Policy Reinforcement Learning [95.60782037764928]
  We show that simple Deterministic Policy Gradient works remarkably well as long as the overestimation bias is controlled. Second, we pinpoint training instabilities, typical of off-policy algorithms, to the greedy policy update step. Third, we show that ideas in the propensity estimation literature can be used to importance-sample transitions from replay buffer and update policy to prevent deterioration of performance.
  arXiv  Detail & Related papers  (2020-06-26T20:21:12Z)
• Tree-Structured Policy based Progressive Reinforcement Learning for Temporally Language Grounding in Video [128.08590291947544]
  Temporally language grounding in untrimmed videos is a newly-raised task in video understanding. Inspired by human's coarse-to-fine decision-making paradigm, we formulate a novel Tree-Structured Policy based Progressive Reinforcement Learning framework.
  arXiv  Detail & Related papers  (2020-01-18T15:08:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.