Fetching the paper…
Reading the bibliography…
This paper considers the problem of sampling from non-logconcave distribution, based on queries of its unnormalized density.
The mixing rate of markov chains, an isoperimetric inequality, and computing the volume
L. Lovász and M. Simonovits · 1990
Earlier work this paper cites.
A random polynomial-time algorithm for approximating the volume of convex bodies
M. Dyer, A. Frieze, and R. Kannan · 1991
Earlier work this paper cites.
An empirical bayes approach to statistics
H. E. Robbins · 1992
Earlier work this paper cites.
Hit-and-run algorithms for generating multivariate distributions
C. J. Bélisle, H. E. Romeijn, and R. L. Smith · 1993
Earlier work this paper cites.
Rates of convergence of the hastings and metropolis algorithms
K. L. Mengersen and R. L. Tweedie · 1996
Earlier work this paper cites.
Geometric convergence and central limit theorems for multidimensional hastings and metropolis algorithms
G. O. Roberts and R. L. Tweedie · 1996
Earlier work this paper cites.
Annealed importance sampling
R. M. Neal · 2001
Earlier work this paper cites.
Hit-and-run from a corner
L. Lovász and S. Vempala · 2004
Earlier work this paper cites.
Sequential monte carlo samplers
P. Del Moral, A. Doucet, and A. Jasra · 2006
Earlier work this paper cites.
Ensemble kalman methods for inverse problems
M. A. Iglesias, K. J. Law, and A. M. Stuart · 2013
Earlier work this paper cites.
Deep unsupervised learning using nonequilibrium thermodynamics
J. Sohl-Dickstein, E. Weiss, N. Maheswaranathan, and S. Ganguli · 2015
Earlier work this paper cites.
Stein variational gradient descent as gradient flow
Q. Liu · 2017
Earlier work this paper cites.
Statistical inference based on divergence measures
L. Pardo · 2018
Earlier work this paper cites.
User-friendly guarantees for the langevin monte carlo with inaccurate gradient
A. S. Dalalyan and A. Karagulyan · 2019
Earlier work this paper cites.
Log-concave sampling: Metropolis-hastings algorithms are fast
R. Dwivedi, Y. Chen, M. J. Wainwright, and B. Yu · 2019
Earlier work this paper cites.
Poincaré and log–sobolev inequalities for mixtures
A. Schlichting · 2019
Earlier work this paper cites.
The randomized midpoint method for log-concave sampling
R. Shen and Y. T. Lee · 2019
Earlier work this paper cites.
Rapid convergence of the unadjusted langevin algorithm: Isoperimetry suffices
S. Vempala and A. Wibisono · 2019
Earlier work this paper cites.
Svgd as a kernelized wasserstein gradient flow of the chi-squared divergence
S. Chewi, T. Le Gouic, C. Lu, T. Maunu, and P. Rigollet · 2020
Earlier work this paper cites.
On sampling from a log-concave density using kinetic langevin diffusions
A. S. Dalalyan and L. Riou-Durand · 2020
Earlier work this paper cites.
Interacting langevin diffusions: Gradient structure and ensemble kalman sampler
A. Garbuno-Inigo, F. Hoffmann, W. Li, and A. M. Stuart · 2020
Cited alongside, same era.
On the ergodicity, bias and asymptotic normality of randomized midpoint sampling method
Y. He, K. Balasubramanian, and M. A. Erdogdu · 2020
Cited alongside, same era.
Denoising diffusion probabilistic models
J. Ho, A. Jain, and P. Abbeel · 2020
Cited alongside, same era.
Structured logconcave sampling with a restricted gaussian oracle
Y. T. Lee, R. Shen, and K. Tian · 2021
Cited alongside, same era.
Sqrt(d) Dimension Dependence of Langevin Monte Carlo
R. Li, H. Zha, and M. Tao · 2021
Cited alongside, same era.
Score-based generative modeling through stochastic differential equations
Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole · 2021
Improved analysis of score-based generative modeling: User-friendly bounds under minimal smoothness assumptions
H. Chen, H. Lee, and J. Lu · 2023
Later among the works it cites.
Y. Chen and K. Gatmiry · 2023
Later among the works it cites.
Log-concave sampling
S. Chewi · 2023
Later among the works it cites.
Score diffusion models without early stopping: finite fisher information is all you need
G. Conforti, A. Durmus, and M. G. Silveri · 2023
Later among the works it cites.
Improved dimension dependence of a proximal algorithm for sampling
J. Fan, B. Yuan, and Y. Chen · 2023
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Towards a theory of non-log-concave sampling: first-order stationarity guarantees for langevin monte carlo
K. Balasubramanian, S. Chewi, M. A. Erdogdu, A. Salim, and S. Zhang · 2022
Cited alongside, same era.
Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions
S. Chen, S. Chewi, J. Li, Y. Li, A. Salim, and A. Zhang · 2022
Cited alongside, same era.
Improved analysis for a proximal algorithm for sampling
Y. Chen, S. Chewi, A. Salim, and A. Wibisono · 2022
Cited alongside, same era.
Localization schemes: A framework for proving mixing bounds for markov chains
Y. Chen and R. Eldan · 2022
Cited alongside, same era.
Convergence of denoising diffusion models under the manifold hypothesis
V. De Bortoli · 2022
Cited alongside, same era.
Regularized stein variational gradient flow
Y. He, K. Balasubramanian, B. K. Sriperumbudur, and J. Lu · 2022
Cited alongside, same era.
D. Holzmüller and F. Bach · 2023
Later among the works it cites.
Convergence of score-based generative modeling for general data distributions
H. Lee, J. Lu, and Y. Tan · 2023
Later among the works it cites.
Improved bound for mixing time of parallel tempering
H. Lee and Z. Shen · 2023
Later among the works it cites.
F. Vargas, W. Grathwohl, and A. Doucet · 2023
Later among the works it cites.
Bayesian learning via neural schrödinger–föllmer flows
F. Vargas, A. Ovsianas, D. Fernandes, M. Girolami, N. D. Lawrence, and N. Nüsken · 2023
Later among the works it cites.
Linear convergence bounds for diffusion models via stochastic localization
J. Benton, V. De Bortoli, A. Doucet, and G. Deligiannidis · 2024
Closest in time.
Stochastic localization via iterative posterior sampling
L. Grenioux, M. Noble, M. Gabrié, and A. Oliviero Durmus · 2024
Closest in time.
Mean-square analysis of discretized itô diffusions for heavy-tailed sampling
Y. He, T. Farghly, K. Balasubramanian, and M. A. Erdogdu · 2024
Closest in time.
Reverse diffusion monte carlo
X. Huang, H. Dong, Y. Hao, Y. Ma, and T. Zhang · 2024
Closest in time.
Faster sampling without isoperimetry via diffusion-based monte carlo
X. Huang, D. Zou, H. Dong, Y. Ma, and T. Zhang · 2024
Closest in time.
Towards faster non-asymptotic convergence for diffusion-based generative models
G. Li, Y. Wei, Y. Chen, and Y. Chi · 2024
Closest in time.
Automated construction of effective potential via algorithmic implicit bias
X. H. Li and M. Tao · 2024
Closest in time.
Improved sampling via learned diffusions
L. Richter, J. Berner, and G.-H. Liu · 2024
Closest in time.
Transport meets variational inference: Controlled monte carlo diffusions
F. Vargas, S. Padhy, D. Blessing, and N. Nüsken · 2024
Closest in time.