Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Theory of Computing Systems
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Black-box search by elimination of fitness functions
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Improved analysis methods for crossover-based algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Black-box search by unbiased variation
Proceedings of the 12th annual conference on Genetic and evolutionary computation
More effective crossover operators for the all-pairs shortest path problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Faster black-box algorithms through higher arity operators
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Black-box complexities of combinatorial problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
How crossover helps in pseudo-boolean optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Unbiased black box search algorithms
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Black-Box complexity: breaking the O(n logn) barrier of leadingones
EA'11 Proceedings of the 10th international conference on Artificial Evolution
Black-box complexity: from complexity theory to playing mastermind
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
We show that for all 1 k d log n the k-ary unbiased black-box complexity of the n-dimensional OneMax function class is O(n/k). This indicates that the power of higher arity operators is much stronger than what the previous O(n/log k) bound by Doerr et al. (Faster black-box algorithms through higher arity operators, Proc. of FOGA 2011, pp. 163--172, ACM, 2011) suggests. The key to this result is an encoding strategy, which might be of independent interest. We show that, using k-ary unbiased variation operators only, we may simulate an unrestricted memory of size O(2k) bits.