IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v464y2024ics0096300323005465.html
   My bibliography  Save this article

Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions

Author

Listed:
  • Ghaderi, Susan
  • Ahookhosh, Masoud
  • Arany, Adam
  • Skupin, Alexander
  • Patrinos, Panagiotis
  • Moreau, Yves

Abstract

This paper addresses a gradient-based Markov Chain Monte Carlo (MCMC) method to sample from the posterior distribution of problems with nonsmooth potential functions. Following the Bayesian paradigm, our potential function will be some of two convex functions, where one of which is smooth. We first approximate the potential function by the so-called forward-backward envelope function, which is a real-valued smooth function with the same critical points as the original one. Then, we incorporate this smoothing technique with the unadjusted Langevin algorithm (ULA), leading to smoothing ULA, called SULA. We next establish non-asymptotic convergence results of SULA under mild assumption on the original potential function. We finally report some numerical results to establish the promising performance of SULA on both synthetic and real chemoinformatics data.

Suggested Citation

  • Ghaderi, Susan & Ahookhosh, Masoud & Arany, Adam & Skupin, Alexander & Patrinos, Panagiotis & Moreau, Yves, 2024. "Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions," Applied Mathematics and Computation, Elsevier, vol. 464(C).
    • Handle: RePEc:eee:apmaco:v:464:y:2024:i:c:s0096300323005465
    DOI: 10.1016/j.amc.2023.128377
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300323005465
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2023.128377?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Patrick L. Combettes & Jean-Christophe Pesquet, 2011. "Proximal Splitting Methods in Signal Processing," Springer Optimization and Its Applications, in: Heinz H. Bauschke & Regina S. Burachik & Patrick L. Combettes & Veit Elser & D. Russell Luke & Henry (ed.), Fixed-Point Algorithms for Inverse Problems in Science and Engineering, chapter 0, pages 185-212, Springer.
    2. 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.
    3. Lorenzo Stella & Andreas Themelis & Panagiotis Patrinos, 2017. "Forward–backward quasi-Newton methods for nonsmooth optimization problems," Computational Optimization and Applications, Springer, vol. 67(3), pages 443-487, July.
    4. Mattingly, J. C. & Stuart, A. M. & Higham, D. J., 2002. "Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise," Stochastic Processes and their Applications, Elsevier, vol. 101(2), pages 185-232, October.
    5. Pontus Giselsson & Mattias Fält, 2018. "Envelope Functions: Unifications and Further Properties," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 673-698, September.
    6. 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.
    7. 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.
    8. Yurii NESTEROV & Vladimir SPOKOINY, 2017. "Random gradient-free minimization of convex functions," LIDAM Reprints CORE 2851, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. W. R. Gilks & P. Wild, 1992. "Adaptive Rejection Sampling for Gibbs Sampling," Journal of the Royal Statistical Society Series C, Royal Statistical Society, vol. 41(2), pages 337-348, June.
    Full references (including those not matched with items on IDEAS)

    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. Silvia Bonettini & Peter Ochs & Marco Prato & Simone Rebegoldi, 2023. "An abstract convergence framework with application to inertial inexact forward–backward methods," Computational Optimization and Applications, Springer, vol. 84(2), pages 319-362, March.
    2. 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.
    3. Aviad Aberdam & Amir Beck, 2022. "An Accelerated Coordinate Gradient Descent Algorithm for Non-separable Composite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 219-246, June.
    4. Yanli Liu & Wotao Yin, 2019. "An Envelope for Davis–Yin Splitting and Strict Saddle-Point Avoidance," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 567-587, May.
    5. Guillaume Sagnol & Edouard Pauwels, 2019. "An unexpected connection between Bayes A-optimal designs and the group lasso," Statistical Papers, Springer, vol. 60(2), pages 565-584, April.
    6. Pang, W. K. & Yang, Z. H. & Hou, S. H. & Leung, P. K., 2002. "Non-uniform random variate generation by the vertical strip method," European Journal of Operational Research, Elsevier, vol. 142(3), pages 595-609, November.
    7. Ernest K. Ryu & Yanli Liu & Wotao Yin, 2019. "Douglas–Rachford splitting and ADMM for pathological convex optimization," Computational Optimization and Applications, Springer, vol. 74(3), pages 747-778, December.
    8. Junhong Lin & Lorenzo Rosasco & Silvia Villa & Ding-Xuan Zhou, 2018. "Modified Fejér sequences and applications," Computational Optimization and Applications, Springer, vol. 71(1), pages 95-113, September.
    9. Ghadimi, Saeed & Powell, Warren B., 2024. "Stochastic search for a parametric cost function approximation: Energy storage with rolling forecasts," European Journal of Operational Research, Elsevier, vol. 312(2), pages 641-652.
    10. Lemaire, Vincent, 2007. "An adaptive scheme for the approximation of dissipative systems," Stochastic Processes and their Applications, Elsevier, vol. 117(10), pages 1491-1518, October.
    11. Samantha Leorato & Maura Mezzetti, 2015. "Spatial Panel Data Model with error dependence: a Bayesian Separable Covariance Approach," CEIS Research Paper 338, Tor Vergata University, CEIS, revised 09 Apr 2015.
    12. Puya Latafat & Panagiotis Patrinos, 2017. "Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators," Computational Optimization and Applications, Springer, vol. 68(1), pages 57-93, September.
    13. Sedi Bartz & Rubén Campoy & Hung M. Phan, 2022. "An Adaptive Alternating Direction Method of Multipliers," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 1019-1055, December.
    14. Z. Rezaei Ghahroodi & M. Ganjali, 2013. "A Bayesian approach for analysing longitudinal nominal outcomes using random coefficients transitional generalized logit model: an application to the labour force survey data," Journal of Applied Statistics, Taylor & Francis Journals, vol. 40(7), pages 1425-1445, July.
    15. Antonello Loddo & Shawn Ni & Dongchu Sun, 2011. "Selection of Multivariate Stochastic Volatility Models via Bayesian Stochastic Search," Journal of Business & Economic Statistics, Taylor & Francis Journals, vol. 29(3), pages 342-355, July.
    16. Chen, Ming-Hui & Ibrahim, Joseph G. & Sinha, Debajyoti, 2004. "A new joint model for longitudinal and survival data with a cure fraction," Journal of Multivariate Analysis, Elsevier, vol. 91(1), pages 18-34, October.
    17. Nandram, Balgobin & Zelterman, Daniel, 2007. "Computational Bayesian inference for estimating the size of a finite population," Computational Statistics & Data Analysis, Elsevier, vol. 51(6), pages 2934-2945, March.
    18. Samaneh Mahabadi & Mojtaba Ganjali, 2015. "A Bayesian approach for sensitivity analysis of incomplete multivariate longitudinal data with potential nonrandom dropout," METRON, Springer;Sapienza Università di Roma, vol. 73(3), pages 397-417, December.
    19. V. Kungurtsev & F. Rinaldi, 2021. "A zeroth order method for stochastic weakly convex optimization," Computational Optimization and Applications, Springer, vol. 80(3), pages 731-753, December.
    20. 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.

    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:eee:apmaco:v:464:y:2024:i:c:s0096300323005465. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.