Pith. sign in

REVIEW 3 cited by

Understanding the bias-variance tradeoff of Bregman divergences

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 2202.04167 v2 pith:ZFKTSK7Q submitted 2022-02-08 stat.ML cs.LGmath.PR

Understanding the bias-variance tradeoff of Bregman divergences

classification stat.ML cs.LGmath.PR
keywords variancebiaslabelbregmancentraldefinedmeanprediction
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper builds upon the work of Pfau (2013), which generalized the bias variance tradeoff to any Bregman divergence loss function. Pfau (2013) showed that for Bregman divergences, the bias and variances are defined with respect to a central label, defined as the mean of the label variable, and a central prediction, of a more complex form. We show that, similarly to the label, the central prediction can be interpreted as the mean of a random variable, where the mean operates in a dual space defined by the loss function itself. Viewing the bias-variance tradeoff through operations taken in dual space, we subsequently derive several results of interest. In particular, (a) the variance terms satisfy a generalized law of total variance; (b) if a source of randomness cannot be controlled, its contribution to the bias and variance has a closed form; (c) there exist natural ensembling operations in the label and prediction spaces which reduce the variance and do not affect the bias.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Calibeating for general proper losses: A Bregman divergence approach

    cs.LG 2026-05 unverdicted novelty 7.0

    A Bregman divergence approach yields a unified calibeating framework for general proper losses, delivering U-calibration and logarithmic regret for Tsallis losses with weaker dimension dependence than prior work.

  2. Calibeating for general proper losses: A Bregman divergence approach

    cs.LG 2026-05 unverdicted novelty 7.0

    A Bregman divergence approach yields a general calibeating framework that achieves U-calibration with logarithmic regret for Tsallis losses and a new regret equality for Be The Regularized Leader.

  3. Eigenvalue Calibration for Semantic Embeddings of Large Language Models

    cs.LG 2026-07 conditional novelty 6.5

    Temperature scaling of density-matrix eigenvalues from LLM semantic embeddings optimizes proper-score calibration and corrects systematic overconfidence so entropy equals risk.