Variable transformations in consistent loss functions
Hristos Tyralis, Georgia Papacharalampous

TL;DR
This paper develops a theoretical framework to understand variable transformations in consistent loss functions, extending existing principles and enabling new applications in statistical and machine learning models.
Contribution
It provides formal characterizations of transformed loss functions and identification functions, broadening the theoretical foundation for designing loss functions in complex predictive tasks.
Findings
Framework applies to Bregman and expectile loss functions.
Constructs new identifiable and elicitable functionals.
Demonstrates practical utility with real-world data.
Abstract
The empirical use of variable transformations within (strictly) consistent loss functions is widespread, yet a theoretical understanding is lacking. To address this gap, we develop a theoretical framework that establishes formal characterizations of (strict) consistency for such transformed loss functions. Our analysis focuses on two interrelated cases: (a) transformations applied solely to the realization variable and (b) bijective transformations applied jointly to both the realization and prediction variables. These cases extend the well-established framework of transformations applied exclusively to the prediction variable, as formalized by Osband's revelation principle. We further develop analogous characterizations for (strict) identification functions. The resulting theoretical framework is broadly applicable to statistical and machine learning methodologies. For instance, we…
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.
