Pith. sign in

REVIEW 1 cited by

Post-hoc Calibration of Neural Networks by g-Layers

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 2006.12807 v2 pith:PFLLA7XH submitted 2020-06-23 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords calibrationnetworkpost-hocmethodsadditionalcalibratedleadneural
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Calibration of neural networks is a critical aspect to consider when incorporating machine learning models in real-world decision-making systems where the confidence of decisions are equally important as the decisions themselves. In recent years, there is a surge of research on neural network calibration and the majority of the works can be categorized into post-hoc calibration methods, defined as methods that learn an additional function to calibrate an already trained base network. In this work, we intend to understand the post-hoc calibration methods from a theoretical point of view. Especially, it is known that minimizing Negative Log-Likelihood (NLL) will lead to a calibrated network on the training set if the global optimum is attained (Bishop, 1994). Nevertheless, it is not clear learning an additional function in a post-hoc manner would lead to calibration in the theoretical sense. To this end, we prove that even though the base network ($f$) does not lead to the global optimum of NLL, by adding additional layers ($g$) and minimizing NLL by optimizing the parameters of $g$ one can obtain a calibrated network $g \circ f$. This not only provides a less stringent condition to obtain a calibrated network but also provides a theoretical justification of post-hoc calibration methods. Our experiments on various image classification benchmarks confirm the theory.

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. Instance-Wise Monotonic Calibration by Constrained Transformation

    cs.LG 2025-07 reject novelty 6.0 of 10

    MCCT and MCCT-I fit monotone per-rank scale and bias parameters on sorted logits for calibration, but the claimed monotonicity theorem fails for logits with negative values.

Pith tools