AI Paper Atlas

Research map / Bandits and online learning / Online convex optimization and games

Stochastic Zeroth-Order Optimization under Nonstationarity and Nonconvexity

Abhishek Roy, Krishnakumar Balasubramanian, Saeed Ghadimi, Prasant Mohapatra

JMLR 2022 · Bandits and online learning › Online convex optimization and games · approach: Dynamic and adaptive regret

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 zeroth-order two-point gradient estimates (Algorithm 1) instead of exact stochastic gradientsfirst-order nonstationary regret algorithm · Synthetic nonstationary nonconvex problem, two-point setting, T=2000, W_T=sqrt(T)cumulative first-order regretNo clear effect
use zeroth-order one-point gradient estimates instead of exact stochastic gradientsfirst-order nonstationary regret algorithm · Synthetic nonstationary nonconvex problem, one-point setting, T=2000cumulative first-order regretNo clear effect
use zeroth-order cubic-regularized Newton (Algorithm 3) instead of one with Hessian access (Algorithm 2)higher-order cubic Newton algorithm · Synthetic nonstationary nonconvex problem, T=1000, W_T=sqrt(T)cumulative second-order regretNo clear effect

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