atlas

Research map / Optimization / Nonconvex and smooth optimization

Adaptive and Universal Algorithms for Variational Inequalities with Optimal Convergence

AAAI 2022 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 5 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
Set adaptive step sizes using operator-value differences rather than iterate movementAdaPEG scalar on bounded-domain variational inequalities · Non-smooth, smooth, and stochastic settingsconvergence rate: Ω(\sqrt{\ln T})Helped
Use one operator evaluation per iteration instead of two (ablation)AdaPEG and its 2-call variants · Bilinear saddle-point experimentsperformanceNo clear effect
Remove the additional \((\gamma_t-\gamma_{t-1})\|u-x_t\|^2\) term from the update for z_t (ablation)AdaPEG · Bilinear problems with bounded feasible domainperformanceNo clear effect
Remove the additional \((\gamma_t-\gamma_{t-1})\|u-x_t\|^2\) term from the update for z_t (ablation)AdaPEG · Unconstrained stochastic bilinear problemsperformanceMixed
Use per-coordinate step sizes instead of a scalar step size (ablation)AdaPEG · Some bilinear saddle-point experimentsperformanceHelped

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