REVIEW 2 cited by
Deep interpretable ensembles
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
read the original abstract
Ensembles improve prediction performance and allow uncertainty quantification by aggregating predictions from multiple models. In deep ensembling, the individual models are usually black box neural networks, or recently, partially interpretable semi-structured deep transformation models. However, interpretability of the ensemble members is generally lost upon aggregation. This is a crucial drawback of deep ensembles in high-stake decision fields, in which interpretable models are desired. We propose a novel transformation ensemble which aggregates probabilistic predictions with the guarantee to preserve interpretability and yield uniformly better predictions than the ensemble members on average. Transformation ensembles are tailored towards interpretable deep transformation models but are applicable to a wider range of probabilistic neural networks. In experiments on several publicly available data sets, we demonstrate that transformation ensembles perform on par with classical deep ensembles in terms of prediction performance, discrimination, and calibration. In addition, we demonstrate how transformation ensembles quantify both aleatoric and epistemic uncertainty, and produce minimax optimal predictions under certain conditions.
Forward citations
Cited by 2 Pith papers
-
What makes an Ensemble (Un) Interpretable?
A complexity-theoretic analysis showing that the number, size, and type of base models determine whether ensemble explanations are tractable, with linear-model ensembles intractable even for two models.
-
Bridging Neural Networks and Dynamic Time Warping for Adaptive Time Series Classification
A recurrent network built from the DTW recurrence, using compressed prototypes, often beats DTW-kNN in low-resource settings and stays close to deep learning baselines on UCR benchmarks.
Discussion (0). Continue with ORCID to comment.