REVIEW 4 cited by
NBDT: Neural-Backed Decision Trees
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Machine learning applications such as finance and medicine demand accurate and justifiable predictions, barring most deep learning methods from use. In response, previous work combines decision trees with deep learning, yielding models that (1) sacrifice interpretability for accuracy or (2) sacrifice accuracy for interpretability. We forgo this dilemma by jointly improving accuracy and interpretability using Neural-Backed Decision Trees (NBDTs). NBDTs replace a neural network's final linear layer with a differentiable sequence of decisions and a surrogate loss. This forces the model to learn high-level concepts and lessens reliance on highly-uncertain decisions, yielding (1) accuracy: NBDTs match or outperform modern neural networks on CIFAR, ImageNet and better generalize to unseen classes by up to 16%. Furthermore, our surrogate loss improves the original model's accuracy by up to 2%. NBDTs also afford (2) interpretability: improving human trustby clearly identifying model mistakes and assisting in dataset debugging. Code and pretrained NBDTs are at https://github.com/alvinwan/neural-backed-decision-trees.
Forward citations
Cited by 4 Pith papers
-
Life history stage effects on alert and flight initiation distances in king penguins (Aptenodytes patagonicus)
King penguins defend their broods most strongly when chicks are small and dependent, then become more willing to flee once chicks are independent or the breeding season is late.
-
Language Model as Visual Explainer
LVX builds LLM-generated attribute trees to explain any trained image classifier without training the explainer, but its faithfulness metric is directly optimized by the method.
-
Explainable and Interpretable Multimodal Large Language Models: A Comprehensive Survey
A survey maps the field of MLLM explainability and interpretability into data, model, and training and inference perspectives.
-
Data-Efficient Challenges in Visual Inductive Priors: A Retrospective
A retrospective of four data-limited computer vision challenges finds that ensembles and heavy augmentation, not novel inductive priors, drove winning performance.
Discussion (0). Continue with ORCID to comment.