activity
20212026
most citedSampling is as easy as learning the score: theory for diffusion models with minimal data assumptions

15 citations · 56 across the 38 of their papers we have counts for

collaborators
Showing 2022Show all

7 papers · 1 filter

stat.ML2022★ 2 cited

Fisher information lower bounds for sampling

Sinho Chewi, Patrik Gerber, Holden Lee +1

We prove two lower bounds for the complexity of non-log-concave sampling within the framework of Balasubramanian et al. (2022), who introduced the use of Fisher information (FI) bo…

cs.LG2022★ 15 cited

Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions

Sitan Chen, Sinho Chewi, Jerry Li +3

We provide theoretical convergence guarantees for score-based generative models (SGMs) such as denoising diffusion probabilistic models (DDPMs), which constitute the backbone of la…

math.OC2022

On the complexity of finding stationary points of smooth functions in one dimension

Sinho Chewi, Sébastien Bubeck, Adil Salim

We characterize the query complexity of finding stationary points of one-dimensional non-convex but smooth functions. We consider four settings, based on whether the algorithms und…

stat.ML2022★ 12 cited

Variational inference via Wasserstein gradient flows

Marc Lambert, Sinho Chewi, Francis Bach +2

Along with Markov chain Monte Carlo (MCMC) methods, variational inference (VI) has emerged as a central computational approach to large-scale Bayesian inference. Rather than sampli…

math.PR2022★ 1 cited

An entropic generalization of Caffarelli's contraction theorem via covariance inequalities

Sinho Chewi, Aram-Alexandre Pooladian

The optimal transport map between the standard Gaussian measure and an -strongly log-concave probability measure is -Lipschitz, as first observed in a celebrated theor…

math.ST2022★ 3 cited

Improved analysis for a proximal algorithm for sampling

Yongxin Chen, Sinho Chewi, Adil Salim +1

We study the proximal sampler of Lee, Shen, and Tian (2021) and obtain new convergence guarantees under weaker assumptions than strong log-concavity: namely, our results hold for (…

math.ST2022★ 4 cited

Towards a Theory of Non-Log-Concave Sampling: First-Order Stationarity Guarantees for Langevin Monte Carlo

Krishnakumar Balasubramanian, Sinho Chewi, Murat A. Erdogdu +2

For the task of sampling from a density on , where is possibly non-convex but -gradient Lipschitz, we prove that averaged Langevin Monte Ca…