A general theoretical framework for learning smallest interpretable models

DOI10.1016/J.ARTINT.2025.104441MaRDI QIDQ6869568zbMATH OpenFDO

Authors Sebastian Ordyniak, Giacomo Paesani, Stefan Szeider

Publication date 22 January 2026

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2025.104441

zbMATH Keywords

(ordered) binary decision diagramsdecision listsdecision setsdecision treeslearning of ML models and ensemblesparameterized complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A SAT-based approach to learn explainable decision sets
• Constructing optimal binary decision trees is NP-complete
• scientific article; zbMATH DE number 7625179 (Why is no real title available?)
• Learning certifiably optimal rule lists for categorical data
• Learning Optimal Decision Sets and Lists with SAT
• Learning optimal decision trees using constraint programming
• SAT-based rigorous explanations for decision lists

This page was built for publication: A general theoretical framework for learning smallest interpretable models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869568)