5 papers
REALITrees: Rashomon Ensemble Active Learning for Interpretable Trees
Simon D. Nguyen, Hayden McTavish, Kentaro Hoffman +2
Active learning reduces labeling costs by selecting samples that maximize information gain. A dominant framework, Query-by-Committee (QBC), typically relies on perturbation-based d…
Leveraging Predictive Equivalence in Decision Trees
Hayden McTavish, Zachery Boner, Jon Donnelly +2
Decision trees are widely used for interpretable machine learning due to their clearly structured reasoning process. However, this structure belies a challenge we refer to as predi…
Rashomon Sets for Prototypical-Part Networks: Editing Interpretable Models in Real-Time
Jon Donnelly, Zhicheng Guo, Alina Jade Barnett +3
Interpretability is critical for machine learning models in high-stakes settings because it allows users to verify the model's reasoning. In computer vision, prototypical part mode…
Near Optimal Decision Trees in a SPLIT Second
Varun Babbar, Hayden McTavish, Cynthia Rudin +1
Decision tree optimization is fundamental to interpretable machine learning. The most popular approach is to greedily search for the best feature at every decision point, which is…
Interpretable Generalized Additive Models for Datasets with Missing Values
Hayden McTavish, Jon Donnelly, Margo Seltzer +1
Many important datasets contain samples that are missing one or more feature values. Maintaining the interpretability of machine learning models in the presence of such missing dat…