arXiv Machine Learning

Classification with Abstention Under Class-Conditional Error Constraints

The paper investigates binary classification with abstention under separate class‑conditional error constraints, aiming to minimize abstention while keeping both error types below specified thresholds. It derives the distribution‑free minimax rate of excess abstention risk, introduces surrogate‑loss formulations for computational feasibility with models like neural networks, and provides finite‑sample guarantees for excess surrogate ambiguity risk. The authors also formulate the learning task as a constrained optimization problem, analyze its computational complexity in the convex setting, and empirically evaluate the approach against a competing method on several datasets.

arXiv Statistics ML
Oct 1

Constrained Classification and Policy Learning

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 Machine Learning
Aug 13

Linear-Core Surrogates: Smooth Loss Functions with Linear Rates for Classification and Structured Prediction

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 Machine Learning
Oct 23

Fragility-aware Classification for Risk Characterization and Robust Learning

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 Machine Learning
Oct 9

Credal Machine Learning for Risk-Averse Decision Making

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 Statistics ML
Oct 21

Optimal aggregation in multiclass classification

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
arXiv AI
Oct 16

Distributionally Robust Regularization of Sparse Integer Programming Trained Learning Models

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