Pith. sign in

REVIEW 1 cited by

PAC Confidence Predictions for Deep Neural Network Classifiers

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

arxiv 2011.00716 v5 pith:YV76XCEQ submitted 2020-11-02 cs.LG stat.ML

classification cs.LGstat.ML
keywords approachdemonstratednnsguaranteesconfidenceconfidencesdeepfast
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A key challenge for deploying deep neural networks (DNNs) in safety critical settings is the need to provide rigorous ways to quantify their uncertainty. In this paper, we propose a novel algorithm for constructing predicted classification confidences for DNNs that comes with provable correctness guarantees. Our approach uses Clopper-Pearson confidence intervals for the Binomial distribution in conjunction with the histogram binning approach to calibrated prediction. In addition, we demonstrate how our predicted confidences can be used to enable downstream guarantees in two settings: (i) fast DNN inference, where we demonstrate how to compose a fast but inaccurate DNN with an accurate but slow DNN in a rigorous way to improve performance without sacrificing accuracy, and (ii) safe planning, where we guarantee safety when using a DNN to predict whether a given action is safe based on visual observations. In our experiments, we demonstrate that our approach can be used to provide guarantees for state-of-the-art DNNs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Position: There Is No Free Bayesian Uncertainty Quantification

    stat.ML 2025-06 conditional novelty 4.0 of 10

    Bayesian updating is reframed as an optimization problem without inherent uncertainty quantification, and a PAC-style calibration step is proposed to give predictive intervals frequentist coverage.

Pith tools