Tightening Control in Neyman--Pearson Linear Classification

arXiv:2607.03590 · math.ST, stat.ME, stat.ML · Submitted 2026-07-03 · Read on arXiv

Yijian Huang

math.ST, stat.ME, stat.ML

Submitted: 2026-07-03

Comments: 24 pages, 1 figure

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Accuracy — 33× in this paper · explained in 1 episode
• Consistency — 1× in this paper · explained in 3 episodes
• False Negatives — 1× in this paper · explained in 2 episodes
• Feature Selection — 1× in this paper · explained in 4 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes

Sources

• Cross-Audit Projection for Model Risk Prediction
• Non-splitting Neyman-Pearson Classifiers

Related papers

• Conformal Prediction for Dyadic Regression Under Complex Missingness
• Sharp Asymptotic Theory of Maximum Likelihood Estimation for Gaussian Processes with an RBF Kernel
• Bentkus-type asymptotic e-values
• High-Dimensional Asymptotics of Differentially Private PCA
• A proximal gradient algorithm for composite log-concave sampling
• KL Convergence Guarantees for Score diffusion models under minimal data assumptions