Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.13737 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915494518325248 |
|---|---|
| author | Cortild, Daniel Delplancke, Claire Oudjane, Nadia Peypouquet, Juan |
| author_facet | Cortild, Daniel Delplancke, Claire Oudjane, Nadia Peypouquet, Juan |
| contents | We present an optimization algorithm that can identify a global minimum of a potentially nonconvex smooth function with high probability, assuming the Gibbs measure of the potential satisfies a logarithmic Sobolev inequality. Our contribution is twofold: on the one hand we propose a global optimization method, which is built on an oracle sampling algorithm producing arbitrarily accurate samples from a given Gibbs measure. On the other hand, we propose a new sampling algorithm, drawing inspiration from both overdamped and underdamped Langevin dynamics, as well as from the high-resolution differential equation known for its acceleration in deterministic settings. While the focus of the paper is primarily theoretical, we demonstrate the effectiveness of our algorithms on the Rastrigin function, where it outperforms recent approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_13737 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Global Optimization Algorithm through High-Resolution Sampling Cortild, Daniel Delplancke, Claire Oudjane, Nadia Peypouquet, Juan Optimization and Control We present an optimization algorithm that can identify a global minimum of a potentially nonconvex smooth function with high probability, assuming the Gibbs measure of the potential satisfies a logarithmic Sobolev inequality. Our contribution is twofold: on the one hand we propose a global optimization method, which is built on an oracle sampling algorithm producing arbitrarily accurate samples from a given Gibbs measure. On the other hand, we propose a new sampling algorithm, drawing inspiration from both overdamped and underdamped Langevin dynamics, as well as from the high-resolution differential equation known for its acceleration in deterministic settings. While the focus of the paper is primarily theoretical, we demonstrate the effectiveness of our algorithms on the Rastrigin function, where it outperforms recent approaches. |
| title | Global Optimization Algorithm through High-Resolution Sampling |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2410.13737 |