Black Box Search By Unbiased Variation
|
|
- Ashlyn Merritt
- 6 years ago
- Views:
Transcription
1 Black Box Search By Unbiased Variation Per Kristian Lehre and Carsten Witt CERCIA, University of Birmingham, UK DTU Informatics, Copenhagen, Denmark ThRaSH - March 24th 2010
2 State of the Art in Runtime Analysis of RSHs OneMax (1+1) EA O(n log n) [Mühlenbein, 1992] (1+λ) EA O(λn + n log n) [Jansen et al., 2005] (µ+1) EA O(µn + n log n) [Witt, 2006] 1-ANT O(n 2 ) w.h.p. [Neumann and Witt, 2006] (µ+1) IA O(µn + n log n) [Zarges, 2009] Linear Functions (1+1) EA Θ(n log n) [Droste et al., 2002] and [He and Yao, 2003] cga Θ(n 2+ε ), ε > 0 const. [Droste, 2006] Max. Matching (1+1) EA e Ω(n), PRAS [Giel and Wegener, 2003] Sorting (1+1) EA Θ(n 2 log n) [Scharnow et al., 2002] SS Shortest Path (1+1) EA O(n 3 log(nw max)) [Baswana et al., 2009] MO (1+1) EA O(n 3 ) [Scharnow et al., 2002] MST (1+1) EA Θ(m 2 log(nw max)) [Neumann and Wegener, 2007] (1+λ) EA O(nλ log(nw max)), λ = m2 [Neumann and Wegener, 2007] n 1-ANT O(mn log(nw max)) [Neumann and Witt, 2008] Max. Clique (1+1) EA Θ(n 5 ) [Storch, 2006] (rand. planar) (16n+1) RLS Θ(n 5/3 ) [Storch, 2006] Eulerian Cycle (1+1) EA Θ(m 2 log m) [Doerr et al., 2007] Partition (1+1) EA PRAS, avg. [Witt, 2005] Vertex Cover (1+1) EA e Ω(n), arb. bad approx. [Friedrich et al., 2007] and [Oliveto et al., 2007a] Set Cover (1+1) EA e Ω(n), arb. bad approx. [Friedrich et al., 2007] SEMO Pol. O(log n)-approx. [Friedrich et al., 2007] Intersection of (1+1) EA 1/p-approximation in [Reichel and Skutella, 2008] p 3 matroids O( E p+2 log( E w max)) UIO/FSM conf. (1+1) EA e Ω(n) [Lehre and Yao, 2007] See survey [Oliveto et al., 2007b].
3 Motivation - A Theory of Randomised Search Heuristics Computational Complexity Classification of problems according to inherent difficulty. Common limits on the efficiency of all algorithms. Assuming a particular model of computation. Computational Complexity of Search Problems Polynomial-time Local Search [Johnson et al., 1988]. Black-Box Complexity [Droste et al., 2006].
4 Black Box Complexity A f Function class F Photo: E. Gerhard (1846). [Droste et al., 2006]
5 Black Box Complexity f(x 1 ), f(x 2 ), f(x 3 ),... x 1, x 2, x 3,... A f Function class F Photo: E. Gerhard (1846). [Droste et al., 2006]
6 Black Box Complexity f(x 1 ), f(x 2 ), f(x 3 ),..., f(x t ) x 1, x 2, x 3,..., x t A f Function class F Photo: E. Gerhard (1846). Black box complexity on function class F T F := min max T A,f A f F [Droste et al., 2006]
7 Results with old Model Very general model with few restrictions on resources. Example: Needle has BB complexity (2 n + 1)/2. Some NP-hard problems have polynomial BB complexity. Artificially low BB complexity on example functions, e.g. n/ log(2n + 1) 1 on OneMax n/2 o(n) on LeadingOnes
8 Refined Black Box Model A f Function class F Photo: E. Gerhard (1846).
9 Refined Black Box Model f(x 0 ) 0 f(x 0 ) x 0 A f Function class F Photo: E. Gerhard (1846).
10 Refined Black Box Model f(x 0 ), f(x 1 ) 0, 0 f A f(x 0 ) f(x 1 ) x 0 x 1 Function class F Photo: E. Gerhard (1846).
11 Refined Black Box Model f(x 0 ), f(x 1 ), f(x 2 ) 0, 0, 2 f(x 0 ) x 0 A f(x 1 ) x 1 Function class F f f(x 2 ) x 2 Photo: E. Gerhard (1846).
12 Refined Black Box Model f(x 0 ), f(x 1 ), f(x 2 ), f(x 3 ) 0, 0, 2, 3 f(x 0 ) x 0 A f(x 1 ) x 1 Function class F f f(x 2 ) f(x 3 ) x 2 x 3 Photo: E. Gerhard (1846).
13 Refined Black Box Model f(x 0 ), f(x 1 ), f(x 2 ), f(x 3 ), f(x 4 ), f(x 5 ), f(x 6 ) 0, 0, 2, 3, 0, 2 f(x 0 ) x 0 A f(x 1 ) x 1 Function class F f f(x 2 ) f(x 3 ) x 2 x 3 f(x 4 ) x 4 Photo: E. Gerhard (1846). f(x 5 ) x 5 f(x 6 ) x 6
14 Refined Black Box Model f(x 0 ) x 0 A f(x 1 ) x 1 Function class F f f(x 2 ) f(x 3 ) x 2 x 3 f(x 4 ) x 4 Photo: E. Gerhard (1846). f(x 5 ) x 5 f(x 6 ) x 6 Unbiased black box complexity on function class F T F := min max T A,f A f F
15 Unbiased Variation Operators 1 Encoding of solution by bitstring x = x 1 x 2 x 3 x 4 x 5 x 1 x 5 x 2 x 4 x 3 1 Figure by Dake, available under a Creative Commons Attribution-Share Alike 2.5 Generic license.
16 Unbiased Variation Operators 1 Encoding of solution by bitstring x = x 1 x 2 x 3 x 4 x 5 x 1 x 2 x 3 x 4 x 5 1 Figure by Dake, available under a Creative Commons Attribution-Share Alike 2.5 Generic license.
17 Unbiased Variation Operators 1 Encoding of solution by bitstring x = x 1 x 2 x 3 x 4 x 5 x 1 x2 = 1 = blue in! x 3 x 4 = 1 = orange in! x 5 1 Figure by Dake, available under a Creative Commons Attribution-Share Alike 2.5 Generic license.
18 Unbiased Variation Operators 1 Encoding of solution by bitstring x = x 1 x 2 x 3 x 4 x 5 x 1 x2 = 1 = blue in! x 3 x 4 = 1 = orange out! x 5 1 Figure by Dake, available under a Creative Commons Attribution-Share Alike 2.5 Generic license.
19 Unbiased Variation Operators p(y x) For any bitstrings x, y, z and permutation σ, we require 1) p(y x) = p(y z x z) 2) p(y x) = p(y σ(1) y σ(2) y σ(n) x σ(1) x σ(2) x σ(n) ) We consider unary operators, but higher arities possible. [Droste and Wiesmann, 2000, Rowe et al., 2007]
20 Unbiased Variation Operators x x r y Condition 1) and 2) imply Hamming-invariance.
21 Unbiased Black-Box Algorithm Scheme 1: t 0. 2: Choose x(t) uniformly at random from {0, 1} n. 3: repeat 4: t t : Compute f(x(t 1)). 6: I(t) (f(x(0)),..., f(x(t 1))). 7: Depending on I(t), choose a prob. distr. p s on {0,..., t 1}. 8: Randomly choose an index j according to p s. 9: Depending on I(t), choose an unbiased variation op. p v ( x(j)). 10: Randomly choose a bitstring x(t) according to p v. 11: until termination condition met. (µ +, λ) EA, simulated annealing, metropolis, RLS, any population size, any selection mechanism, steady state EAs, cellular EAs, ranked based mutation...
22 Simple Unimodal Functions Algorithm LeadingOnes (1+1) EA Θ(n 2 ) (1+λ) EA Θ(n 2 + λn) (µ+1) EA Θ(n 2 + µn log n) BB Ω(n)
23 Simple Unimodal Functions Algorithm LeadingOnes (1+1) EA Θ(n 2 ) (1+λ) EA Θ(n 2 + λn) (µ+1) EA Θ(n 2 + µn log n) BB Ω(n) Theorem The expected runtime of any black box algorithm with unary, unbiased variation on LeadingOnes is Ω(n 2 ).
24 Simple Unimodal Functions Algorithm LeadingOnes (1+1) EA Θ(n 2 ) (1+λ) EA Θ(n 2 + λn) (µ+1) EA Θ(n 2 + µn log n) BB Ω(n) Theorem The expected runtime of any black box algorithm with unary, unbiased variation on LeadingOnes is Ω(n 2 ). Proof idea Potential between n/2 and 3n/4. # 0-bits flipped hypergeometrically distributed. Lower bound by polynomial drift.
25 Escaping from Local Optima Jump(x) x m
26 Escaping from Local Optima Jump(x) x m Theorem For any m n(1 ε)/2 with 0 < ε < 1, the expected runtime of any black box algorithm with unary, unbiased variation is at least 2 cm with probability 1 2 Ω(m). ( n rm) cm with probability 1 2 Ω(m ln(n/(rm))). These bounds are lower than the Θ(n m ) bound for (1+1) EA!
27 Escaping from Local Optima Jump(x) x m Proof idea Simplified drift in gaps 1. Expectation of hypergeometric distribution. 2. Chvátal s bound.
28 General Pseudo-boolean Functions Algorithm OneMax (1+1) EA Θ(n log n) (1+λ) EA O(λn + n log n) (µ+1) EA O(µn + n log n) BB Ω(n/ log n)
29 General Pseudo-boolean Functions Algorithm OneMax (1+1) EA Θ(n log n) (1+λ) EA O(λn + n log n) (µ+1) EA O(µn + n log n) BB Ω(n/ log n) Theorem The expected runtime of any black box search algorithm with unbiased, unary variation on any pseudo-boolean function with a single global optimum is Ω(n log n).
30 General Pseudo-boolean Functions Algorithm OneMax (1+1) EA Θ(n log n) (1+λ) EA O(λn + n log n) (µ+1) EA O(µn + n log n) BB Ω(n/ log n) Theorem The expected runtime of any black box search algorithm with unbiased, unary variation on any pseudo-boolean function with a single global optimum is Ω(n log n). Proof idea Expected multiplicative weight decrease. Chvátal s bound.
31 Summary and Conclusion Refined black box model. Proofs are (relatively) easy! Comprises EAs never previously analysed. Ω(n log n) on general functions. Some bounds coincide with the runtime of (1+1) EA. Future work: k-ary variation operators for k > 1.
32 References I Baswana, S., Biswas, S., Doerr, B., Friedrich, T., Kurur, P. P., and Neumann, F. (2009). Computing single source shortest paths using single-objective fitness. In FOGA 09: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pages 59 66, New York, NY, USA. ACM. Doerr, B., Klein, C., and Storch, T. (2007). Faster evolutionary algorithms by superior graph representation. In Proceedings of the 1st IEEE Symposium on Foundations of Computational Intelligence (FOCI 2007), pages Droste, S. (2006). A rigorous analysis of the compact genetic algorithm for linear functions. Natural Computing, 5(3): Droste, S., Jansen, T., and Wegener, I. (2002). On the analysis of the (1+1) Evolutionary Algorithm. Theoretical Computer Science, 276: Droste, S., Jansen, T., and Wegener, I. (2006). Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4):
33 References II Droste, S. and Wiesmann, D. (2000). Metric based evolutionary algorithms. In Proceedings of Genetic Programming, European Conference, Edinburgh, Scotland, UK, April 15-16, 2000, Proceedings, volume 1802 of Lecture Notes in Computer Science, pages Springer. Friedrich, T., Hebbinghaus, N., Neumann, F., He, J., and Witt, C. (2007). Approximating covering problems by randomized search heuristics using multi-objective models. In Proceedings of the 9th annual conference on Genetic and evolutionary computation (GECCO 2007), pages , New York, NY, USA. ACM Press. Giel, O. and Wegener, I. (2003). Evolutionary algorithms and the maximum matching problem. In Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2003), pages He, J. and Yao, X. (2003). Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artificial Intelligence, 145(1-2): Jansen, T., Jong, K. A. D., and Wegener, I. (2005). On the choice of the offspring population size in evolutionary algorithms. Evolutionary Computation, 13(4):
34 References III Johnson, D. S., Papadimitriou, C. H., and Yannakakis, M. (1988). How easy is local search? Journal of Computer and System Sciences, 37(1): Lehre, P. K. and Yao, X. (2007). Runtime analysis of (1+1) EA on computing unique input output sequences. In Proceedings of 2007 IEEE Congress on Evolutionary Computation (CEC 2007), pages IEEE Press. Mühlenbein, H. (1992). How genetic algorithms really work I. Mutation and Hillclimbing. In Proceedings of the Parallel Problem Solving from Nature 2, (PPSN-II), pages Elsevier. Neumann, F. and Wegener, I. (2007). Randomized local search, evolutionary algorithms, and the minimum spanning tree problem. Theoretical Computer Science, 378(1): Neumann, F. and Witt, C. (2006). Runtime analysis of a simple ant colony optimization algorithm. In Proceedings of The 17th International Symposium on Algorithms and Computation (ISAAC 2006), number 4288 in LNCS, pages
35 References IV Neumann, F. and Witt, C. (2008). Ant colony optimization and the minimum spanning tree problem. In Proceedings of Learning and Intelligent Optimization (LION 2008), pages Oliveto, P. S., He, J., and Yao, X. (2007a). Evolutionary algorithms and the vertex cover problem. In In Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2007). Oliveto, P. S., He, J., and Yao, X. (2007b). Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results. International Journal of Automation and Computing, 4(1): Reichel, J. and Skutella, M. (2008). Evolutionary algorithms and matroid optimization problems. Algorithmica. Rowe, J. E., Vose, M. D., and Wright, A. H. (2007). Neighborhood graphs and symmetric genetic operators. In FOGA, pages
36 References V Scharnow, J., Tinnefeld, K., and Wegener, I. (2002). Fitness landscapes based on sorting and shortest paths problems. In Proceedings of 7th Conf. on Parallel Problem Solving from Nature (PPSN VII), number 2439 in LNCS, pages Storch, T. (2006). How randomized search heuristics find maximum cliques in planar graphs. In Proceedings of the 8th annual conference on Genetic and evolutionary computation (GECCO 2006), pages , New York, NY, USA. ACM Press. Witt, C. (2005). Worst-case and average-case approximations by simple randomized search heuristics. In In Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS 05), number 3404 in LNCS, pages Witt, C. (2006). Runtime Analysis of the (µ + 1) EA on Simple Pseudo-Boolean Functions. Evolutionary Computation, 14(1): Zarges, C. (2009). On the utility of the population size for inversely fitness proportional mutation rates. In FOGA 09: Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms, pages 39 46, New York, NY, USA. ACM.
Black-Box Search by Unbiased Variation
Electronic Colloquium on Computational Complexity, Revision 1 of Report No. 102 (2010) Black-Box Search by Unbiased Variation Per Kristian Lehre and Carsten Witt Technical University of Denmark Kgs. Lyngby,
More informationPlateaus Can Be Harder in Multi-Objective Optimization
Plateaus Can Be Harder in Multi-Objective Optimization Tobias Friedrich and Nils Hebbinghaus and Frank Neumann Max-Planck-Institut für Informatik, Campus E1 4, 66123 Saarbrücken, Germany Abstract In recent
More informationRuntime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights
Runtime Analysis of Evolutionary Algorithms for the Knapsack Problem with Favorably Correlated Weights Frank Neumann 1 and Andrew M. Sutton 2 1 Optimisation and Logistics, School of Computer Science, The
More informationA Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions
A Lower Bound Analysis of Population-based Evolutionary Algorithms for Pseudo-Boolean Functions Chao Qian,2, Yang Yu 2, and Zhi-Hua Zhou 2 UBRI, School of Computer Science and Technology, University of
More informationCrossover can be constructive when computing unique input output sequences
Crossover can be constructive when computing unique input output sequences Per Kristian Lehre and Xin Yao The Centre of Excellence for Research in Computational Intelligence and Applications (CERCIA),
More informationWhen to Use Bit-Wise Neutrality
When to Use Bit-Wise Neutrality Tobias Friedrich Department 1: Algorithms and Complexity Max-Planck-Institut für Informatik Saarbrücken, Germany Frank Neumann Department 1: Algorithms and Complexity Max-Planck-Institut
More informationExperimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization
Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization Patrick Briest, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering,
More informationHow to Treat Evolutionary Algorithms as Ordinary Randomized Algorithms
How to Treat Evolutionary Algorithms as Ordinary Randomized Algorithms Technical University of Denmark (Workshop Computational Approaches to Evolution, March 19, 2014) 1/22 Context Running time/complexity
More informationOn the Approximation Ability of Evolutionary Optimization with Application to Minimum Set Cover: Extended Abstract
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence On the Approximation Ability of Evolutionary Optimization with Application to Minimum Set Cover: Extended Abstract
More informationA Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms
A Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms Pietro S. Oliveto Department of Computer Science, University of Sheffield, UK Symposium Series in Computational Intelligence
More informationMultiplicative Drift Analysis
Multiplicative Drift Analysis Benjamin Doerr Daniel Johannsen Carola Winzen Max-Planck-Institut für Informatik Campus E1 4 66123 Saarbrücken, Germany arxiv:1101.0776v1 [cs.ne] 4 Jan 2011 Submitted January
More informationComputing Single Source Shortest Paths using Single-Objective Fitness Functions
Computing Single Source Shortest Paths using Single-Objective Fitness Functions Surender Baswana Somenath Biswas Benjamin Doerr Tobias Friedrich Piyush P. Kurur Department of Computer Science and Engineering
More informationRuntime Analysis of Evolutionary Algorithms: Basic Introduction 1
Runtime Analysis of Evolutionary Algorithms: Basic Introduction 1 Per Kristian Lehre University of Nottingham Nottingham NG8 1BB, UK PerKristian.Lehre@nottingham.ac.uk Pietro S. Oliveto University of Sheffield
More informationRuntime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization
Runtime Analyses for Using Fairness in Evolutionary Multi-Objective Optimization Tobias Friedrich 1, Christian Horoba 2, and Frank Neumann 1 1 Max-Planck-Institut für Informatik, Saarbrücken, Germany 2
More informationEvolutionary Algorithms How to Cope With Plateaus of Constant Fitness and When to Reject Strings of The Same Fitness
Evolutionary Algorithms How to Cope With Plateaus of Constant Fitness and When to Reject Strings of The Same Fitness Thomas Jansen and Ingo Wegener FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund,
More informationRuntime Analysis of Binary PSO
Runtime Analysis of Binary PSO Dirk Sudholt Fakultät für Informatik, LS 2 Technische Universität Dortmund Dortmund, Germany Carsten Witt Fakultät für Informatik, LS 2 Technische Universität Dortmund Dortmund,
More informationFaster Black-Box Algorithms Through Higher Arity Operators
Faster Black-Box Algorithms Through Higher Arity Operators Benjamin Doerr 1 Daniel Johannsen 1 Timo Kötzing1 Per Kristian Lehre Markus Wagner 1 1 Max-Planck-Institut für Informatik Campus E1 4 6613 Saarbrücken,
More informationGeometric Semantic Genetic Programming (GSGP): theory-laden design of semantic mutation operators
Geometric Semantic Genetic Programming (GSGP): theory-laden design of semantic mutation operators Andrea Mambrini 1 University of Birmingham, Birmingham UK 6th June 2013 1 / 33 Andrea Mambrini GSGP: theory-laden
More informationRuntime Analysis of a Simple Ant Colony Optimization Algorithm
Algorithmica (2009) 54: 243 255 DOI 10.1007/s00453-007-9134-2 Runtime Analysis of a Simple Ant Colony Optimization Algorithm Frank Neumann Carsten Witt Received: 22 January 2007 / Accepted: 20 November
More informationOptimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation
Downloaded from orbit.dtu.dk on: Oct 12, 2018 Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation Witt, Carsten Published in: 29th International Symposium on Theoretical
More informationTECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531
TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationWhen Is an Estimation of Distribution Algorithm Better than an Evolutionary Algorithm?
When Is an Estimation of Distribution Algorithm Better than an Evolutionary Algorithm? Tianshi Chen, Per Kristian Lehre, Ke Tang, and Xin Yao Abstract Despite the wide-spread popularity of estimation of
More informationOn the Impact of Objective Function Transformations on Evolutionary and Black-Box Algorithms
On the Impact of Objective Function Transformations on Evolutionary and Black-Box Algorithms [Extended Abstract] Tobias Storch Department of Computer Science 2, University of Dortmund, 44221 Dortmund,
More informationRuntime Analysis of Genetic Algorithms with Very High Selection Pressure
Runtime Analysis of Genetic Algorithms with Very High Selection Pressure Anton V. Eremeev 1,2 1 Sobolev Institute of Mathematics, Omsk Branch, 13 Pevtsov str., 644099, Omsk, Russia 2 Omsk State University
More informationSimulated Annealing Beats Metropolis in Combinatorial Optimization
Electronic Colloquium on Computational Complexity, Report No. 89 (2004) Simulated Annealing Beats Metropolis in Combinatorial Optimization Ingo Wegener FB Informatik, LS2, Univ. Dortmund, Germany ingo.wegener@uni-dortmund.de
More informationA Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization
Algorithmica (2017) 78:641 659 DOI 10.1007/s00453-016-0262-4 A Runtime Analysis of Parallel Evolutionary Algorithms in Dynamic Optimization Andrei Lissovoi 1 Carsten Witt 2 Received: 30 September 2015
More informationTECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531
TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationREIHE COMPUTATIONAL INTELLIGENCE S O N D E R F O R S C H U N G S B E R E I C H 5 3 1
U N I V E R S I T Ä T D O R T M U N D REIHE COMPUTATIONAL INTELLIGENCE S O N D E R F O R S C H U N G S B E R E I C H 5 3 1 Design und Management komplexer technischer Prozesse und Systeme mit Methoden
More informationWhen to use bit-wise neutrality
Nat Comput (010) 9:83 94 DOI 10.1007/s11047-008-9106-8 When to use bit-wise neutrality Tobias Friedrich Æ Frank Neumann Published online: 6 October 008 Ó Springer Science+Business Media B.V. 008 Abstract
More informationUNIVERSITY OF DORTMUND
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods
More informationRuntime Analysis of (1+1) EA on Computing Unique Input Output Sequences
1 Runtime Analysis of (1+1) EA on Computing Unique Input Output Sequences Per Kristian Lehre and Xin Yao Abstract Computing unique input output (UIO) sequences is a fundamental and hard problem in conformance
More informationRunning time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem
Research Collection Working Paper Running time analysis of a multi-objective evolutionary algorithm on a simple discrete optimization problem Author(s): Laumanns, Marco; Thiele, Lothar; Zitzler, Eckart;
More informationREIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531
U N I V E R S I T Y OF D O R T M U N D REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 53 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationExpected Running Time Analysis of a Multiobjective Evolutionary Algorithm on Pseudo-boolean Functions
Expected Running Time Analysis of a Multiobjective Evolutionary Algorithm on Pseudo-boolean Functions Nilanjan Banerjee and Rajeev Kumar Department of Computer Science and Engineering Indian Institute
More informationUNIVERSITY OF DORTMUND
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods
More informationGeometric Semantic Genetic Programming (GSGP): theory-laden design of variation operators
Geometric Semantic Genetic Programming (GSGP): theory-laden design of variation operators Andrea Mambrini University of Birmingham, UK NICaiA Exchange Programme LaMDA group, Nanjing University, China 7th
More informationTECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531
TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationREIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531
U N I V E R S I T Y OF D O R T M U N D REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationSimple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions
Simple Max-Min Ant Systems and the Optimization of Linear Pseudo-Boolean Functions Timo Kötzing Max-Planck-Institut für Informatik 66123 Saarbrücken, Germany Dirk Sudholt CERCIA, University of Birmingham
More informationRefined Upper Bounds on the Expected Runtime of Non-elitist Populations from Fitness-Levels
Refined Upper Bounds on the Expected Runtime of Non-elitist Populations from Fitness-Levels ABSTRACT Duc-Cuong Dang ASAP Research Group School of Computer Science University of Nottingham duc-cuong.dang@nottingham.ac.uk
More informationAn Analysis on Recombination in Multi-Objective Evolutionary Optimization
An Analysis on Recombination in Multi-Objective Evolutionary Optimization Chao Qian, Yang Yu, Zhi-Hua Zhou National Key Laboratory for Novel Software Technology Nanjing University, Nanjing 20023, China
More informationAnalysis of Evolutionary Algorithms for the Longest Common Subsequence Problem
Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem ABSTRACT Thomas Jansen Universität Dortmund Fachbereich Informatik LS Effiziente Alg. u. Komplexitätstheorie 44221 Dortmund,
More informationRuntime Analysis of a Binary Particle Swarm Optimizer
Runtime Analysis of a Binary Particle Swarm Optimizer Dirk Sudholt Fakultät für Informatik, LS 2 Technische Universität Dortmund Dortmund, Germany Carsten Witt Fakultät für Informatik, LS 2 Technische
More informationRunning Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem
Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem Marco Laumanns 1, Lothar Thiele 1, Eckart Zitzler 1,EmoWelzl 2,and Kalyanmoy Deb 3 1 ETH Zürich,
More informationUNIVERSITY OF DORTMUND
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods
More informationEvolutionary Algorithms and Other Search Heuristics. Bioinspired Computation in Combinatorial Optimization
Bioinspired Computation in Combinatorial Optimization Algorithms and Their Computational Complexity Evolutionary Algorithms and Other Search Heuristics Most famous search heuristic: Evolutionary Algorithms
More informationREIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531
U N I V E R S I T Y OF D O R T M U N D REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationImproved Computational Complexity Results for Weighted ORDER and MAJORITY
Improved Computational Complexity Results for Weighted ORDER and MAJORITY Anh Nguyen Evolutionary Computation Group School of Computer Science The University of Adelaide Adelaide, SA 5005, Australia Tommaso
More informationThe Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.
Dang, Duc-Cuong and Lehre, Per Kristian 2016 Runtime analysis of non-elitist populations: from classical optimisation to partial information. Algorithmica, 75 3. pp. 428-461. ISSN 1432-0541 Access from
More informationThe Fitness Level Method with Tail Bounds
The Fitness Level Method with Tail Bounds Carsten Witt DTU Compute Technical University of Denmark 2800 Kgs. Lyngby Denmark arxiv:307.4274v [cs.ne] 6 Jul 203 July 7, 203 Abstract The fitness-level method,
More informationREIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531
U N I V E R S I T Y OF D O R T M U N D REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationOn the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments
On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments Chao Qian 1, Yang Yu 1, Yaochu Jin 2, and Zhi-Hua Zhou 1 1 National Key Laboratory for Novel Software Technology, Nanjing
More informationImproved Runtime Bounds for the Univariate Marginal Distribution Algorithm via Anti-Concentration
Improved Runtime Bounds for the Univariate Marginal Distribution Algorithm via Anti-Concentration Phan Trung Hai Nguyen June 26, 2017 School of Computer Science University of Birmingham Birmingham B15
More informationOn Constrained Boolean Pareto Optimization
On Constrained Boolean Pareto Optimization Chao Qian and Yang Yu and Zhi-Hua Zhou National Key Laboratory for Novel Software Technology, Nanjing University Collaborative Innovation Center of Novel Software
More informationThe (1+) evolutionary algorithm with self-adjusting mutation rate
Downloaded from orbit.dtu.dk on: Dec 15, 2017 The 1+) evolutionary algorithm with self-adjusting mutation rate Doerr, Benjamin; Witt, Carsten; Gießen, Christian; Yang, Jing Published in: Proceedings of
More informationA Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem
A Comparison of GAs Penalizing Infeasible Solutions and Repairing Infeasible Solutions on the 0-1 Knapsack Problem Jun He 1, Yuren Zhou 2, and Xin Yao 3 1 J. He is with the Department of Computer Science,
More informationREIHE COMPUTATIONAL INTELLIGENCE S O N D E R F O R S C H U N G S B E R E I C H 5 3 1
U N I V E R S I T Ä T D O R T M U N D REIHE COMPUTATIONAL INTELLIGENCE S O N D E R F O R S C H U N G S B E R E I C H 5 3 1 Design und Management komplexer technischer Prozesse und Systeme mit Methoden
More informationAverage Drift Analysis and Population Scalability
Average Drift Analysis and Population Scalability Jun He and Xin Yao Abstract This paper aims to study how the population size affects the computation time of evolutionary algorithms in a rigorous way.
More informationMETHODS FOR THE ANALYSIS OF EVOLUTIONARY ALGORITHMS ON PSEUDO-BOOLEAN FUNCTIONS
METHODS FOR THE ANALYSIS OF EVOLUTIONARY ALGORITHMS ON PSEUDO-BOOLEAN FUNCTIONS Ingo Wegener FB Informatik, LS2, Univ. Dortmund, 44221 Dortmund, Germany wegener@ls2.cs.uni-dortmund.de Abstract Many experiments
More informationRigorous Analyses for the Combination of Ant Colony Optimization and Local Search
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search Frank Neumann 1, Dirk Sudholt 2, and Carsten Witt 2 1 Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany, fne@mpi-inf.mpg.de
More informationTheory of Evolutionary Computation
Theory of Evolutionary Computation Benjamin Doerr École Polytechnique, Paris-Saclay, France PPSN 2016, Edinburgh 1 Link to the Latest Version You can always find the latest version online at http://people.mpi-inf.mpg.de/~doerr/ppsn16_tutorial_theory.pdf
More informationUNIVERSITY OF DORTMUND
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods
More informationRigorous Runtime Analysis of a (µ+1) ES for the Sphere Function
Rigorous Runtime Analysis of a (µ+1) ES for the Sphere Function Jens Jägersküpper Dept. of Computer Science, LS 2 University of Dortmund Germany jens.jaegerskuepper@udo.edu Carsten Witt Dept. of Computer
More informationWhen Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms 1. Dogan Corus, Pietro S. Oliveto, Donya Yazdani
When Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms 1 Dogan Corus, Pietro S. Oliveto, Donya Yazdani Department of Computer Science, University of Sheffield
More informationTheory of Evolutionary Computation: A True Beginners Tutorial
Theory of Evolutionary Computation: A True Beginners Tutorial Benjamin Doerr École Polytechnique, Paris-Saclay, France CEC 2017, Donostia San Sebastián 1 Link to the Latest Version You can always find
More informationAnalysis of Random Noise and Random Walk Algorithms for Satisfiability Testing
Analysis of Random Noise and Random Walk Algorithms for Satisfiability Testing Bhaskar Krishnamachari 1,XiXie 1,BartSelman 2, and Stephen Wicker 1 1 School of Electrical Engineering Cornell University,
More informationU N I V E R S I T Y OF D O R T M U N D
U N I V E R S I T Y OF D O R T M U N D REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence
More informationRuntime Analysis of the (1 + (λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas
Runtime Analysis of the (1 + (λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas arxiv:1704.04366v1 [cs.ne] 14 Apr 2017 Maxim Buzdalov April 17, 2017 Abstract Benjamin Doerr The (1+(λ, λ)) genetic
More informationGaussian EDA and Truncation Selection: Setting Limits for Sustainable Progress
Gaussian EDA and Truncation Selection: Setting Limits for Sustainable Progress Petr Pošík Czech Technical University, Faculty of Electrical Engineering, Department of Cybernetics Technická, 66 7 Prague
More informationA New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms Yang Yu and Zhi-Hua Zhou National Laboratory for Novel Software Technology Nanjing University, Nanjing 20093, China
More informationA Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling
A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling Andrew M. Sutton and Frank Neumann School of Computer Science, University of Adelaide, Adelaide, SA 5005, Australia
More informationUNIVERSITY OF DORTMUND
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods
More informationEvolutionary Computation Theory. Jun He School of Computer Science University of Birmingham Web: jxh
Evolutionary Computation Theory Jun He School of Computer Science University of Birmingham Web: www.cs.bham.ac.uk/ jxh Outline Motivation History Schema Theorem Convergence and Convergence Rate Computational
More informationToward a Complexity Theory for Randomized Search Heuristics: Black-Box Models. Dissertation. Carola Winzen
Toward a Complexity Theory for Randomized Search Heuristics: Black-Box Models Dissertation zur Erlangung des Grades des Doktors der Ingenieurwissenschaften der Naturwissenschaftlich-Technischen Fakultäten
More informationImproved time complexity analysis of the Simple Genetic Algorithm
Downloaded from orbit.dtu.dk on: Nov 0, 0 Improved time complexity analysis of the Simple Genetic Algorithm Oliveto, Pietro S.; Witt, Carsten Published in: Theoretical Computer Science Link to article,
More informationarxiv: v1 [cs.dm] 29 Aug 2013
Collecting Coupons with Random Initial Stake Benjamin Doerr 1,2, Carola Doerr 2,3 1 École Polytechnique, Palaiseau, France 2 Max Planck Institute for Informatics, Saarbrücken, Germany 3 Université Paris
More informationAn Exponential Lower Bound for the Runtime of the cga on Jump Functions
An Exponential Lower Bound for the Runtime of the cga on Jump Functions arxiv:190.0815v1 [cs.ne] 17 Apr 2019 Benjamin Doerr École Polytechnique CNRS Laboratoire d Informatique (LIX) Palaiseau France April
More informationP, NP, NP-Complete, and NPhard
P, NP, NP-Complete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NP-Complete and NP-Hard problems Algorithm time complicity Outline What is this course
More informationUnit 1A: Computational Complexity
Unit 1A: Computational Complexity Course contents: Computational complexity NP-completeness Algorithmic Paradigms Readings Chapters 3, 4, and 5 Unit 1A 1 O: Upper Bounding Function Def: f(n)= O(g(n)) if
More informationUNIVERSITY OF DORTMUND
UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods
More informationMetaheuristics and Local Search
Metaheuristics and Local Search 8000 Discrete optimization problems Variables x 1,..., x n. Variable domains D 1,..., D n, with D j Z. Constraints C 1,..., C m, with C i D 1 D n. Objective function f :
More informationMetaheuristics and Local Search. Discrete optimization problems. Solution approaches
Discrete Mathematics for Bioinformatics WS 07/08, G. W. Klau, 31. Januar 2008, 11:55 1 Metaheuristics and Local Search Discrete optimization problems Variables x 1,...,x n. Variable domains D 1,...,D n,
More informationFirst hitting time analysis of continuous evolutionary algorithms based on average gain
Cluster Comput (06) 9:33 33 DOI 0.007/s0586-06-0587-4 First hitting time analysis of continuous evolutionary algorithms based on average gain Zhang Yushan Huang Han Hao Zhifeng 3 Hu Guiwu Received: 6 April
More informationarxiv: v2 [cs.ds] 11 Oct 2017
Stochastic Runtime Analysis of a Cross-Entropy Algorithm for Traveling Salesman Problems Zijun Wu a,1,, Rolf H. Möhring b,2,, Jianhui Lai c, arxiv:1612.06962v2 [cs.ds] 11 Oct 2017 a Beijing Institute for
More informationExperimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics
Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics Tommaso Urli 1,MarkusWagner 2,andFrankNeumann 2 1 DIEGM, Università
More informationInvestigation of Mutation Strategies in Differential Evolution for Solving Global Optimization Problems
Investigation of Mutation Strategies in Differential Evolution for Solving Global Optimization Problems Miguel Leon Ortiz and Ning Xiong Mälardalen University, Västerås, SWEDEN Abstract. Differential evolution
More informationPROBABILISTIC ANALYSIS OF THE (1 + 1)-EVOLUTIONARY ALGORITHM
/59 PROBABILISTIC ANALYSIS OF THE (1 + 1)-EVOLUTIONARY ALGORITHM Hsien-Kuei Hwang (joint with Alois Panholzer, Nicolas Rolin, Tsung-Hsi Tsai, Wei-Mei Chen) October 13, 2017 /59 MIT: EVOLUTONARY COMPUTATION
More informationSensitivity of Parameter Control Mechanisms with Respect to Their Initialization
Sensitivity of Parameter Control Mechanisms with Respect to Their Initialization Carola Doerr 1 and Markus Wagner 2 1 Sorbonne Université, CNRS, Laboratoire d Informatique de Paris 6, LIP6, 75005 Paris,
More informationLecture 9 Evolutionary Computation: Genetic algorithms
Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic
More informationAlgortithms for the Min-Cut problem
Algortithms for the Min-Cut problem Hongwei Jin Department of Applied Mathematics Illinois Insititute of Technology April 30, 2013 Outline 1 Introduction Problem Definition Previous Works 2 Karger s Algorithm
More informationDRAFT -- DRAFT -- DRAFT -- DRAFT -- DRAFT --
Towards an Analytic Framework for Analysing the Computation Time of Evolutionary Algorithms Jun He and Xin Yao Abstract In spite of many applications of evolutionary algorithms in optimisation, theoretical
More informationDoes Better Inference mean Better Learning?
Does Better Inference mean Better Learning? Andrew E. Gelfand, Rina Dechter & Alexander Ihler Department of Computer Science University of California, Irvine {agelfand,dechter,ihler}@ics.uci.edu Abstract
More informationA Restart CMA Evolution Strategy With Increasing Population Size
Anne Auger and Nikolaus Hansen A Restart CMA Evolution Strategy ith Increasing Population Size Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2005 c IEEE A Restart CMA Evolution Strategy
More informationEvolutionary Computation
Evolutionary Computation Lecture Algorithm Configura4on and Theore4cal Analysis Outline Algorithm Configuration Theoretical Analysis 2 Algorithm Configuration Question: If an EA toolbox is available (which
More informationA Computational View on Natural Evolution
A Computational View on Natural Evolution On the Rigorous Analysis of the Speed of Adaptation Jorge Pérez Heredia Department of Computer Science University of Sheffield This dissertation is submitted for
More informationComplexity of local search for the p-median problem
Complexity of local search for the p-median problem Ekaterina Alekseeva, Yuri Kochetov, Alexander Plyasunov Sobolev Institute of Mathematics, Novosibirsk {ekaterina2, jkochet, apljas}@math.nsc.ru Abstract
More informationPopulation-Based Incremental Learning with Immigrants Schemes in Changing Environments
Population-Based Incremental Learning with Immigrants Schemes in Changing Environments Michalis Mavrovouniotis Centre for Computational Intelligence (CCI) School of Computer Science and Informatics De
More informationLandscapes and Other Art Forms.
Landscapes and Other Art Forms. Darrell Whitley Computer Science, Colorado State University Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted
More informationA Simple Ant Colony Optimizer for Stochastic Shortest Path Problems
Algorithmica manuscript No. (will be inserted by the editor) A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems Dirk Sudholt Christian Thyssen Received: date / Accepted: date Abstract
More informationP,NP, NP-Hard and NP-Complete
P,NP, NP-Hard and NP-Complete We can categorize the problem space into two parts Solvable Problems Unsolvable problems 7/11/2011 1 Halting Problem Given a description of a program and a finite input, decide
More information