paper-with-me

Papers

Neural-to-Tree Policy Distillation with Policy Improvement Criterion

2021-08-16 · Zhao-Hua Li, Yang Yu, Yingfeng Chen, Ke Chen, Zhipeng Hu, Changjie Fan

While deep reinforcement learning has achieved promising results in challenging decision-making tasks, the main bones of its success --- deep neural networks are mostly black-boxes. A feasible way to gain insight into a black-box model is to distill it into an interpretable model such as a decision tree, which consists of if-then rules and is easy to grasp and be verified. However, the traditional model distillation is usually a supervised learning task under a stationary data distribution assumption, which is violated in reinforcement learning. Therefore, a typical policy distillation that clones model behaviors with even a small error could bring a data distribution shift, resulting in an unsatisfied distilled policy model with low fidelity or low performance. In this paper, we propose to address this issue by changing the distillation objective from behavior cloning to maximizing an advantage evaluation. The novel distillation objective maximizes an approximated cumulative reward and focuses more on disastrous behaviors in critical states, which controls the data shift effect. We evaluate our method on several Gym tasks, a commercial fight game, and a self-driving car simulator. The empirical results show that the proposed method can preserve a higher cumulative reward than behavior cloning and learn a more consistent policy to the original one. Moreover, by examining the extracted rules from the distilled decision trees, we demonstrate that the proposed method delivers reasonable and robust decisions.

📄 PDF Abstract BibTeX arXiv:2108.06898

Code (0)

등록된 구현이 없습니다.

Tasks

Decision MakingDeep Reinforcement Learningreinforcement-learningReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

MSVIPER: Improved Policy Distillation for Reinforcement-Learning-Based Robot Navigation

2022-09-19 · Aaron M. Roth, Jing Liang, Ram Sriram, Elham Tabassi 외

We present Multiple Scenario Verifiable Reinforcement Learning via Policy Extraction (MSVIPER), a new method for policy distillation to decision trees for improved robot navigation. MSVIPER learns an "expert" policy usin…

Imitation Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1

Who Teaches Which Token? Verifier-Gated Multi-Expert On-Policy Distillation for Scientific Reasoning

2026-09-14 · Xun Xu, Zaixi Zhang arxiv

Multi-teacher on-policy distillation (OPD) is becoming the standard way to integrate specialist capabilities into one model: train experts with RL, then distill them into the student on its own rollouts. Existing recipes…

Modifying Final Splits of Classification Tree for Fine-tuning Subpopulation Target in Policy Making

2025-02-20 · Lei Bill Wang, Zhenbang Jiao, Fangyi Wang

Policymakers often use Classification and Regression Trees (CART) to partition populations based on binary outcomes and target subpopulations whose probability of the binary event exceeds a threshold. However, classic CA…

Knowledge Distillation

Fast Learning of Optimal Policy Trees

2025-06-18 · James Cussens, Julia Hatamyar, Vishalie Shah, Noemi Kreif

We develop and implement a version of the popular "policytree" method (Athey and Wager, 2021) using discrete optimisation techniques. We test the performance of our algorithm in finite samples and find an improvement in …

RVI-SAC: Average Reward Off-Policy Deep Reinforcement Learning

2024-08-04

In this paper, we propose an off-policy deep reinforcement learning (DRL) method utilizing the average reward criterion. While most existing DRL methods employ the discounted reward criterion, this can potentially lead t…