Hypocoercivity in metastable settings and kinetic simulated annealing

TL;DR

This paper proves the convergence over time of kinetic Langevin annealing with a logarithmic cooling schedule by integrating classical simulated annealing analysis with hypocoercive methods, advancing understanding of metastable systems.

Contribution

It introduces a novel combination of classical and hypocoercive techniques to analyze convergence in metastable kinetic annealing processes.

Findings

Proves convergence of kinetic Langevin annealing with logarithmic cooling.

Integrates classical annealing analysis with hypocoercive methods.

Provides theoretical foundation for metastable system behavior.

Abstract

Combining classical arguments for the analysis of the simulated annealing algorithm with the more recent hypocoercive method of distorted entropy, we prove the convergence for large time of the kinetic Langevin annealing with logarithmic cooling schedule.