atlas

Research map / Optimization / Nonconvex and smooth optimization

Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates

NeurIPS 2019 · Optimization › Nonconvex and smooth optimization · approach: Langevin sampling for nonconvex problems · 7 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
Use stochastic proximal operators for nonsmooth graph total-variation terms instead of stochastic subgradientsSPLA versus SSLA · Graph Trend Filtering: Facebook, YouTube, Amazon, and DBLP graphsNumerical stabilityHelped
Use stochastic updates instead of a full proximity operatorSPLA and SSLA versus ProxLA · Graph Trend Filtering, Facebook graphUpdate frequency: about one hundred times more frequentlyHelped
Use stochastic proximal operators instead of stochastic subgradientsSPLA versus SSLA · Graph Trend Filtering, large graphsFunctional value over CPU timeHelped
Use stochastic proximity steps rather than stochastic subgradient stepsSPLA versus SSLA · Laplace sampling toy modelSampling precisionHelped

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