atlas

Research map / Learning theory and algorithms / Sample complexity

Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness

NeurIPS 2021 · Learning theory and algorithms › Sample complexity · approach: Statistical-query lower bounds · 0 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 the new softmax-based, randomized-smoothed hard function construction instead of the prior randomized-smoothing lower-bound constructionRandomized p-th-order smooth convex optimization · p-th-order smooth convex optimizationoracle-query lower-bound exponent: \Omega_p\left(\left({L_pR^{p+1}}/{\epsilon}\right)^{2/(5p+1)}\right) -> \Omega_p\left(\left( {L_pR^{p+1}}/{\epsilon} \riHelped
Extend the information-hiding lower-bound construction to quantum oracle queriesQuantum p-th-order smooth convex optimization · p-th-order smooth convex optimizationoracle-query lower bound: k queriesHelped
Extend the information-hiding lower-bound construction to polynomially many parallel queries per roundParallel randomized p-th-order smooth convex optimization · p-th-order smooth convex optimizationquery rounds lower bound: k roundsHelped

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