NobleBlocks
Public

Global Optimization Algorithm through High-Resolution Sampling

Published in arXiv (Cornell University) • Oct 17, 2024
NobleIDNI8P11W14R92S45
Authors:
Daniel Cortild
,
Claire Delplancke
,
Nadia Oudjane

Abstract

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 optimizat...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!