Diffusion at Absolute Zero: Langevin Sampling using Successive Moreau Envelopes [journal paper]
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914083090989056 |
|---|---|
| author | Habring, Andreas Falk, Alexander Zach, Martin Pock, Thomas |
| author_facet | Habring, Andreas Falk, Alexander Zach, Martin Pock, Thomas |
| contents | We propose a method for sampling from Gibbs distributions of the form $π(x)\propto\exp(-U(x))$ by considering a family $(π^{t})_t$ of approximations of the target density which is such that $π^{t}$ exhibits favorable properties for sampling when $t$ is large, and $π^{t} \to π$ as $t \to 0$. This sequence is obtained by replacing (parts of) the potential $U$ by its Moreau envelope. Through the sequential sampling from $π^{t}$ for decreasing values of $t$ by a Langevin algorithm with appropriate step size, the samples are guided from a simple starting density to the more complex target quickly. We prove the ergodicity of the method as well as its convergence to the target density without assuming convexity or differentiability of the potential $U$. In addition to the theoretical analysis, we show experimental results that support the superiority of the method in terms of convergence speed and mode-coverage of multi-modal densities to current algorithms. The experiments range from one-dimensional toy-problems to high-dimensional inverse imaging problems with learned potentials. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_22258 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Diffusion at Absolute Zero: Langevin Sampling using Successive Moreau Envelopes [journal paper] Habring, Andreas Falk, Alexander Zach, Martin Pock, Thomas Optimization and Control 65C40, 65C05, 68U10, 65C60 G.3; G.1.6 We propose a method for sampling from Gibbs distributions of the form $π(x)\propto\exp(-U(x))$ by considering a family $(π^{t})_t$ of approximations of the target density which is such that $π^{t}$ exhibits favorable properties for sampling when $t$ is large, and $π^{t} \to π$ as $t \to 0$. This sequence is obtained by replacing (parts of) the potential $U$ by its Moreau envelope. Through the sequential sampling from $π^{t}$ for decreasing values of $t$ by a Langevin algorithm with appropriate step size, the samples are guided from a simple starting density to the more complex target quickly. We prove the ergodicity of the method as well as its convergence to the target density without assuming convexity or differentiability of the potential $U$. In addition to the theoretical analysis, we show experimental results that support the superiority of the method in terms of convergence speed and mode-coverage of multi-modal densities to current algorithms. The experiments range from one-dimensional toy-problems to high-dimensional inverse imaging problems with learned potentials. |
| title | Diffusion at Absolute Zero: Langevin Sampling using Successive Moreau Envelopes [journal paper] |
| topic | Optimization and Control 65C40, 65C05, 68U10, 65C60 G.3; G.1.6 |
| url | https://arxiv.org/abs/2503.22258 |