AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Integration Methods and Optimization Algorithms

Damien Scieur, Vincent Roulet, Francis Bach, Alexandre d'Aspremont

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics · 26 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
replace Euler (gradient descent) with the two-step scheme M1 equal to Nesterov's method, using a larger integration step sizegradient flow discretization on L-smooth mu-strongly convex functions · theoretical convergence rateconvergence rateImproved
tune two-step method parameters to the optimal step size (M2) instead of h-hat = 1/L (M1)two-step linear multistep method on quadratics · linear ODE (quadratic minimization)largest root modulus (rate)Improved
use heavy ball (M2 = Polyak) on general smooth strongly convex functions rather than only quadraticsPolyak heavy ball method · general smooth strongly convex functionsconvergenceHurt
use optimal versus small step size in integration of a linear ODEEuler, Nesterov and Polyak schemes · Figure 1 simulationtrajectory tracking of exact solutionMixed

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