Landscape-Sketch-Step: An AI/ML-Based Metaheuristic for Surrogate Optimization Problems

09/14/2023
by   Rafael Monteiro, et al.
0

In this paper, we introduce a new heuristics for global optimization in scenarios where extensive evaluations of the cost function are expensive, inaccessible, or even prohibitive. The method, which we call Landscape-Sketch-and-Step (LSS), combines Machine Learning, Stochastic Optimization, and Reinforcement Learning techniques, relying on historical information from previously sampled points to make judicious choices of parameter values where the cost function should be evaluated at. Unlike optimization by Replica Exchange Monte Carlo methods, the number of evaluations of the cost function required in this approach is comparable to that used by Simulated Annealing, quality that is especially important in contexts like high-throughput computing or high-performance computing tasks, where evaluations are either computationally expensive or take a long time to be performed. The method also differs from standard Surrogate Optimization techniques, for it does not construct a surrogate model that aims at approximating or reconstructing the objective function. We illustrate our method by applying it to low dimensional optimization problems (dimensions 1, 2, 4, and 8) that mimick known difficulties of minimization on rugged energy landscapes often seen in Condensed Matter Physics, where cost functions are rugged and plagued with local minima. When compared to classical Simulated Annealing, the LSS shows an effective acceleration of the optimization process.

READ FULL TEXT

page 16

page 17

page 18

page 19

research
08/01/2020

Ergodic Annealing

Simulated Annealing is the crowning glory of Markov Chain Monte Carlo Me...
research
04/17/2019

SACOBRA with Online Whitening for Solving Optimization Problems with High Conditioning

Real-world optimization problems often have expensive objective function...
research
10/27/2014

Sensitivity Analysis for Computationally Expensive Models using Optimization and Objective-oriented Surrogate Approximations

In this paper, we focus on developing efficient sensitivity analysis met...
research
08/01/2021

A survey of Monte Carlo methods for noisy and costly densities with application to reinforcement learning

This survey gives an overview of Monte Carlo methodologies using surroga...
research
11/23/2018

Parallel sequential Monte Carlo for stochastic optimization

We propose a parallel sequential Monte Carlo optimization method to mini...
research
03/11/2015

L_1-regularized Boltzmann machine learning using majorizer minimization

We propose an inference method to estimate sparse interactions and biase...
research
07/17/2023

Towards Accelerating Benders Decomposition via Reinforcement Learning Surrogate Models

Stochastic optimization (SO) attempts to offer optimal decisions in the ...

Please sign up or login with your details

Forgot password? Click here to reset