Noisy optimization complexity under locality assumption

DOI10.1145/2460239.2460256MaRDI QIDQ5276126zbMATH OpenOpenAlexFDO

Authors Jérémie Decock, Olivier Teytaud

Publication date 14 July 2017

Published in Proceedings of the twelfth workshop on Foundations of genetic algorithms XII (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-00755663/file/foga006-decock.pdf

zbMATH Keywords

black box complexity modellocal samplingnoisy optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient optimisation of noisy fitness functions with population-based evolutionary algorithms
• Evolution strategies with additive noise: a convergence rate lower bound
• scientific article; zbMATH DE number 2038813
• scientific article; zbMATH DE number 6019556
• scientific article; zbMATH DE number 2013531

Cited in

(5)

• The impact of noise on evaluation complexity: the deterministic trust-region case
• scientific article; zbMATH DE number 5899292 (Why is no real title available?)
• An efficient local search with noising strategy for Google machine reassignment problem
• Efficient computation for the noisy MAX
• Simple and cumulative regret for continuous noisy optimization

This page was built for publication: Noisy optimization complexity under locality assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5276126)