mlsanityData to 7 Oct 2026

Keeping Minimal Experience to Achieve Efficient Interpretable Policy Distillation

arXiv 2203.00822 ↗First posted 2 Mar 2022cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Although deep reinforcement learning has become a universal solution for complex control tasks, its real-world applicability is still limited because lacking security guarantees for policies. To address this problem, we propose Boundary Characterization via the Minimum Experience Retention (BCMER), an end-to-end Interpretable Policy Distillation (IPD) framework. Unlike previous IPD approaches, BCMER distinguishes the importance of experiences and keeps a minimal but critical experience pool with almost no loss of policy similarity. Specifically, the proposed BCMER contains two basic steps. Firstly, we propose a novel multidimensional hyperspheres intersection (MHI) approach to divide experience points into boundary points and internal points, and reserve the crucial boundary points. Secondly, we develop a nearest-neighbor-based model to generate robust and interpretable decision rules based on the boundary points. Extensive experiments show that the proposed BCMER is able to reduce the amount of experience to 1.4%~19.1% (when the count of the naive experiences is 10k) and maintain high IPD performance. In general, the proposed BCMER is more suitable for the experience storage limited regime because it discovers the critical experience and eliminates redundant experience.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 30 references that are in the map. First posted on arXiv 2 Mar 2022.

Builds on

12 of 30 references.

References · 12

  1. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  2. 2016OpenAI Gymcited by 1,684
  3. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  4. 2019A Survey on Explainable Artificial Intelligence (XAI): Towards Medical XAIcited by 403
  5. 2018Verifiable Reinforcement Learning via Policy Extractioncited by 176
  6. 2020Explainable Reinforcement Learning: A Surveycited by 139
  7. 2016Measuring Neural Net Robustness with Constraintscited by 90
  8. 2016Safe Exploration in Finite Markov Decision Processes with Gaussian Processescited by 72
  9. 2018Toward Interpretable Deep Reinforcement Learning with Linear Model U-Treescited by 65
  10. 2016Conservative Banditscited by 58
  11. 2020Designing Interpretable Approximations to Deep Reinforcement Learningcited by 6
  12. 2019Complementary reinforcement learning towards explainable agentscited by 5

Built on by

Not cited yet.