Data Selection: A General Principle for Building Small Interpretable Models
Not on the map. Why?
Abstract (arXiv)
We present convincing empirical evidence for an effective and general strategy for building accurate small models. Such models are attractive for interpretability and also find use in resource-constrained environments. The strategy is to learn the training distribution and sample accordingly from the provided training data. The distribution learning algorithm is not a contribution of this work; our contribution is a rigorous demonstration of the broad utility of this strategy in various practical settings. We apply it to the tasks of (1) building cluster explanation trees, (2) prototype-based classification, and (3) classification using Random Forests, and show that it improves the accuracy of decades-old weak traditional baselines to be competitive with specialized modern techniques. This strategy is also versatile wrt the notion of model size. In the first two tasks, model size is considered to be number of leaves in the tree and the number of prototypes respectively. In the final task involving Random Forests, the strategy is shown to be effective even when model size comprises of more than one factor: number of trees and their maximum depth. Positive results using multiple datasets are presented that are shown to be statistically significant.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 40 references that are in the map. First posted on arXiv 8 Oct 2022.
Builds on
12 of 40 references.
References · 12
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 403
- 2018Manipulating and Measuring Model Interpretabilitycited by 256
- 2017Deep Learning for Case-Based Reasoning through Prototypes: A Neural Network that Explains Its Predictionscited by 234
- 2016Hyperparameter optimization with approximate gradientcited by 231
- 2021Efficient and Modular Implicit Differentiationcited by 199
- 2015Should we really use post-hoc tests based on mean-ranks?cited by 116
- 2019Machine Learning at the Network Edge: A Surveycited by 83
- 2020Explainable k-Means and k-Medians Clusteringcited by 67
- 2021Explainable k-means. Don't be greedy, plant bigger trees!cited by 15
- 2021Shallow decision trees for explainable k-means clusteringcited by 15
- 2019Learning Interpretable Models Using Uncertainty Oraclescited by 2
Built on by
Not cited yet.