Papers › Constrained Exploration via Reflected Replica Exchange Stochastic Gradient Langevin Dynamics

Constrained Exploration via Reflected Replica Exchange Stochastic Gradient Langevin Dynamics

13 May 2024arXiv:2405.07839archive 2025-07-28

Haoyang Zheng, Hengrong Du, Qi Feng, Wei Deng, Guang Lin

Replica exchange stochastic gradient Langevin dynamics (reSGLD) is an effective sampler for non-convex learning in large-scale datasets. However, the simulation may encounter stagnation issues when the high-temperature chain delves too deeply into the distribution tails. To tackle this issue, we propose reflected reSGLD (r2SGLD): an algorithm tailored for constrained non-convex exploration by utilizing reflection steps within a bounded domain. Theoretically, we observe that reducing the diameter of the domain enhances mixing rates, exhibiting a quadratic behavior. Empirically, we test its performance through extensive experiments, including identifying dynamical systems with physical constraints, simulations of constrained multi-modal distributions, and image classification tasks. The theoretical and empirical findings highlight the crucial role of constrained exploration in improving the simulation efficiency.

PaperPDFCode

Code

haoyangzheng1996/r2sgld officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Image Classificationimage-classification

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

reSGLD

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections