Global Non-convex Optimization with Discretized Diffusions

10/29/2018
by   Murat A. Erdogdu, et al.
0

An Euler discretization of the Langevin diffusion is known to converge to the global minimizers of certain convex and non-convex optimization problems. We show that this property holds for any suitably smooth diffusion and that different diffusions are suitable for optimizing different classes of convex and non-convex functions. This allows us to design diffusions suitable for globally optimizing convex and non-convex functions not covered by the existing Langevin theory. Our non-asymptotic analysis delivers computable optimization and integration error bounds based on easily accessed properties of the objective and chosen diffusion. Central to our approach are new explicit Stein factor bounds on the solutions of Poisson equations. We complement these results with improved optimization guarantees for targets other than the standard Gibbs measure.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2023

Accelerating Convergence in Global Non-Convex Optimization with Reversible Diffusion

Langevin Dynamics has been extensively employed in global non-convex opt...
research
02/28/2020

First Order Methods take Exponential Time to Converge to Global Minimizers of Non-Convex Functions

Machine learning algorithms typically perform optimization over a class ...
research
06/30/2023

Global Optimality in Bivariate Gradient-based DAG Learning

Recently, a new class of non-convex optimization problems motivated by t...
research
01/09/2018

Convexification of Neural Graph

Traditionally, most complex intelligence architectures are extremely non...
research
05/31/2023

A Novel Black Box Process Quality Optimization Approach based on Hit Rate

Hit rate is a key performance metric in predicting process product quali...
research
06/26/2023

GloptiNets: Scalable Non-Convex Optimization with Certificates

We present a novel approach to non-convex optimization with certificates...
research
11/05/2018

Task Embedded Coordinate Update: A Realizable Framework for Multivariate Non-convex Optimization

We in this paper propose a realizable framework TECU, which embeds task-...

Please sign up or login with your details

Forgot password? Click here to reset