atlas

Research map / Optimization / Nonconvex and smooth optimization

UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees

ICML 2022 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 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
Replace UNIXGRAD's Bregman-diameter-based step size with UNDERGRAD's adaptive dual-extrapolation step size (reweighted gradients, mirror map) using entropic regularizer on simplexUNDERGRAD · Simplex (d=100), linear losses, perfect oraclesuboptimality gap f(x)-min f convergence rateHelped
UNIXGRAD with small initial step size (10E-3 or smaller) versus UNDERGRAD step size (ablation)UNIXGRAD · Simplex (d=100), perfect oracleconvergence rateMixed
UNIXGRAD with initial step size equal to or larger than UNDERGRAD's learning rate (ablation)UNIXGRAD · Simplex (d=100), perfect oracleconvergence rateHurt
Gradient reweighting with UNDERGRAD step size on noisy oracleUNDERGRAD · Simplex (d=100), noisy SFOconvergence rateHelped
UNIXGRAD with small initial step size (e.g., 10^-3 times eta_1) in noisy setting (ablation)UNIXGRAD · Simplex (d=100), noisy SFOconvergence rateHurt

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