Consistency Conditions for Differentiable Surrogate Losses

Drona Khurana, Anish Thilagar, Dhamma Kimpara, Rafael Frongillo
5/19/2025
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

The statistical consistency of surrogate losses for discrete prediction tasks is often checked via the condition of calibration. However, directly verifying calibration can be arduous. Recent work shows that for polyhedral surrogates, a less arduous condition, indirect elicitation (IE), is still equivalent to calibration. We give the first results of this type for non-polyhedral surrogates, specifically the class of convex differentiable losses. We first prove that under mild conditions, IE and calibration are equivalent for one-dimensional losses in this class. We construct a counter-example that shows that this equivalence fails in higher dimensions. This motivates the introduction of strong IE, a strengthened form of IE that is equally easy to verify. We establish that strong IE implies calibration for differentiable surrogates and is both necessary and sufficient for strongly convex, differentiable surrogates. Finally, we apply these results to a range of problems to demonstrate the power of IE and strong IE for designing and analyzing consistent differentiable surrogates.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{khurana2025consistency,
  title  = {Consistency Conditions for Differentiable Surrogate Losses},
  author = {Drona Khurana and Anish Thilagar and Dhamma Kimpara and Rafael Frongillo},
  year   = {2025},
  eprint = {2505.13760},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2505.13760v1},
  journal = {NEURIPS 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2505.13760.svg)](https://codeofpaper.com/paper/2505.13760)

Discussion