dtControl: decision tree learning algorithms for controller representation

@article{Ashok2020dtControlDT,
  title={dtControl: decision tree learning algorithms for controller representation},
  author={P. Ashok and Mathias Jackermeier and Pushpak Jagtap and Jan Kret{\'i}nsk{\'y} and Maximilian Weininger and Majid Zamani},
  journal={Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control},
  year={2020}
}
  • P. Ashok, Mathias Jackermeier, +3 authors Majid Zamani
  • Published 2020
  • Computer Science, Engineering, Mathematics
  • Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control
Decision tree learning is a popular classification technique most commonly used in machine learning applications. Recent work has shown that decision trees can be used to represent provably-correct controllers concisely. Compared to representations using lookup tables or binary decision diagrams, decision tree representations are smaller and more explainable. We present dtControl, an easily extensible tool offering a wide variety of algorithms for representing memoryless controllers as decision… Expand

Figures and Tables from this paper

dtControl: decision tree learning algorithms for controller representation
TLDR
dtControl is presented, an easily extensible tool for representing memoryless controllers as decision trees, and turns out to be extremely efficient, yielding decision trees with a single-digit number of decision nodes on 5 of the case studies. Expand
An Approach to Evaluating Learning Algorithms for Decision Trees
TLDR
A novel oracle-centered approach to evaluate (the learning ability of) learning algorithms for decision trees consists of generating data from reference trees playing the role of oracles, producing learned trees with existing learning algorithms, and determining the degree of correctness (DOE) of the learned trees by comparing them with the oracles. Expand
A Machine Learning-based Error Model for Quality Control of Functional Approximate Computing
Approximate computing (AC) is a prominent computing standard, which is used in some applications that could tolerate accuracy for enhanced design efficiency. AC demonstrates the effectiveness ofExpand
Machine-Learning-Based Self-Tunable Design of Approximate Computing
TLDR
This article proposes a lightweight and efficient machine-learning-based approach to build an input-aware design selector, i.e., quality controller, to adapt the approximate design in order to meet the target output quality (TOQ). Expand
Numerical over-approximation of invariance entropy via finite abstractions.
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a givenExpand
Numerical Estimation of Invariance Entropy for Nonlinear Control Systems
TLDR
This work presents for the first time an algorithm to numerically compute upper bounds of invariance entropy, and provides a static coder-controller scheme corresponding to the obtained data-rate bound. Expand
An Intelligent Human–Unmanned Aerial Vehicle Interaction Approach in Real Time Based on Machine Learning Using Wearable Gloves
TLDR
An intelligent human–UAV interaction approach in real time based on machine learning using wearable gloves that offers scientific contributions such as a multi-mode command structure, machine-learning-based recognition, task scheduling algorithms, real-time usage, robust and effective use, and high accuracy rates is presented. Expand
MurTree: Optimal Classification Trees via Dynamic Programming and Search
TLDR
This work provides a novel algorithm for learning optimal classification trees based on dynamic programming and search that supports constraints on the depth of the tree and number of nodes and it is argued it can be extended with other requirements. Expand
dtControl 2.0: Explainable Strategy Representation via Decision Tree Learning Steered by Experts
TLDR
DtControl 2.0 is presented, a new version with several fundamentally novel features, and the user can now provide domain knowledge to be exploited in the decision tree learning process and can also interactively steer the process based on the dynamically provided information. Expand
Human-inspired models for tactile computing
TLDR
This chapter sketches first ideas towards automated human-style reasoning using stochastic operational models that mimic human decision-making using recent insights from cognitive neuroscience and formal methods, bridging the gap between the human brain and computation. Expand
...
1
2
...

References

SHOWING 1-10 OF 42 REFERENCES
dtControl: decision tree learning algorithms for controller representation
TLDR
dtControl is presented, an easily extensible tool for representing memoryless controllers as decision trees, and turns out to be extremely efficient, yielding decision trees with a single-digit number of decision nodes on 5 of the case studies. Expand
Programs for Machine Learning
TLDR
In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students. Expand
OC1: A Randomized Induction of Oblique Decision Trees
TLDR
A new method that combines deterministic and randomized procedures to search for a good tree is explored, and the accuracy of the trees found with the method matches or exceeds the best results of other machine learning methods. Expand
An Evolving Oblique Decision Tree Ensemble Architecture for Continuous Learning Applications
TLDR
An evolutionary process by which the population of base classifiers evolves during run-time to adapt to the newly seen instances to maintain their diversity through the inherent instability of the decision tree induction process is described. Expand
Decision Tree Function Approximation in Reinforcement Learning
TLDR
This work presents a decision tree based approach to function approximation in reinforcement learning and finds that the decision tree can provide better learning performance than the neural network function approximation and can solve large problems that are infeasible using table lookup. Expand
Classification and regression trees
  • W. Loh
  • Computer Science
  • Wiley Interdiscip. Rev. Data Min. Knowl. Discov.
  • 2011
TLDR
This article gives an introduction to the subject of classification and regression trees by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples. Expand
Logistic Model Trees
TLDR
This paper uses a stagewise fitting process to construct the logistic regression models that can select relevant attributes in the data in a natural way, and shows how this approach can be used to build the logistics regression models at the leaves by incrementally refining those constructed at higher levels in the tree. Expand
Strategy Representation by Decision Trees with Linear Classifiers
TLDR
This work proposes decision trees with linear classifiers for representation of strategies in graph games and MDPs and implements strategy representation using this data structure and presents experimental results, which show that this new data structure presents a much more efficient strategy representation as compared to standard decision trees. Expand
Perceptron Trees: A Case Study In Hybrid Concept Representations
The paper presents a case study in examining the bias of two particular formalisms: decision trees and linear threshold units. The immediate result is a new hybrid representation, called a perceptronExpand
C4.5: Programs for Machine Learning
TLDR
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting. Expand
...
1
2
3
4
5
...