mlsanityData to 14 Oct 2026

Contrasting Cost-Agnostic and Cost-Sensitive Losses under Limited Model Capacity via mathcal H-consistency

arXiv 2502.19522 ↗First posted 26 Feb 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

There is a prevalent debate in machine learning about whether practitioners should train models to optimize a task-agnostic objective (e.g., cross entropy) or incorporate the downstream decision task into the optimization objective (e.g., weighted cross entropy). In ideal settings, like those with infinite data and infinite model capacity, the two approaches are statistically equivalent for the downstream decision task. In practice, however, incorporating the decision task into model training has been shown to empirically improve task-specific performance in certain real-world scenarios. The cause of these benefits has not been theoretically studied to date. Focusing on the setting with limited model capacity through the model class mathcal H, we establish a strict performance gap between post-processing a model learned with a cost-agnostic objective (e.g., thresholding a risk score prediction) and models learned by optimizing a cost-sensitive model without a threshold search. In particular, we establish this gap when there is a hypothesis recovering the optimal decision boundary for the discrete task, but it does not align with the optimal cost-agnostic hypothesis, and give a simple example demonstrating the plausibility of this setting. With assumptions that are hard to verify in practice, we demonstrate that this gap generally exists on classification datasets from the UCI repository, particularly with very simple models.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 13 of its 48 references that are in the map. First posted on arXiv 26 Feb 2025.

Builds on

13 of 48 references.

References · 13

  1. 2017Smart "Predict, then Optimize"cited by 339
  2. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 227
  3. 2020The Real-World-Weight Cross-Entropy Loss Function: Modeling the Costs of Mislabelingcited by 64
  4. 2021Calibration and Consistency of Adversarial Surrogate Lossescited by 47
  5. 2020Calibrated Surrogate Losses for Adversarially Robust Classificationcited by 36
  6. 2021A Finer Calibration Analysis for Adversarial Robustnesscited by 26
  7. 2024Realizable H-Consistent and Bayes-Consistent Loss Functions for Learning to Defercited by 26
  8. 2014Convex Calibration Dimension for Multiclass Loss Matricescited by 21
  9. 2024H-Consistency Guarantees for Regressioncited by 21
  10. 2015The Lov'asz Hinge: A Novel Convex Surrogate for Submodular Lossescited by 17
  11. 2021Surrogate Regret Bounds for Polyhedral Lossescited by 15
  12. 2022An Embedding Framework for the Design and Analysis of Consistent Polyhedral Surrogatescited by 14
1 more
  1. 2022Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Lossescited by 12

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.