Black-box search by unbiased variation
From MaRDI portal
Publication:1945171
DOI10.1007/s00453-012-9616-8zbMath1264.68221OpenAlexW2035300004WikidataQ57200613 ScholiaQ57200613MaRDI QIDQ1945171
Per Kristian Lehre, Carsten Witt
Publication date: 3 April 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9616-8
Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Related Items (41)
Black-box complexity: advantages of memory usage ⋮ \textsc{OneMax} in black-box models with several restrictions ⋮ Towards a runtime comparison of natural and artificial evolution ⋮ The impact of random initialization on the runtime of randomized search heuristics ⋮ A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions ⋮ Tight bounds on the expected runtime of a standard steady state genetic algorithm ⋮ A tight runtime analysis for the \((\mu + \lambda)\) EA ⋮ On the impact of the performance metric on efficient algorithm configuration ⋮ Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints ⋮ Analyzing randomized search heuristics via stochastic domination ⋮ Improved time complexity analysis of the simple genetic algorithm ⋮ Self-adjusting population sizes for the (1,\( \lambda )\)-EA on monotone functions ⋮ When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter ⋮ Black-box search by unbiased variation ⋮ Do additional target points speed up evolutionary algorithms? ⋮ Using Automated Algorithm Configuration for Parameter Control ⋮ The voting algorithm is robust to various noise models ⋮ On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms ⋮ The unbiased black-box complexity of partition is polynomial ⋮ Level-based analysis of the univariate marginal distribution algorithm ⋮ Island models meet rumor spreading ⋮ From black-box complexity to designing new genetic algorithms ⋮ The query complexity of a permutation-based variant of mastermind ⋮ Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity ⋮ The runtime of the compact genetic algorithm on jump functions ⋮ Self-adjusting mutation rates with provably optimal success rules ⋮ Runtime analyses of the population-based univariate estimation of distribution algorithms on LeadingOnes ⋮ Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions ⋮ The \((1+1)\) elitist black-box complexity of LeadingOnes ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Static and self-adjusting mutation strengths for multi-valued decision variables ⋮ Drift analysis of mutation operations for biogeography-based optimization ⋮ On the runtime analysis of the simple genetic algorithm ⋮ Reducing the arity in unbiased black-box complexity ⋮ Ranking-based black-box complexity ⋮ Optimal parameter choices via precise black-box analysis ⋮ Toward a unifying framework for evolutionary processes ⋮ Mutation Rate Control in the $$(1+\lambda )$$ Evolutionary Algorithm with a Self-adjusting Lower Bound ⋮ Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing different variants of immune inspired somatic contiguous hypermutations
- Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- How easy is local search?
- The tail of the hypergeometric distribution
- On the analysis of the \((1+1)\) evolutionary algorithm
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Black-box search by unbiased variation
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- Upper and lower bounds for randomized search heuristics in black-box optimization
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
- Black-box search by elimination of fitness functions
- Non-uniform mutation rates for problems with unknown solution lengths
- Neighborhood Graphs and Symmetric Genetic Operators
This page was built for publication: Black-box search by unbiased variation
