Noisy Optimization Complexity Under Locality Assumption
Abstract
In spite of various recent publications on the subject, there are still gaps between upper and lower bounds in evolutionary optimization for noisy objective function. In this paper we reduce the gap, and get tight bounds within logarithmic factors in the case of small noise and no long-distance influence on the objective function.
Origin : Files produced by the author(s)
Loading...