Accelerating Constrained Sampling: A Large Deviations Approach
Yingli Wang, Changwei Tu, Xiaoyu Wang, Lingjiong Zhu

TL;DR
This paper introduces a large deviations approach to optimize skew-symmetric matrices in skew-reflected Langevin dynamics, enhancing constrained sampling efficiency and reducing variance.
Contribution
It establishes a large deviation principle for SRNLD with a specific skew-symmetric matrix choice, demonstrating accelerated convergence and improved performance over existing methods.
Findings
The chosen skew-symmetric matrix accelerates convergence to the target distribution.
The approach reduces asymptotic variance in sampling.
Numerical experiments validate theoretical improvements.
Abstract
The problem of sampling a target probability distribution on a constrained domain arises in many applications including machine learning. For constrained sampling, various Langevin algorithms such as projected Langevin Monte Carlo (PLMC), based on the discretization of reflected Langevin dynamics (RLD) and more generally skew-reflected non-reversible Langevin Monte Carlo (SRNLMC), based on the discretization of skew-reflected non-reversible Langevin dynamics (SRNLD), have been proposed and studied in the literature. This work focuses on the long-time behavior of SRNLD, where a skew-symmetric matrix is added to RLD. Although acceleration for SRNLD has been studied, it is not clear how one should design the skew-symmetric matrix in the dynamics to achieve good performance in practice. We establish a large deviation principle (LDP) for the empirical measure of SRNLD when the skew-symmetric…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
