IDEAS home Printed from https://ideas.repec.org/p/crs/wpaper/2014-45.html
   My bibliography  Save this paper

Theoretical guarantees for approximate sampling from smooth and log-concave densities

Author

Listed:
  • Arnak S. Dalalyan

    (ENSAE ParisTech)

Abstract

Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling from a given distribution is impossible or computationally expensive and, therefore, one needs to resort to approximate sampling strategies. However, there is no well-developed theory providing meaningful nonasymptotic guarantees for the approximate sampling procedures, especially in the high-dimensional problems. This paper makes some progress in this direction by considering the problem of sampling from a distribution having a smooth and log-concave density defined on Rp, for some integer p > 0. We establish nonasymptotic bounds for the error of approximating the true distribution by the one obtained by the Langevin Monte Carlo method and its variants. We illustrate the effectiveness of the established guarantees with various experiments. Underlying our analysis are insights from the theory of continuous-time diffusion processes, which may be of interest beyond the framework of distributions with log-concave densities considered in the present work.

Suggested Citation

  • Arnak S. Dalalyan, 2014. "Theoretical guarantees for approximate sampling from smooth and log-concave densities," Working Papers 2014-45, Center for Research in Economics and Statistics.
  • Handle: RePEc:crs:wpaper:2014-45
    as

    Download full text from publisher

    File URL: http://crest.science/RePEc/wpstorage/2014-45.pdf
    File Function: Crest working paper version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Jarner, Søren Fiig & Hansen, Ernst, 2000. "Geometric ergodicity of Metropolis algorithms," Stochastic Processes and their Applications, Elsevier, vol. 85(2), pages 341-361, February.
    2. Gareth O. Roberts & Jeffrey S. Rosenthal, 1998. "Optimal scaling of discrete approximations to Langevin diffusions," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 60(1), pages 255-268.
    3. Xifara, T. & Sherlock, C. & Livingstone, S. & Byrne, S. & Girolami, M., 2014. "Langevin diffusions and the Metropolis-adjusted Langevin algorithm," Statistics & Probability Letters, Elsevier, vol. 91(C), pages 14-19.
    4. Mark Girolami & Ben Calderhead, 2011. "Riemann manifold Langevin and Hamiltonian Monte Carlo methods," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 73(2), pages 123-214, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ruben Loaiza-Maya & Didier Nibbering & Dan Zhu, 2023. "Hybrid unadjusted Langevin methods for high-dimensional latent variable models," Papers 2306.14445, arXiv.org.
    2. Crespo, Marelys & Gadat, Sébastien & Gendre, Xavier, 2023. "Stochastic Langevin Monte Carlo for (weakly) log-concave posterior distributions," TSE Working Papers 23-1398, Toulouse School of Economics (TSE).
    3. Tung Duy Luu & Jalal Fadili & Christophe Chesneau, 2021. "Sampling from Non-smooth Distributions Through Langevin Diffusion," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1173-1201, December.
    4. Denis Belomestny & Leonid Iosipoi, 2019. "Fourier transform MCMC, heavy tailed distributions and geometric ergodicity," Papers 1909.00698, arXiv.org, revised Dec 2019.
    5. Gadat, Sébastien & Panloup, Fabien & Pellegrini, C., 2020. "On the cost of Bayesian posterior mean strategy for log-concave models," TSE Working Papers 20-1155, Toulouse School of Economics (TSE), revised Feb 2022.
    6. Brosse, Nicolas & Durmus, Alain & Moulines, Éric & Sabanis, Sotirios, 2019. "The tamed unadjusted Langevin algorithm," Stochastic Processes and their Applications, Elsevier, vol. 129(10), pages 3638-3663.
    7. M. Barkhagen & S. García & J. Gondzio & J. Kalcsics & J. Kroeske & S. Sabanis & A. Staal, 2023. "Optimising portfolio diversification and dimensionality," Journal of Global Optimization, Springer, vol. 85(1), pages 185-234, January.
    8. Belomestny, Denis & Iosipoi, Leonid, 2021. "Fourier transform MCMC, heavy-tailed distributions, and geometric ergodicity," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 351-363.
    9. Yang, Jun & Roberts, Gareth O. & Rosenthal, Jeffrey S., 2020. "Optimal scaling of random-walk metropolis algorithms on general target distributions," Stochastic Processes and their Applications, Elsevier, vol. 130(10), pages 6094-6132.
    10. Loaiza-Maya, Rubén & Nibbering, Didier & Zhu, Dan, 2024. "Hybrid unadjusted Langevin methods for high-dimensional latent variable models," Journal of Econometrics, Elsevier, vol. 241(2).
    11. Vincent Lemaire & Gilles Pag`es & Christian Yeo, 2023. "Swing contract pricing: with and without Neural Networks," Papers 2306.03822, arXiv.org, revised Mar 2024.
    12. Villeneuve, Stéphane & Bolte, Jérôme & Miclo, Laurent, 2022. "Swarm gradient dynamics for global optimization: the mean-field limit case," TSE Working Papers 22-1302, Toulouse School of Economics (TSE).
    13. Chau, Huy N. & Rásonyi, Miklós, 2022. "Stochastic Gradient Hamiltonian Monte Carlo for non-convex learning," Stochastic Processes and their Applications, Elsevier, vol. 149(C), pages 341-368.
    14. Samuel Livingstone & Giacomo Zanella, 2022. "The Barker proposal: Combining robustness and efficiency in gradient‐based MCMC," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 496-523, April.
    15. Tengyuan Liang & Weijie J. Su, 2019. "Statistical inference for the population landscape via moment‐adjusted stochastic gradients," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 81(2), pages 431-456, April.
    16. Dalalyan, Arnak S. & Karagulyan, Avetik, 2019. "User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient," Stochastic Processes and their Applications, Elsevier, vol. 129(12), pages 5278-5311.
    17. Menz, Georg & Schlichting, André & Tang, Wenpin & Wu, Tianqi, 2022. "Ergodicity of the infinite swapping algorithm at low temperature," Stochastic Processes and their Applications, Elsevier, vol. 151(C), pages 519-552.
    18. Arnak Dalalyan, 2017. "Further and stronger analogy between sampling and optimization: Langevin Monte Carlo and gradient descent," Working Papers 2017-21, Center for Research in Economics and Statistics.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Samuel Livingstone, 2021. "Geometric Ergodicity of the Random Walk Metropolis with Position-Dependent Proposal Covariance," Mathematics, MDPI, vol. 9(4), pages 1-14, February.
    2. Bédard, Mylène, 2017. "Hierarchical models: Local proposal variances for RWM-within-Gibbs and MALA-within-Gibbs," Computational Statistics & Data Analysis, Elsevier, vol. 109(C), pages 231-246.
    3. E. Zanini & E. Eastoe & M. J. Jones & D. Randell & P. Jonathan, 2020. "Flexible covariate representations for extremes," Environmetrics, John Wiley & Sons, Ltd., vol. 31(5), August.
    4. Dalalyan, Arnak S. & Karagulyan, Avetik, 2019. "User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient," Stochastic Processes and their Applications, Elsevier, vol. 129(12), pages 5278-5311.
    5. O. F. Christensen & J. Møller & R. P. Waagepetersen, 2001. "Geometric Ergodicity of Metropolis-Hastings Algorithms for Conditional Simulation in Generalized Linear Mixed Models," Methodology and Computing in Applied Probability, Springer, vol. 3(3), pages 309-327, September.
    6. M Ludkin & C Sherlock, 2023. "Hug and hop: a discrete-time, nonreversible Markov chain Monte Carlo algorithm," Biometrika, Biometrika Trust, vol. 110(2), pages 301-318.
    7. Allassonnière, Stéphanie & Kuhn, Estelle, 2015. "Convergent stochastic Expectation Maximization algorithm with efficient sampling in high dimension. Application to deformable template model estimation," Computational Statistics & Data Analysis, Elsevier, vol. 91(C), pages 4-19.
    8. Burda Martin & Maheu John M., 2013. "Bayesian adaptively updated Hamiltonian Monte Carlo with an application to high-dimensional BEKK GARCH models," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 17(4), pages 345-372, September.
    9. Vandecasteele, Hannes & Samaey, Giovanni, 2024. "Computational efficiency study of a micro-macro Markov chain Monte Carlo method for molecular dynamics," Applied Mathematics and Computation, Elsevier, vol. 474(C).
    10. Dang, Khue-Dung & Quiroz, Matias & Kohn, Robert & Tran, Minh-Ngoc & Villani, Mattias, 2019. "Hamiltonian Monte Carlo with Energy Conserving Subsampling," Working Paper Series 372, Sveriges Riksbank (Central Bank of Sweden).
    11. Samuel Livingstone & Giacomo Zanella, 2022. "The Barker proposal: Combining robustness and efficiency in gradient‐based MCMC," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 496-523, April.
    12. Tore Selland Kleppe, 2016. "Adaptive Step Size Selection for Hessian-Based Manifold Langevin Samplers," Scandinavian Journal of Statistics, Danish Society for Theoretical Statistics;Finnish Statistical Society;Norwegian Statistical Association;Swedish Statistical Association, vol. 43(3), pages 788-805, September.
    13. Beskos, A. & Pinski, F.J. & Sanz-Serna, J.M. & Stuart, A.M., 2011. "Hybrid Monte Carlo on Hilbert spaces," Stochastic Processes and their Applications, Elsevier, vol. 121(10), pages 2201-2230, October.
    14. Kamatani, Kengo, 2020. "Random walk Metropolis algorithm in high dimension with non-Gaussian target distributions," Stochastic Processes and their Applications, Elsevier, vol. 130(1), pages 297-327.
    15. Xifara, T. & Sherlock, C. & Livingstone, S. & Byrne, S. & Girolami, M., 2014. "Langevin diffusions and the Metropolis-adjusted Langevin algorithm," Statistics & Probability Letters, Elsevier, vol. 91(C), pages 14-19.
    16. Martin Burda & John Maheu, 2011. "Bayesian Adaptive Hamiltonian Monte Carlo with an Application to High-Dimensional BEKK GARCH Models," Working Papers tecipa-438, University of Toronto, Department of Economics.
    17. Tsionas, Mike G. & Izzeldin, Marwan & Trapani, Lorenzo, 2022. "Estimation of large dimensional time varying VARs using copulas," European Economic Review, Elsevier, vol. 141(C).
    18. Mike Tsionas & Marwan Izzeldin & Lorenzo Trapani, 2019. "Bayesian estimation of large dimensional time varying VARs using copulas," Papers 1912.12527, arXiv.org.
    19. Ranjan, Rakesh & Sen, Rijji & Upadhyay, Satyanshu K., 2021. "Bayes analysis of some important lifetime models using MCMC based approaches when the observations are left truncated and right censored," Reliability Engineering and System Safety, Elsevier, vol. 214(C).
    20. Ioannis Bournakis & Mike Tsionas, 2024. "A Non‐parametric Estimation of Productivity with Idiosyncratic and Aggregate Shocks: The Role of Research and Development (R&D) and Corporate Tax," Oxford Bulletin of Economics and Statistics, Department of Economics, University of Oxford, vol. 86(3), pages 641-671, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:crs:wpaper:2014-45. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Secretariat General (email available below). General contact details of provider: https://edirc.repec.org/data/crestfr.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.