atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Optimal Binary Classifier Aggregation for General Losses

NeurIPS 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Consistency of surrogate losses · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a general loss (non-convex partial losses allowed) for the minimax aggregation game, with the slack function minimized over ensemble weights instead of an ad hoc predictorsemi-supervised binary ensemble aggregation (minimax optimal predictor) · theoretical analysis, general losses satisfying monotone partial-loss assumptionminimax worst-case expected lossNo clear effect
Add convexity condition (A), (B), or (C) on the partial losses (e.g., convex partial losses, proper loss, or l_-' l_+'' >= l_-'' l_+')slack function / potential well Psi · theoretical analysis of convexity of the potential wellconvexity of the slack functionHelped

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