Back to Search
Start Over
Algebraically explainable controllers: decision trees and support vector machines join forces.
- Source :
-
International Journal on Software Tools for Technology Transfer . Jun2023, Vol. 25 Issue 3, p249-266. 18p. - Publication Year :
- 2023
-
Abstract
- Recently, decision trees (DT) have been used as an explainable representation of controllers (a.k.a. strategies, policies, schedulers). Although they are often very efficient and produce small and understandable controllers for discrete systems, complex continuous dynamics still pose a challenge. In particular, when the relationships between variables take more complex forms, such as polynomials, they cannot be obtained using the available DT learning procedures. In contrast, support vector machines provide a more powerful representation, capable of discovering many such relationships, but not in an explainable form. Therefore, we suggest to combine the two frameworks to obtain an understandable representation over richer, domain-relevant algebraic predicates. We demonstrate and evaluate the proposed method experimentally on established benchmarks. [ABSTRACT FROM AUTHOR]
- Subjects :
- *DECISION trees
*SUPPORT vector machines
*DISCRETE systems
Subjects
Details
- Language :
- English
- ISSN :
- 14332779
- Volume :
- 25
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- International Journal on Software Tools for Technology Transfer
- Publication Type :
- Academic Journal
- Accession number :
- 172020353
- Full Text :
- https://doi.org/10.1007/s10009-023-00716-z