arXiv Machine Learning
Extreme Binary Classification: Extreme Value Theory for Extreme Constraint on False Negative
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Oct 2
Partial AUC Maximization from Positive-unlabeled Data
arXiv:2610.00284v1 Announce Type: cross Abstract: The partial area under the receiver operating characteristic curve (pAUC) is an important performance metric for binary classification that summarize...
arXiv Machine Learning
Sep 22
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 AI
Jun 16
Beyond Rebalancing: Benchmarking Binary Classifiers Under Class Imbalance Without Rebalancing Techniques
arXiv:2509. 07605v2 Announce Type: replace-cross Abstract: Class imbalance poses a significant challenge to supervised classification, particularly in critical domains like medical diagnostics and anomaly detection where minority class instances are rare.
arXiv Machine Learning
Jun 16
Imbalanced Classification under Capacity Constraints
arXiv:2605. 03289v2 Announce Type: replace-cross Abstract: Detecting observations from a minority class under severe class imbalance is a central challenge in applications such as fraud detection, medical screening, and industrial quality control.
arXiv Machine Learning
Sep 11
AUC Maximization from Biased Positive-unlabeled Data with Confidence
The paper introduces a method for maximizing the area under the receiver operating characteristic curve (AUC) when only biased positive and unlabeled (PU) data are available. It leverages confidence scores—probabilities that an instance is positive—associated with a small set of labeled positives to derive an AUC risk estimator that accounts for bias. Experiments on eight real-world datasets demonstrate the method’s effectiveness.
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...