arXiv Analytics

Sign in

arXiv:2305.00438 [math.OC]AbstractReferencesReviewsResources

META-SMGO-$Δ$: similarity as a prior in black-box optimization

Riccardo Busetto, Valentina Breschi, Simone Formentin

Published 2023-04-30Version 1

When solving global optimization problems in practice, one often ends up repeatedly solving problems that are similar to each others. By providing a rigorous definition of similarity, in this work we propose to incorporate the META-learning rationale into SMGO-$\Delta$, a global optimization approach recently proposed in the literature, to exploit priors obtained from similar past experience to efficiently solve new (similar) problems. Through a benchmark numerical example we show the practical benefits of our META-extension of the baseline algorithm, while providing theoretical bounds on its performance.

Related articles: Most relevant | Search more
arXiv:1602.04847 [math.OC] (Published 2016-02-15)
Black-box optimization with a politician
arXiv:2107.10706 [math.OC] (Published 2021-07-22)
Distributed Saddle-Point Problems Under Similarity
arXiv:1309.7168 [math.OC] (Published 2013-09-27, updated 2013-11-06)
Black-box optimization using geodesics in statistical manifolds