mlsanityData to 7 Oct 2026

Equivalent and Compact Representations of Neural Network Controllers With Decision Trees

arXiv 2304.06049 ↗First posted 11 Apr 2023cs.LG cs.SY eess.SYcited by 0

Not on the map. Why?

Abstract (arXiv)

Over the past decade, neural network (NN)-based controllers have demonstrated remarkable efficacy in a variety of decision-making tasks. However, their black-box nature and the risk of unexpected behaviors pose a challenge to their deployment in real-world systems requiring strong guarantees of correctness and safety. We address these limitations by investigating the transformation of NN-based controllers into equivalent soft decision tree (SDT)-based controllers and its impact on verifiability. In contrast to existing work, we focus on discrete-output NN controllers including rectified linear unit (ReLU) activation functions as well as argmax operations. We then devise an exact yet efficient transformation algorithm which automatically prunes redundant branches. We first demonstrate the practical efficacy of the transformation algorithm applied to an autonomous driving NN controller within OpenAI Gym's CarRacing environment. Subsequently, we evaluate our approach using two benchmarks from the OpenAI Gym environment. Our results indicate that the SDT transformation can benefit formal verification, showing runtime improvements of up to 21 × and 2 × for MountainCar-v0 and CartPole-v1, respectively.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 43 references that are in the map. First posted on arXiv 11 Apr 2023.

Builds on

14 of 43 references.

References · 14

  1. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  2. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  3. 2016OpenAI Gymcited by 1,684
  4. 2013Do Deep Nets Really Need to be Deep?cited by 466
  5. 2017Adversarial Attacks on Neural Network Policiescited by 314
  6. 2017Distilling a Neural Network Into a Soft Decision Treecited by 230
  7. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
  8. 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 183
  9. 2018Verifiable Reinforcement Learning via Policy Extractioncited by 176
  10. 2018Verisig: verifying safety properties of hybrid systems with neural network controllerscited by 83
  11. 2019Oblique Decision Trees from Derivatives of ReLU Networkscited by 14
  12. 2022One-Shot Reachability Analysis of Neural Network Dynamical Systemscited by 10
2 more
  1. 2020Towards Interpretable ANNs: An Exact Transformation to Multi-Class Multivariate Decision Treescited by 6
  2. 2020Bounding the Complexity of Formally Verifying Neural Networks: A Geometric Approachcited by 6

Built on by

Not cited yet.