Equivalent and Compact Representations of Neural Network Controllers With Decision Trees

Read full text Summarise with VIRAT
Authors: Kevin Kai-Chun Chang, Nathan Dahlin, Rahul Jain, Pierluigi Nuzzo
Cited by: 0
References: 38

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

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 evaluate our approach and demonstrate the practical efficacy of the transformation algorithm using three benchmarks from the OpenAI Gym environment, including an autonomous driving NN controller. Our results indicate that the SDT transformation can benefit formal verification, showing runtime improvements of up to$20\times$,$2\times$, and$20\times$for the MountainCar-v0, CartPole-v1, and CarRacing-v2 environments, respectively.

Fields of Study & Subjects

Formal Methods in Verification Safety Systems Engineering in Autonomy Software Testing and Debugging Techniques

Publication details

Journal / source
IEEE Transactions on Automatic Control
Volume
71
Issue
8
Pages
5276–5289
Publication date
20 March 2026
Language
EN