Fast Rashomon sets of sparse rule sets

DOI10.1007/S10994-026-07108-9MaRDI QIDQ7314888zbMATH OpenFDO

Authors Cristina Molero-Río, Boxuan Li, Tong Wang, Cynthia Rudin

Publication date 18 August 2026

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10994-026-07108-9

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• 10.1162/jmlr.2003.3.4-5.723
• A Bayesian framework for learning rule sets for interpretable classification
• All models are wrong, but many are useful: learning a variable's importance by studying an entire class of prediction models simultaneously
• Bayesian hierarchical rule modeling for predicting medical conditions
• Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
• Hardness of approximate two-level logic minimization and PAC learning with membership queries
• scientific article; zbMATH DE number 4164874 (Why is no real title available?)
• Inductive Logic Programming: Theory and methods
• Interpretable machine learning: fundamental principles and 10 grand challenges
• Krimp: mining itemsets that compress
• Learning Boolean formulas
• Learning theory analysis for association rules and sequential event prediction
• Optimization by simulated annealing
• Very simple classification rules perform well on most commonly used datasets

This page was built for publication: Fast Rashomon sets of sparse rule sets

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