Skip to content
Preprint

Tightening Control in Neyman--Pearson Linear Classification

Jul 2026 · 0 citations · 19 references
Mathematics

TL;DR

It is conjecture that this under-control phenomenon is a manifestation of the over-optimism bias well known in standard statistical learning, and asymptotic theory is developed to confirm it.

Abstract

Neyman--Pearson classification prioritizes one class by constraining its accuracy above a prespecified level, and then takes the accuracy of the other class as the utility objective. This paradigm is well suited for disease screening and diagnosis, among other applications. Statistical learning under this framework is complicated since classifier performance determines its acceptability. Furthermore, no learned classifier that is consistent for the oracle classifier can guarantee satisfaction of the control constraint in finite samples. Classical learning theory targets a control-relaxed empirical utility maximization (EUM) classifier. However, even the EUM classifier fails to achieve the desired control level on average. We conjecture that this under-control phenomenon is a manifestation of the over-optimism bias well known in standard statistical learning, and develop asymptotic theory to confirm it. Motivated by this insight, we propose refined learning procedures under two accuracy control strategies for the prioritized class: one controlling accuracy in expectation and the other with high probability. We further develop training-data-based methods to predict and infer class-specific accuracies of the resulting classifiers. Simulation studies demonstrate favorable finite-sample performance, and we illustrate the proposed methods with an application to cancer detection.

View source

Similar papers

Preprint Aug 2026

A Data-dependent Early Stopping Rule using Rademacher Complexity with L1-norm

This work introduces an analytic framework that estimates the optimal time of early stopping without the need for training and can be successfully applied to nonlinear neural networks, as illustrated in the classification MNIST example.

D. Hoang, B. Berret, O. Bruneau et al. · 0 citations
Preprint Aug 2026

A Unified Descriptive-Complexity Framework for Model Selection under Correlated Designs

Model selection becomes particularly challenging under strong predictor dependence and model-class uncertainty, especially when there are exponentially many models. We propose a Descriptive-Complexity Information Criterion (DCIC) that regularizes large candidate model collections through Kraft-admissible code lengths....

Yan-Hang Zhang, Wei Liu, Yuheng Yang · 0 citations
Preprint Aug 2026

Fundamental Limitations of Data-Driven Control: A Statistical Decision Perspective

This contribution develops a statistical decision framework for data-driven control, in which a controller is evaluated by its risk, defined as the expected performance degradation relative to the oracle model-based controller, and by its average risk over the parameter space.

Jia-Bao He, Fei-Ran Zhao, Yu-Shan Li et al. · 0 citations
#machine learning Preprint Aug 2026

Comparing Corrupted Constrained Learning Problems

A generalized data processing inequality is formulated, requiring the constrained Bayes risk of a joint distribution to lower bound the constrained Bayes risk on the stochastically modified distribution, regardless of the choice of distribution, to be equivalent to a set containment condition on a specific function set...

Laura Iacovissi, Rabanus Derr, Robert C. Williamson · 0 citations
Preprint Jul 2026

Power and Limits of Subset Selection in Statistical Estimation

We study the power and limitations of subset selection in statistical estimation through the framework of \emph{super-teaching}, where a teacher selects a subset of i.i.d. data to optimize a learner's estimator. Unlike prior work focused on specific distributions or fixed subset sizes, we develop a general theory under...

D. Barak-Pelleg, D. Berend · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.