mlsanityData to 7 Oct 2026

Accelerating Nonconvex Learning via Replica Exchange Langevin Diffusion

arXiv 2007.01990 ↗First posted 4 Jul 2020stat.ML cs.LG math.PRcited by 15

Not on the map. Why?

Abstract (arXiv)

Langevin diffusion is a powerful method for nonconvex optimization, which enables the escape from local minima by injecting noise into the gradient. In particular, the temperature parameter controlling the noise level gives rise to a tradeoff between ``global exploration'' and ``local exploitation'', which correspond to high and low temperatures. To attain the advantages of both regimes, we propose to use replica exchange, which swaps between two Langevin diffusions with different temperatures. We theoretically analyze the acceleration effect of replica exchange from two perspectives: (i) the convergence in chi2-divergence, and (ii) the large deviation principle. Such an acceleration effect allows us to faster approach the global minima. Furthermore, by discretizing the replica exchange Langevin diffusion, we obtain a discrete-time algorithm. For such an algorithm, we quantify its discretization error in theory and demonstrate its acceleration effect in practice.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 3; 2025: 6; 2026: 1.

15 papers.

Sort: