The paper investigates the consistency of surrogate loss methods for classification and policy learning when the set of admissible classifiers is constrained, such as by interpretability or fairness requirements. It shows that hinge loss is the only surrogate that preserves consistency when constraints limit only the prediction set, but consistency can fail if constraints also restrict the functional form. The authors derive conditions guaranteeing consistency for hinge-risk-minimizing classifiers and use these results to design efficient hinge-loss-based procedures for monotone classification problems.
By Toru Kitagawa, Shosei Sakaguchi, Aleksey Tetenov
arXiv:2505. 04757v2 Announce Type: replace Abstract: This paper introduces a novel approach to contextual stochastic optimization, integrating operations research and machine learning to address decision-making under uncertainty.
By Louis Bouvier, Thibault Prunet, Vincent Lecl\`ere, Axel Parmentier
arXiv:2604. 27742v2 Announce Type: replace Abstract: A fundamental dichotomy in the theory of classification sets smoothness against statistical efficiency: smooth surrogate losses such as the logistic loss enable fast $O(1/T)$ optimization but yield slow square-root $H$-consistency bounds, while piecewise-linear losses like the Hinge loss achieve optimal linear $H$-consistency rates but are non-differentiable.
By Mehryar Mohri, Yutao Zhong
arXiv:2307.02719v5 Announce Type: replace
Abstract: Uncertainty sampling is a classical active-learning strategy, yet the statistical objective induced by its query rule is often implicit. We introdu...
By Shang Liu, Xiaocheng Li
The paper introduces the Fragility Index (FI), a new performance metric that measures the tail risk of confident misclassifications in classification models. FI is framed within a robust satisficing framework to assess classifier sensitivity under distributional uncertainty, and the authors develop a surrogate-based training method with provable bounds linking training fragility to ranking-error FI. The approach is extended to common loss functions and includes an FI-based regularizer for deep neural networks, with empirical studies on medical diagnosis tasks showing that FI reveals risk not captured by accuracy or AUC and leads to models with lower operational costs in a human–AI diagnostic workflow.
By Zheng Cui, Daniel Zhuoyu Long, Jin Qi, Chen Yang, Ruohan Zhan
arXiv:2610.09984v1 Announce Type: cross
Abstract: While binary classification is one of the most extensively studied problems in machine learning,
the regime in which the goal is to learn a classif...
By Samuel Gruffaz, Muhammad Fawad, Jaakko Nevalainen
The paper introduces a method for risk‑averse machine learning that uses credal sets—collections of probability distributions—to capture epistemic uncertainty about the true loss distribution. By producing predictions as credal sets and applying a novel decision rule that selects a single predictive distribution for conditional value‑at‑risk (CVaR) minimization, the approach aims to reliably avoid catastrophic decisions across classification, distribution shift, and reinforcement learning scenarios while maintaining near‑optimal expected performance.
By Timo L\"ohr, Paul Hofman, Maximilian Muschalik, Eyke H\"ullermeier
arXiv:2607. 11947v1 Announce Type: cross Abstract: Typical semi-supervised learning (SSL) methods rely on distributional assumptions, and their performance degrades when these are violated.
By Yushi Hirose, Hiroo Irobe, Takafumi Kanamori
arXiv:2511. 22823v2 Announce Type: replace-cross Abstract: Weakly supervised learning has emerged as a practical alternative to fully supervised learning when complete and accurate labels are costly or infeasible to acquire.
By Miao Zhang, Junpeng Li, Changchun Hua, Yana Yang
arXiv:2602. 23128v2 Announce Type: replace Abstract: Generalization bounds for deep learning models are typically vacuous, not computable or restricted to specific model classes.
By Mathieu Bazinet, Valentina Zantedeschi, Pascal Germain
arXiv:2610.28025v1 Announce Type: cross
Abstract: This paper studies the problem of aggregation in multiclass classification, generalizing existing results for binary classification. Given a finite d...
By Felix Abramovich, Or Davidovitch-Servadio
The paper proposes a distributionally robust regularization technique for mixed‑integer sparse programming models used in explainable machine learning. It extends recent DRO advances, traditionally applied to convex formulations, to mixed‑integer settings, offering statistical guarantees linked to a sparsity parameter. The method is demonstrated on binary classification models built from feature‑value rule sets.
By Sanjeeb Dash, Soumyadip Ghosh, Joao Goncalves, Mark S. Squillante