AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

A Simple and Efficient Smoothing Method for Faster Optimization and Local Exploration

Kevin Scaman, Ludovic DOS SANTOS, Merwan Barlier, Igor Colin

NeurIPS 2020 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 3 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
use BMR smoothing instead of randomized smoothing (RS)zeroth-order smoothing optimizer · f_R (non-symmetric piecewise linear)normalized progress (f(x0)-f(xt))/(f(x0)-f(x*))Improved
couple alpha and gamma with exponential gamma decay schedule (alpha proportional to gamma^-2)BMR · f_PWL piecewise linearnormalized progressImproved
choose too small an initial gammaRS and BMR · f_PWL piecewise linearnormalized progressHurt
increase alphaBMR · f_F Fourier functionnormalized progressImproved
increase alpha from 10 to 100BMR · f_F and f_FCnormalized progressMixed
use BMR instead of RSsmoothing optimizer · f_FC (clipped Fourier)normalized progressHurt
increase alphaBMR · f_F and f_FCgradient norm at convergenceImproved

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