Neyman-Pearson classification, convexity and stochastic constraints
From MaRDI portal
Publication:5396711
zbMath1280.62080arXiv1102.5750MaRDI QIDQ5396711
Publication date: 3 February 2014
Full work available at URL: https://arxiv.org/abs/1102.5750
binary classificationempirical risk minimizationanomaly detectionchance constrained optimizationNeyman-Pearson paradigmempirical constraint
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Parametric hypothesis testing (62F03) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (19)
Neyman-Pearson classification: parametrics and sample size requirement ⋮ Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs ⋮ An elementary analysis of the probability that a binomial random variable exceeds its expectation ⋮ A lower bound on the probability that a binomial random variable is exceeding its mean ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ Unnamed Item ⋮ On the probability that a binomial variable is at most its expectation ⋮ First-Order Methods for Problems with $O$(1) Functional Constraints Can Have Almost the Same Convergence Rate as for Unconstrained Problems ⋮ Asymmetric Error Control Under Imperfect Supervision: A Label-Noise-Adjusted Neyman–Pearson Umbrella Algorithm ⋮ \(L_1\)-penalized fraud detection support vector machines ⋮ Hierarchical Neyman-Pearson Classification for Prioritizing Severe Disease Categories in COVID-19 Patient Data ⋮ Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization ⋮ Set-Valued Support Vector Machine with Bounded Error Rates ⋮ Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints ⋮ Tight lower bound on the probability of a binomial exceeding its expectation ⋮ Comment on ``Hypothesis testing by convex optimization ⋮ Best lower bound on the probability of a binomial exceeding its expectation ⋮ Intentional Control of Type I Error Over Unconscious Data Distortion: A Neyman–Pearson Approach to Text Classification ⋮ On the Chvátal-Janson conjecture
This page was built for publication: Neyman-Pearson classification, convexity and stochastic constraints
