Non-convex sampling for a mixture of locally smooth potentials
Dao Nguyen

TL;DR
This paper studies non-convex sampling using Euler discretization for potentials that are mixtures of locally smooth distributions, providing convergence guarantees with polynomial dependence on dimension and improved rates under certain smoothness conditions.
Contribution
It introduces novel concepts of $oldsymbol{ extalpha_{G}}$-mixture locally smooth and $oldsymbol{ extalpha_{H}}$-mixture locally Hessian smooth potentials, and proves convergence in KL divergence with polynomial complexity.
Findings
Convergence in KL divergence with polynomial iteration complexity.
Improved convergence rates for 1-smooth and Hessian smooth potentials.
Theoretical properties of $p$-generalized Gaussian smoothing and Wasserstein convergence.
Abstract
The purpose of this paper is to examine the sampling problem through Euler discretization, where the potential function is assumed to be a mixture of locally smooth distributions and weakly dissipative. We introduce -mixture locally smooth and -mixture locally Hessian smooth, which are novel and typically satisfied with a mixture of distributions. Under our conditions, we prove the convergence in Kullback-Leibler (KL) divergence with the number of iterations to reach -neighborhood of a target distribution in only polynomial dependence on the dimension. The convergence rate is improved when the potential is -smooth and -mixture locally Hessian smooth. Our result for the non-strongly convex outside the ball of radius is obtained by convexifying the non-convex domains. In addition, we provide some nice theoretical properties of…
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.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Advanced Mathematical Modeling in Engineering · Numerical methods in inverse problems
