AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Unifying lower bounds on prediction dimension of convex surrogates

Jessica Finocchiaro, Rafael Frongillo, Bo Waggoner

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Robust and surrogate-loss learning bounds · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 d-flat containment instead of the feasible subspace dimension boundAbstain loss lower bound · Abstain loss, 3 labels, uniform distributionconvex consistency dimension lower bound: 0 -> 2Improved
Use d-flat containment to lower-bound prediction dimensionAbstain loss lower bound · Abstain loss, 3 labels, distribution (1/4, 1/4, 1/2)convex consistency dimension lower bound: 1 -> 1No clear effect
Elicit the first two moments and link them to varianceConvex surrogate for variance · Variance estimationconvex elicitation complexity: 2Improved
Apply the d-flat lower-bound framework to CVaR_αConvex surrogate for CVaR_α · CVaR_α estimationconvex elicitation complexity lower bound: ≥ 2Improved

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