The Geometry and Calculus of Losses
Robert C. Williamson, Zac Cranko

TL;DR
This paper introduces a novel convex set-based framework for understanding and designing loss functions in statistical decision problems, offering new theoretical insights and tools for customizing losses.
Contribution
It develops a convex set perspective on loss functions, establishing relationships with norms, enabling loss interpolation, and introducing polar loss functions for improved decision-making.
Findings
Established a link between losses and (anti)-norms.
Created a calculus for interpolating between different losses.
Introduced polar loss functions as universal substitution functions.
Abstract
Statistical decision problems lie at the heart of statistical machine learning. The simplest problems are binary and multiclass classification and class probability estimation. Central to their definition is the choice of loss function, which is the means by which the quality of a solution is evaluated. In this paper we systematically develop the theory of loss functions for such problems from a novel perspective whose basic ingredients are convex sets with a particular structure. The loss function is defined as the subgradient of the support function of the convex set. It is consequently automatically proper (calibrated for probability estimation). This perspective provides three novel opportunities. It enables the development of a fundamental relationship between losses and (anti)-norms that appears to have not been noticed before. Second, it enables the development of a calculus of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference · Machine Learning and Algorithms · Statistical Methods and Inference
