AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpoint

Yoav S Freund, Yi-An Ma, Tong Zhang

NeurIPS 2022 · Optimization › Nonconvex and smooth optimization · approach: Langevin sampling for nonconvex problems

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 explicitly integrable strongly convex prior diffusion alongside likelihood gradient stepsLangevin Algorithm with Prior Diffusion · Lipschitz convex posteriorgradient queries: T = \frac{5 G^2}{\beta m \epsilon}Improved
Use streaming stochastic likelihood gradients with prior diffusionStreaming SGLD with Prior Diffusion · Lipschitz convex posteriorgradient queries: T = \frac{5 G_\ell^2}{\beta m \epsilon}Improved
Use a quadratic normal prior and bound smoothness through the HessianLangevin Algorithm with Prior Diffusion · Smooth convex posteriorgradient queries: T = 64 \cdot \max\lrbb{ \frac{8\trace\lrp{H^2}}{m^2 \epsilon}, \frac{2 U(0) }{\epsilon} }Improved
Apply the smooth-case method to ridge-separable likelihoodsLangevin Algorithm with Prior Diffusion · Ridge-separable smooth convex posteriorgradient queries: T = 64 \cdot \max\lrbb{ \frac{ 8 L_s^2 R_z^2}{m^2 \epsilon}, \frac{2 U(0)}{\epsilon} }Improved

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