Slide 68
Slide 68 text
45 / 44
Andrieu, C., de Freitas, N., Doucet, A., and Jordan, M. I. (2003), “An Introduction to MCMC for
Machine Learning,” Machine Learning, 50, 5–43.
Brosse, N., Durmus, A., Moulines, E., and Pereyra, M. (2017), “Sampling from a log-concave distribution
with compact support with proximal Langevin Monte Carlo,” in Conference on Learning Theory,
vol. 65, pp. 319–342.
Bubeck, S., Eldan, R., and Lehec, J. (2015), “Finite-Time Analysis of Projected Langevin Monte Carlo,”
in Proceedings of the 28th International Conference on Neural Information Processing Systems - Volume
1, NIPS’15, p. 1243–1251.
Celeux, G., Chretien, S., Forbes, F., and Mkhadri, A. (2001), “A Component-Wise EM Algorithm for
Mixtures,” Journal of Computational and Graphical Statistics, 10, 697–712.
Chambolle, A., Novaga, M., Cremers, D., and Pock, T. (2010), “An introduction to total variation for
image analysis,” in Theoretical Foundations and Numerical Methods for Sparse Recovery, De Gruyter.
Dalalyan, A. and Tsybakov, A. (2012), “Sparse regression learning by aggregation and Langevin
Monte-Carlo,” Journal of Computer and System Sciences, 78, 1423–1443.
Dalalyan, A. S. (2017), “Theoretical guarantees for approximate sampling from smooth and log-concave
densities,” Journal of the Royal Statistical Society, Series B, 79, 651–676.
Dang, K.-D., Quiroz, M., Kohn, R., Tran, M.-N., and Villani, M. (2019), “Hamiltonian Monte Carlo with
Energy Conserving Subsampling,” Journal of Machine Learning Research, 20, 1–31.
Dempster, A. P., Laird, N. M., and Rubin, D. B. (1977), “Maximum Likelihood from Incomplete Data via
the EM Algorithm,” Journal of the Royal Statistical Society, Series B, 39, 1–38.
Duane, S., Kennedy, A., Pendleton, B. J., and Roweth, D. (1987), “Hybrid Monte Carlo,” Physics Letters
B, 195, 216–222.
Durmus, A., Majewski, S., and Miasojedow, B. (2019), “Analysis of Langevin Monte Carlo via convex
optimization,” Journal of Machine Learning Research, 20, 1–46, available at
http://www.jmlr.org/papers/volume20/18-173/18-173.pdf.
Durmus, A., Moulines, E., and Pereyra, M. (2018), “Efficient Bayesian Computation by Proximal Markov
chain Monte Carlo: When Langevin Meets Moreau,” SIAM Journal on Imaging Sciences, 11, 473–506.
Edwards, R. G. and Sokal, A. D. (1988), “Generalization of the Fortuin-Kasteleyn-Swendsen-Wang
representation and Monte Carlo algorithm,” Physical Review D, 38, 2009–2012.