REVIEW 1 cited by
LIPO+: Frugal Global Optimization for Lipschitz Functions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we propose simple yet effective empirical improvements to the algorithms of the LIPO family, introduced in [Malherbe2017], that we call LIPO+ and AdaLIPO+. We compare our methods to the vanilla versions of the algorithms over standard benchmark functions and show that they converge significantly faster. Finally, we show that the LIPO family is very prone to the curse of dimensionality and tends quickly to Pure Random Search when the dimension increases. We give a proof for this, which is also formalized in Lean mathematical language. Source codes and a demo are provided online.
Forward citations
Cited by 1 Pith paper
-
Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants
ECP is a no-regret global optimization algorithm for Lipschitz black-box functions with unknown constant, achieving minimax-optimal regret via an expanding acceptance region.
Discussion (0). Continue with ORCID to comment.