atlas

Research map / Optimization / Nonconvex and smooth optimization

The power of first-order smooth optimization for black-box non-smooth problems

ICML 2022 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 11 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
Batched accelerated gradient inside the randomized smoothing scheme (batch-parallel zeroth-order method)non-smooth convex optimization · theory, p=2iteration complexityHelped
Use of Shamir-style two-point gradient estimator with batching instead of Duchi et al. style finite differencesnon-smooth convex zeroth-order optimization · theoryoracle complexityHelped
Replace batched accelerated gradient with batched consensus-projected method in decentralized settingnon-smooth decentralized saddle-point problems · theorycommunication rounds: ~sqrt(d) factor lossHurt
Smoothing scheme with one-point instead of two-point feedbackstochastic non-smooth optimization · theoryoracle complexityHurt

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