A Neyman–Pearson Approach to Statistical Learning

DOI10.1109/TIT.2005.856955zbMath1318.62054MaRDI QIDQ3547601

Clayton Scott, Robert D. Nowak

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Minimax procedures in statistical decision theory (62C20) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Statistical aspects of information-theoretic topics (62B10)

Related Items

Optimization with Non-Differentiable Constraints with Applications to Fairness, Recall, Churn, and Other Goals ⋮ Neyman-Pearson classification: parametrics and sample size requirement ⋮ Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs ⋮ Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm ⋮ Class-prior estimation for learning from positive and unlabeled data ⋮ Classification accuracy as a proxy for two-sample testing ⋮ Overlaying classifiers: A practical approach to optimal scoring ⋮ Conflicting evidence and decisions by agency professionals: an experimental test in the context of Merger regulation ⋮ Asymmetric Error Control Under Imperfect Supervision: A Label-Noise-Adjusted Neyman–Pearson Umbrella Algorithm ⋮ Classification with minimum ambiguity under distribution heterogeneity ⋮ Unnamed Item ⋮ Adaptive novelty detection with false discovery rate guarantee ⋮ Hierarchical Neyman-Pearson Classification for Prioritizing Severe Disease Categories in COVID-19 Patient Data ⋮ Optimal subgroup selection ⋮ Reliable agnostic learning ⋮ The false discovery rate for statistical pattern recognition ⋮ Variational analysis of constrained M-estimators ⋮ Analysis to Neyman-Pearson classification with convex loss function ⋮ Optimal classification scores based on multivariate marker transformations ⋮ Adaptive Estimation of the Optimal ROC Curve and a Bipartite Ranking Algorithm ⋮ Rademacher complexity in Neyman-Pearson classification