Abstract
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 trees. We highlight that the trees produced by dtControl are often very concise with a single-digit number of decision nodes. This demo is based on our tool paper [1].
| Dokumententyp: | Zeitschriftenartikel |
|---|---|
| Fakultät: | Mathematik, Informatik und Statistik > Informatik |
| Themengebiete: | 000 Informatik, Informationswissenschaft, allgemeine Werke > 004 Informatik |
| Sprache: | Englisch |
| Dokumenten ID: | 89070 |
| Datum der Veröffentlichung auf Open Access LMU: | 25. Jan. 2022 09:28 |
| Letzte Änderungen: | 25. Jan. 2022 09:28 |
