AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization

Liang Zhang, Junchi YANG, Amin Karbasi, Niao He

NeurIPS 2023 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods · 1 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
Add quadratic regularization and solve the auxiliary problem with AGDConvex minimization with inexact initialization · Smooth convex minimization, inexact initializationreproducibility: \cO(\delta^2) -> \cO(\delta^2)No clear effect
Apply the regularized framework with Inexact-AGDConvex minimization with inexact deterministic gradients · Smooth convex minimization, inexact gradientreproducibility: \cO(\delta^2/\epsilon^2) -> \cO(\delta^2/\epsilon^{5/2})Hurt
Add regularization and use EG to solve the auxiliary minimax problemConvex-concave minimax optimization · Smooth convex-concave minimax, inexact initializationreproducibility: \cO(\delta^2 e^{\nicefrac{1}{\epsilon}} \wedge (\delta^2 + 1/\epsilon^2)) -> \cO(\delta^2)Improved
Add regularization and use Inexact-EG for the auxiliary minimax problemConvex-concave minimax optimization · Smooth convex-concave minimax, inexact gradientreproducibility: \cO(\delta^2 e^{\nicefrac{1}{\epsilon}} \wedge 1/\epsilon^2) -> \cO(\delta^2/\epsilon^2)Improved
Use a two-loop proximal point framework centered at the previous iterateConvex-concave minimax optimization · Smooth convex-concave minimax, inexact initializationreproducibility: \cO(\delta^2)Improved
Use a two-loop proximal point framework centered at the previous iterateConvex-concave minimax optimization · Smooth convex-concave minimax, inexact gradientreproducibility: \cO(\delta^2/\epsilon^2)Improved
Use SGDA with stochastic gradientsStochastic convex-concave minimax optimization · Stochastic smooth convex-concave minimaxsample complexity: \cO(1/\epsilon^2)No clear effect
Use SGDA with stochastic gradientsStochastic convex-concave minimax optimization · Stochastic smooth convex-concave minimaxreproducibility: \cO\roundBr*{\delta^2/(\epsilon^2 T)}No 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