atlas

Research map / Learning theory and algorithms / Sample complexity

Bayes-Optimal BER and AUC: Estimation and Evaluation of Estimators

NeurIPS 2026 · Learning theory and algorithms › Sample complexity · approach: Optimal mean estimation and subsampling · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes soft-label-based estimators of the Bayes-optimal balanced error rate (BER) and AUC, handling known and unknown class priors and order-preserving corrupted soft labels, and extends the FeeBee evaluation framework to score any such estimator without knowing the true optimum.

Problem

Estimating the Bayes-optimal BER and AUC for binary classification is underexplored, and evaluating such estimators on real datasets is hard because the true optimum is unobservable.

Approach

Plug-in estimators of BER* and AUC* from soft labels; under corruption, recover clean soft labels via isotonic regression with auxiliary hard labels and estimate the prior with a clipped mean of hard labels; extend FeeBee by using a closed-form relation between optima and noise-injected optima to score estimators without the true optimum.

Limitations

Experimental setup

Metrics: balanced error rate AUC estimation error

Builds on: FeeBee Bayes error estimation from soft labels

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy