Linkage Identification Based on Epistasis Measures to Realize Efficient Genetic Algorithms
|
|
- Curtis Reynolds
- 5 years ago
- Views:
Transcription
1 Linkage Identification Based on Epistasis Measures to Realize Efficient Genetic Algorithms Masaharu Munetomo Center for Information and Multimedia Studies, Hokkaido University, North 11, West 5, Sapporo Japan. Abstract Genetic algorithms (GAs) process building blocks (BBs) mixed and tested through genetic recombination operators. To realize effective B- B processing,linkage identification is essential which detects a set of loci tightly linked. This paper proposes a linkage identification with epistasis measures (LIEM) that detects linkage groups based on a pairwise epistasis measure. I. Introduction Genetic Algorithms (GAs) are considered robust search technique to solve difficult problems such as combinatorial optimization problems. GAs repeatedly apply genetic operators such as crossover, mutation, and selection to a population of strings each of which represents a point in a problem domain. Recombination operators such as crossover exchange substrings between a pair of strings, and perturbation operators such as mutation flips a bit of a string. Generally speaking, the essence of genetic search lies in its processing of building blocks (BBs) short, well-performed sub-solutions through recombination operators to speed up genetic optimization. GAs have been applied to wide spectrum of application problems and a number of researchers reported GAs are quite efficient in solving their problems; on the other hand, some reported quite poor performances on their applications of GAs. Various reasons are considered for the poor performances such as the essential GA-difficulty of the problem itself, not enoughly-sized initial population, and so on. However, in most cases that GAs perform poorly, genetic recombination mechanism which is considered essential in genetic optimization does not work effectively due to improper encoding, failure of designing recombination operators mainly because the importance of tight linkage in encoding and recombinations is ignored. To insure tight linkage is essential for recombination operators to work effectively. A set of loci that belong to a BB should be tightly linked in order to be survived along genetic optimization process. In this paper, the word linkage means a set of loci that belong to a same BB and linkage group or linkage set is defined as a set of loci tightly linked that may form a BB. This paper proposes a linkage identification procedure that detects linkage groups to realize efficient genetic recombinations. This paper continues as follows: In section II, an introduction is given on a history of linkage identifications from messy GAs to the current work on linkage identification algorithms. In section III, a detailed description is given on the proposed algorithm called the linkage identification with epistasis measures (LIEM). In section IV and V, empirical investigations and their discussions are given on some nonlinear functions of the sum of GA-difficult trap functions, which were considered d- ifficult to detect accurate linkage groups. II. Linkage identification Decomposability of a problem into subproblems is essential to realizing effective search with optimization algorithms based on divide and rule strategy. For example, a linear combination of sub-functions is apparently decomposable: a function h(x 1,x 2 )=f(x 1 )+g(x 2 ) can be optimized separately by solving optimization sub-problems for functions f(x 1 ) and g(x 2 ). For genetic optimizations, problem decomposition based on BBs and their mixing by recombination operators are essential to realize effective search. However, this does not mean that strict decomposability is necessary for effective GA search, rather, quasi-decomposability is required. Problems without any decomposability cannot be solved effectively with any divide and rule strategy. Classical GAs did not consider the problem decomposition explicitly they process BBs indirectly with general or problem-specific crossover operators. To search BBs directly, the messy GA (mga)[2] processes underor over-specified strings that represents schemata. The mga does not have an explicit linkage representation, which tries to learn linkages indirectly by searching BBs through cut and splice operators applied to a number of BB candidates (schemata) generated in its primordial phase. On the other hand, in the gene expression mga (gemga)[5, 4, 6] assigns a weight to each locus in order to check local optimality concerning the locus and detect candidates of loci that belong to a same linkage group. Another approach employed in the linkage learning GA
2 (LLGA)[3] is based on two-point-like crossover operator applied to circular encoded strings. The crossover of the LLGA tends to preserve tight linkages of the problem, if the problem is loosely separable to sub-functions which is not uniformly-scaled (that is, contribution of each subfunction to overall function value is not uniform). These GAs try to identify linkage groups along their optimization process. On the other hand, linkage identification procedures generate linkage groups directly from an initial population before starting an optimization process. The linkage identification by nonlinearity check (LINC)[9, 8] pioneered direct linkage identification procedures. The LINC detects arbitrary nonlinearity for each pair of loci based on a population of strings to obtain a set of tightly linked loci. The algorithm of the LINC is shown in figure 1. It calculates the following fitness changes by bitwise perturbations for each pair of loci (i, j): f i (s) = f(.. s i...) f(..s i...) f j (s) = f(... s j..) f(...s j..) f ij (s) = f(.. s i. s j..) f(..s i.s j...), (1) where f(s) is a fitness functions of s and s =1 s (0 1or1 0) stands for a perturbation. algorithm LINC P = initialize N strings for each s in P for i = 0 to length-1 s = Perturb(s, i); df1 = f(s ) - f(s); for j = i to length-1 if i!= j then s = Perturb(s, j); df2 = f(s ) - f(s); s = Perturb(s, i) df12 = f(s ) - f(s); if df12 - (df1 + df2) > epsilon then /* nonlinearity detected between i and j */ adding j to the linkage_set[i]; adding i to the linkage_set[j]; endif endif Figure 1: The Linkage Identification by Nonlinearity Check (LINC) In the LINC algorithm, if f ij (s) f i (s)+ f j (s) (practically, we should allow some small amount of error ɛ in the condition; therefore, we employ f ij (s) ( f i (s)+ f j (s)) >ɛ) is satisfied in at least one string s in a population P, we consider loci i and j are tightly linked and include them to the same linkage group. It is essential to checking the above condition for all strings in an enoughly-sized population. Even if a GAeasy linearity is detected in a string, this does not mean the problem is GA-easy because of the possibility that a strong nonlinearity may be detected in another string (For example, GA-difficult trap function is linear along its deceptive attractor). Therefore, it is necessary to check the conditions for all possible strings in order to detect nonlinearity of the problem. It is practically impossible to check the condition for all possible strings of order O(2 l ), where l is the string length. Instead, when we assume that maximum order of BBs is fixed to k that satisfies k << l (this is the condition that GA works effectively), the necessary number of strings n has been calculated as n =2 k log(1 r) where r is the probability to obtain correct linkage groups, which is much smaller than the original exponential estimation [9]. III. Linkage identification with epistasis measures In this paper, we propose a linkage identification algorithm with epistasis measures (LIEM). The LIEM replaces strict condition of the LINC with condition based on a linkage measure that represents strength of epistasis a- mong loci. Figure 2 shows this idea of linkage identification strong epistasis (e ij : large) tightly linked (linkage group) weak epistasis (e ij : small) loosely linked (separable) calculate epistasis measures (e ) ij Figure 2: Overview of the LIEM We believe that linkage should be identified by detecting differences between strong epistasis and weak one (including linearity). Weak epistasis among a set of loci means that the problem can be decomposed into subproblems concerning the loci and will be easily optimized separately. On the other hand, a set of loci with strong epistasis are difficult to separate and optimize, therefore they should be treated all together along optimization process through recombination operators. Basically, genetic search with recombination operators processes relatively weak epistasis (or GA-easy epistasis) and strong (GA-difficult) epistasis such as deception can only be processed with enumerative search realized in an enoughly-sized population of strings (therefore, the population needs to have O(2 k ) strings where k is the maxi-
3 mum order of BBs). The LIEM we propose realizes efficient linkage identifications based on a clear definition of strength of epistasis. This approach is based on a pairwise epistasis measure e ij 0 defined for each pair of loci (i, j) that measures a strength of epistasis between the loci. Several papers have been published on epistasis measures such as epistasis variance proposed by Davidor[1], normalized epistasis value and bit decidability proposed by Naudts et al[7]. However, they concentrate their discussions on relation between epistasis measures of w- hole fitness functions and their GA-difficulties. Therefore, such measures only give approximate estimations of GA-difficulty in solving the problem, and are useless in identifying linkage groups to realize efficient genetic optimizations. On the other hand, the proposed pairwise epistasis measure is designed for linkage identifications by detecting tightness of linkage for each pair of loci. In this paper, we employ a simple pairwise epistasis measure based on the LINC criterion defined as follows (We can assume another definition of linkage measure.): e ij = max f ij(s) ( f i (s)+ f j (s)), (2) s P where f i (s), f j (s), f ij (s) are the same as those in equations (1). The above equation calculates maximum distance from the border whether the LINC condition is satisfied or not. Employing the definition, the LINC condition can be rewritten as follows: if e ij 0 then pair (i, j) are tightly linked because a nonlinearity is detected and they should be included in a same linkage group. if e ij = 0 then pair (i, j) are separated as a linear combination because f ij (s) = f i (s) + f j (s) is satisfied for all s, and therefore they should not be included in a same linkage group. Therefore, smaller value of e ij indicates relatively weak nonlinearity and pair of loci with smaller e ij should be treated separately, and larger value of e ij indicates relatively strong nonlinearity and pair of loci with larger e ij should be included in a same linkage group because they are considered tightly linked. Based on the above idea, in the LIEM, a linkage group of a locus is identified by sorting the epistasis measures concerning the locus and picking up a fixed number of loci k from those with larger value of the measure. For example, when we have the following values for pairwise epistasis measures e ij for locus i, e 12 =0.5, e 13 =1.1, e 14 =0.3, e 15 =0.0, e 16 =0.1, and we pick up three loci as a linkage group, first, e ij are sorted as follows: e 13 >e 12 >e 14 >e 16 >e 15, and second, we pick up three loci according to the sorted e ij and obtain {3, 2, 4} as tightly linked with locus 1 and consequently, the obtained linkage group is {1, 2, 3, 4}. Note that loci with zero epistasis measure (e ij =0) should not be included in the linkage group. In the above definition of epistasis measure, a pair of loci (i, j) do not consider to be tightly linked when e ij =0. To apply the LIEM, we need to assume the maximum length of BBs as the fixed number of loci k defined above. In this paper, we call the order difficulty number d because it represents the problem difficulty for genetic recombinations. According to the population sizing discussed in the previous section[9], an initial population of O(2 k ) strings becomes necessary to obtain correct linkage groups. Rather, it is more natural to argue that when the initial population size is fixed, the maximum length of BBs how many order of BBs can detect is fixed. In figure 3, we show a detailed description of the LIEM algorithm. The algorithm start with setting the initial population size N = c 2 d and randomly generate a population P consisting of N strings. After the initialization, epistasis measures e[i][j] are calculated for each pair of loci (i, j) based on fitness changes for all strings s in a population by applying perturbations (perturb(s,i) means i-th position of string s is perturbed by s i = s i =1 s i ). And the calculated epistasis measures are sorted. A linkage group of locus i (l[i][*]) is obtained by selecting a set of locus according to the sorted measures (except when the measure is equal to zero, practically, smaller than a small value of epsilon). The time complexity of the LIEM algorithm is O(2 k l 2 ) because perturbations are applied for all pair of loci of order O(l 2 ) to each string in properly sized O(2 k ) strings. IV. Empirical investigations The LIEM algorithm is expected to identify correct linkage groups not only for quasi-linear combination of GAdifficult sub-functions but also some (weak) nonlinear combination of the sub-functions. It is considered difficult to validate the effectiveness of the LIEM for wide spectrum of practical problems. Therefore, in this empirical study, we perform experiments on some linear and nonlinear functions of the sum of GA-difficult trap functions. In the following simulation experiments, we employ the following sum of trap functions defined as follows: f i (u i )= 10 h(x) = f i (u i ). (3) i=1 { 4 ui if 0 u i 4 5 if u i =5 (4) where u i is the number of ones (unitation) in each 5-bit substring of x. In order to control difficulty of linkage identification by changing nonlinearity of the whole fitness functions, we employ f(x) =h(x) n (n =1, 2, ) as test functions.
4 Table 1 shows the percentage of linkage groups correctly identified by the LIEM and the LINC. (Even though strings are randomly enocoded, the same result should be obtained from the nature of the algorithms.) Table 1: % of linkage correctly identified h(x) n % of correct linkage n LIEM LINC The LINC is vulnerable to nonlinearity of overall fitness functions because the algorithm detects strict nonlinearity to obtain linkage group. We can introduce some threshold in the condition, however, such modification only removes minor effects caused by small amount of noise and cannot solve the above problem caused by relatively weak nonlinearity. On the other hand, the LIEM achieves robust linkage identification for these nonlinear test functions. The obtained linkage groups for functions h(x), h(x) 2, h(x) 5 are shown in figure 4. The numbers after : represent a set of loci tightly linked to the locus specified before :. For example, 0 : represents that a set of loci {0, 1, 2, 3, 4} belong to a linkage group for locus 0. For functions h(x), linear combination of trap functions and h(x) 2, weak nonlinear one, the LIEM can obtain correct results in which each 5-bit sub-function is detected as a linkage group. For h(x) 5, relative strong nonlinear function of the sum of trap functions, the LIEM sometimes failed to identify linkage groups. For example, in linkage group of locus 48, the obtained linkage group is {48, 45, 47, 49, 0}, that should be {48, 45, 47, 49, 46}. In order to understand the reason linkage identification failed for nonlinear functions, we plot the values of epistasis measures for the test functions in figure 5 (h(x)), figure 6 (h(x) 2 ), and figure 7 (h(x) 5 ). In the figures, X- axis and Y-axis represent a pair loci (bit position), and Z-axis shows the value of epistasis measure of the pair. As in figure 5, the landscape of the epistasis measures for linear function h(x) has clear distinction between tightly linked and loosely-linked pair of loci. For h(x) 2 (in figure 6), its landscape becomes more complex because of its nonlinearity, however, it is still not difficult to detect linkage groups. On the other hand, for h(x) 5, a function with strong nonlinearity, the landscape of the epistasis measures has complex structure which is difficult for the LIEM to identify correct linkage groups. This difficulty is considered natural because the nonlinearity caused by function of h(x) 5 is large enough compared with the nonlinearity by the trap functions and it becomes difficult to detect epistasis difference between the functions. V. Discussions Through empirical studies above, we have shown that the LIEM can obtain correct linkage groups for weak nonlinear functions of the sum of GA-difficult trap functions. This result implies that correct linkage can be detected when overall nonlinearity of fitness functions is small e- nough compared with nonlinearity inside a linkage group. This is because the LIME observes the difference between strong epistasis inside a set of loci in a linkage group and relatively weak epistasis among the other locus pairs. In this paper, we adopt a simple pairwise epistasis measure based on the condition of the LINC. Although the proposed definition seems reasonable, it is still important to seek for more general definition of epistasis measures. In our definition in equation (2), we calculate a maximum difference between simultaneous and individual fitness changes by perturbations. This definition only considers one maximum instance in the population and does not deal with overall fitness landscape. By replacing the maximum part with some nonlinear functions, we may design another measure taking populational fitness landscape into consideration. Other than designing epistasis measures based on the LINC, we may consider another definition of epistasis measures based on the linkage identification by nonmonotonicity detection (LIMD) proposed elsewhere[10, 11]. The LIMD generates linkage groups by detecting violation of its monotonicity condition. The monotonicity condition is based on an idea that monotonicity of a function is considered easy for all search algorithms including GAs and violation of monotonicity should be detected to find GA-difficulty. Although the basic idea of the LIMD is different from that of the LINC which is based on epistasis, we might define an epistasis-like measure from the LIMD condition that may give more accurate identifications of linkage groups. VI. Conclusion Linkage identification is essential for genetic recombinations to work effectively and reliably. This paper proposes a linkage identification procedure based on a pairwise epistasis measures calculated for each pair of loci. The key idea of the linkage identification is to detect difference between strong and weak epistasis. The LIEM we propose is a simple yet powerful procedure that generates correct linkage groups even for some nonlinear functions of the sum of trap functions for which the LINC cannot obtain correct results. Through empirical studies that illustrates the landscape of the epistasis measures for some test functions, we show the effectiveness of the linkage i- dentification based on the measures.
5 References [1] Y. Davidor. Epistasis variance: A viewpoint on GA-hardness. Foundation of Genetic Algorithms 1, pages 23 35, [2] D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5): , [3] G. R. Harik and D. E. Goldberg. Learning linkage. Foundations of Genetic Algorithms 4, pages , [4] H. Kargupta. The gene expression messy genetic algorithm. Proceedings of the 1996 IEEE Conference on Evolutionary Computation, pages , Piscataway, NJ, IEEE Service Center. [5] H. Kargupta. SEARCH, evolution, and the gene expression messy genetic algorithm. Unclassified Report LA-UR96-60, Los Alamos National Laboratory, Los Alamos, NM, [6] H. Kargupta and S. Bandyopadhyay. Further experiments on the scalability of the GEMGA. Proceedings of the Parallel Problem Solving From Nature V, pages , [7] Naudts, B. and Suys, D. and Verschoren, A. Epistasis as a basic concept in formal landscape analysis In Proceedings of the Seventh International Conference on Genetic Algorithms, [8] Masaharu Munetomo and David E. Goldberg. Designing a genetic algorithm using the linkage identification by nonlinearity check. Technical Report IlliGAL Report No.98014, University of Illinois at Urbana-Champaign, [9] Masaharu Munetomo and David E. Goldberg. Identifying linkage by nonlinearity check. Technical Report IlliGAL Report No.98012, University of Illinois at Urbana-Champaign, [10] Masaharu Munetomo and David E. Goldberg. Identifying linkage groups by nonlinearity/nonmonotonicity detection. In Proceedings of the 1999 Genetic and Evolutionary Computation Conference, [11] Masaharu Munetomo and David E. Goldberg. Linkage identification by non-monotonicity detection for overlapping functions. Evolutionary Computation, 7(4), algorithm LIEM N = c*2^difficulty; P = initialize N strings; /* Calculate epistasis measure e[i][j] */ for i = 0 to l-1 for j = 0 to l-1 e[i][j] = 0; if i!= j then for each s in P s = perturb(s, i); f1 = fitness(s ) - fitness(s); s = perturb(s, j); f2 = fitness(s ) - fitness(s); s = perturb(s, j); f12 = fitness(s ) - fitness(s); ep[s] = f12 - (f1+f2) ; if(ep[s] > e[i][j]) then e[i][j] = ep[s]; endif /* Generate linkage group l[i][k] where k = 0, 1,..., difficulty-1 */ for i = 0 to l-1 for j = 0 to l-1 id[j] = j; sort e[i][j] with j by descendent order; /* select linkages */ for k = 0 to difficulty-1 if(e[i][k] > epsilon) l[i][k] = id[i][k]; else break; Figure 3: The Linkage Identification with Epistasis Measure
6 0 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : h(x) 2 h(x) h(x) 5 ˆ ˆ ˆ ˆ ˆ ˆ Œ ˆŠ ˆŽ ˆ Œ ŠŠ ŠŽ ˆ Œ ª ª ˆ ªŠ ªŠˆ ª ª ˆ ªˆ ªˆˆ ª ªˆ Figure 4: Results of the LIEM for test functions Figure 6: Epistasis measures for h(x) 2 ˆ ˆ ˆ ˆ Ž Œ ˆ ˆ Ž ˆ ˆŠ ˆ ˆ Œ Šˆ Š ŠŽ Š ª ª ˆ ªŠ ªŠˆ ª ª ˆ ªˆ ªˆˆ ª ªˆ Š ˆ ˆ Œ ˆŠ ˆŽ ˆ Œ ŠŠ ŠŽ ˆ Œ ª ª ˆ ªŠ ªŠˆ ª ª ˆ ªˆ ªˆˆ ª ªˆ Figure 5: Epistasis measures for h(x) Figure 7: Epistasis measures for h(x) 5
Interaction-Detection Metric with Differential Mutual Complement for Dependency Structure Matrix Genetic Algorithm
Interaction-Detection Metric with Differential Mutual Complement for Dependency Structure Matrix Genetic Algorithm Kai-Chun Fan Jui-Ting Lee Tian-Li Yu Tsung-Yu Ho TEIL Technical Report No. 2010005 April,
More informationUpper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions Matthew J. Streeter Computer Science Department and Center for the Neural Basis of Cognition Carnegie Mellon University
More informationScalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage Kumara Sastry 1,2 and David E. Goldberg 1,3 1 Illinois Genetic Algorithms Laboratory (IlliGAL) 2 Department of Material
More informationAnalysis of Epistasis Correlation on NK Landscapes with Nearest-Neighbor Interactions
Analysis of Epistasis Correlation on NK Landscapes with Nearest-Neighbor Interactions Martin Pelikan MEDAL Report No. 20102 February 2011 Abstract Epistasis correlation is a measure that estimates the
More informationEstimation-of-Distribution Algorithms. Discrete Domain.
Estimation-of-Distribution Algorithms. Discrete Domain. Petr Pošík Introduction to EDAs 2 Genetic Algorithms and Epistasis.....................................................................................
More informationSearch. Search is a key component of intelligent problem solving. Get closer to the goal if time is not enough
Search Search is a key component of intelligent problem solving Search can be used to Find a desired goal if time allows Get closer to the goal if time is not enough section 11 page 1 The size of the search
More informationNew Epistasis Measures for Detecting Independently Optimizable Partitions of Variables
New Epistasis Measures for Detecting Independently Optimizable Partitions of Variables Dong-Il Seo, Sung-Soon Choi, and Byung-Ro Moon School of Computer Science & Engineering, Seoul National University
More informationBehaviour of the UMDA c algorithm with truncation selection on monotone functions
Mannheim Business School Dept. of Logistics Technical Report 01/2005 Behaviour of the UMDA c algorithm with truncation selection on monotone functions Jörn Grahl, Stefan Minner, Franz Rothlauf Technical
More informationIntroduction to Walsh Analysis
Introduction to Walsh Analysis Alternative Views of the Genetic Algorithm R. Paul Wiegand paul@tesseract.org ECLab George Mason University EClab - Summer Lecture Series p.1/39 Outline of Discussion Part
More informationPerformance of Evolutionary Algorithms on NK Landscapes with Nearest Neighbor Interactions and Tunable Overlap
Performance of Evolutionary Algorithms on NK Landscapes with Nearest Neighbor Interactions and Tunable Overlap Martin Pelikan, Kumara Sastry, David E. Goldberg, Martin V. Butz, and Mark Hauschild Missouri
More informationState of the art in genetic algorithms' research
State of the art in genetic algorithms' Genetic Algorithms research Prabhas Chongstitvatana Department of computer engineering Chulalongkorn university A class of probabilistic search, inspired by natural
More informationEfficient Discretization Scheduling in Multiple Dimensions. Laura A. Albert and David E. Goldberg. IlliGAL Report No February 2002
Efficient Discretization Scheduling in Multiple Dimensions Laura A. Albert and David E. Goldberg IlliGAL Report No. 2002006 February 2002 Illinois Genetic Algorithms Laboratory University of Illinois at
More informationPopulation Genetics: a tutorial
: a tutorial Institute for Science and Technology Austria ThRaSh 2014 provides the basic mathematical foundation of evolutionary theory allows a better understanding of experiments allows the development
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 informationA Statistical Genetic Algorithm
A Statistical Genetic Algorithm Angel Kuri M. akm@pollux.cic.ipn.mx Centro de Investigación en Computación Instituto Politécnico Nacional Zacatenco México 07738, D.F. Abstract A Genetic Algorithm which
More informationAnalysis of Epistasis Correlation on NK Landscapes. Landscapes with Nearest Neighbor Interactions
Analysis of Epistasis Correlation on NK Landscapes with Nearest Neighbor Interactions Missouri Estimation of Distribution Algorithms Laboratory (MEDAL University of Missouri, St. Louis, MO http://medal.cs.umsl.edu/
More informationConvergence Time for Linkage Model Building in Estimation of Distribution Algorithms
Convergence Time for Linkage Model Building in Estimation of Distribution Algorithms Hau-Jiun Yang Tian-Li Yu TEIL Technical Report No. 2009003 January, 2009 Taiwan Evolutionary Intelligence Laboratory
More informationExploration of population fixed-points versus mutation rates for functions of unitation
Exploration of population fixed-points versus mutation rates for functions of unitation J Neal Richter 1, Alden Wright 2, John Paxton 1 1 Computer Science Department, Montana State University, 357 EPS,
More informationSpurious Dependencies and EDA Scalability
Spurious Dependencies and EDA Scalability Elizabeth Radetic, Martin Pelikan MEDAL Report No. 2010002 January 2010 Abstract Numerous studies have shown that advanced estimation of distribution algorithms
More informationFitness Inheritance in Multi-Objective Optimization
Fitness Inheritance in Multi-Objective Optimization Jian-Hung Chen David E. Goldberg Shinn-Ying Ho Kumara Sastry IlliGAL Report No. 2002017 June, 2002 Illinois Genetic Algorithms Laboratory (IlliGAL) Department
More informationGene Pool Recombination in Genetic Algorithms
Gene Pool Recombination in Genetic Algorithms Heinz Mühlenbein GMD 53754 St. Augustin Germany muehlenbein@gmd.de Hans-Michael Voigt T.U. Berlin 13355 Berlin Germany voigt@fb10.tu-berlin.de Abstract: A
More informationAnalyzing Probabilistic Models in Hierarchical BOA on Traps and Spin Glasses
Analyzing Probabilistic Models in Hierarchical BOA on Traps and Spin Glasses Mark Hauschild, Martin Pelikan, Claudio F. Lima, and Kumara Sastry IlliGAL Report No. 2007008 January 2007 Illinois Genetic
More informationAnalyzing Probabilistic Models in Hierarchical BOA on Traps and Spin Glasses
Analyzing Probabilistic Models in Hierarchical BOA on Traps and Spin Glasses Mark Hauschild Missouri Estimation of Distribution Algorithms Laboratory (MEDAL) Dept. of Math and Computer Science, 320 CCB
More informationTHE PROBLEM OF locating all the optima within a fitness
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 11, NO. 4, AUGUST 2007 453 Where Are the Niches? Dynamic Fitness Sharing Antonio Della Cioppa, Member, IEEE, Claudio De Stefano, and Angelo Marcelli,
More informationGENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS
GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS A genetic algorithm is a random search technique for global optimisation in a complex search space. It was originally inspired by an
More informationA Constructive Genetic Algorithm for Gate Matrix Layout Problems
A Constructive Genetic Algorithm for Gate Matrix Layout Problems Alexandre César Muniz de Oliveira DEINF - Universidade Federal do Maranhão Campus Bacanga, São Luís, MA, Brasil acmo@deinf.ufma.br Luiz
More informationProbability (Phi) Proportion BBs (Pbb) 1. Proportion BBs (Pbb) Pop Size (n) Pop Size (n)
THE POPULATION SIZING PROBLEM IN (P)GAS Zden»ek Konfr»st Department of Cybernetics, Czech Technical University Abstract One of interesting problems in genetic algorithms (GAs) is the population sizing
More informationRepresentation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle Crossover
Representation and Hidden Bias II: Eliminating Defining Length Bias in Genetic Search via Shuffle Crossover Abstract The traditional crossover operator used in genetic search exhibits a position-dependent
More informationA Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms
From: AAAI-98 Proceedings. Copyright 998, AAAI (www.aaai.org). All rights reserved. A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms Soraya Rana Robert B. Heckendorn Darrell
More informationOverview. Background
Overview Implementation of robust methods for locating quantitative trait loci in R Introduction to QTL mapping Andreas Baierl and Andreas Futschik Institute of Statistics and Decision Support Systems
More informationEvolving Presentations of Genetic Information: Motivation, Methods, and Analysis
Evolving Presentations of Genetic Information: Motivation, Methods, and Analysis Peter Lee Stanford University PO Box 14832 Stanford, CA 94309-4832 (650)497-6826 peterwlee@stanford.edu June 5, 2002 Abstract
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 informationComputational statistics
Computational statistics Combinatorial optimization Thierry Denœux February 2017 Thierry Denœux Computational statistics February 2017 1 / 37 Combinatorial optimization Assume we seek the maximum of f
More information1. Computação Evolutiva
1. Computação Evolutiva Renato Tinós Departamento de Computação e Matemática Fac. de Filosofia, Ciência e Letras de Ribeirão Preto Programa de Pós-Graduação Em Computação Aplicada 1.6. Aspectos Teóricos*
More informationAn introduction to basic information theory. Hampus Wessman
An introduction to basic information theory Hampus Wessman Abstract We give a short and simple introduction to basic information theory, by stripping away all the non-essentials. Theoretical bounds on
More informationThe Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan
The Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan ABSTRACT The genetic algorithm is an adaptive search method that has the ability for a smart search
More informationGenetic Algorithm. Outline
Genetic Algorithm 056: 166 Production Systems Shital Shah SPRING 2004 Outline Genetic Algorithm (GA) Applications Search space Step-by-step GA Mechanism Examples GA performance Other GA examples 1 Genetic
More informationLecture 3: Randomness in Computation
Great Ideas in Theoretical Computer Science Summer 2013 Lecture 3: Randomness in Computation Lecturer: Kurt Mehlhorn & He Sun Randomness is one of basic resources and appears everywhere. In computer science,
More informationCSC 4510 Machine Learning
10: Gene(c Algorithms CSC 4510 Machine Learning Dr. Mary Angela Papalaskari Department of CompuBng Sciences Villanova University Course website: www.csc.villanova.edu/~map/4510/ Slides of this presenta(on
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 informationV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
Part 5A: Genetic Algorithms V. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 1 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified
More informationInitial-Population Bias in the Univariate Estimation of Distribution Algorithm
Initial-Population Bias in the Univariate Estimation of Distribution Algorithm Martin Pelikan and Kumara Sastry MEDAL Report No. 9 January 9 Abstract This paper analyzes the effects of an initial-population
More informationV. Evolutionary Computing. Read Flake, ch. 20. Genetic Algorithms. Part 5A: Genetic Algorithms 4/10/17. A. Genetic Algorithms
V. Evolutionary Computing A. Genetic Algorithms 4/10/17 1 Read Flake, ch. 20 4/10/17 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model of genetics
More informationStructure Design of Neural Networks Using Genetic Algorithms
Structure Design of Neural Networks Using Genetic Algorithms Satoshi Mizuta Takashi Sato Demelo Lao Masami Ikeda Toshio Shimizu Department of Electronic and Information System Engineering, Faculty of Science
More informationEvolutionary Algorithms: Introduction. Department of Cybernetics, CTU Prague.
Evolutionary Algorithms: duction Jiří Kubaĺık Department of Cybernetics, CTU Prague http://cw.felk.cvut.cz/doku.php/courses/a4m33bia/start pcontents 1. duction to Evolutionary Algorithms (EAs) Pioneers
More informationIV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
IV. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 2014/2/26 1 2014/2/26 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model
More informationFitness distributions and GA hardness
Fitness distributions and GA hardness Yossi Borenstein and Riccardo Poli Department of Computer Science University of Essex Abstract. Considerable research effort has been spent in trying to formulate
More informationPermutation distance measures for memetic algorithms with population management
MIC2005: The Sixth Metaheuristics International Conference??-1 Permutation distance measures for memetic algorithms with population management Marc Sevaux Kenneth Sörensen University of Valenciennes, CNRS,
More informationHaploid & diploid recombination and their evolutionary impact
Haploid & diploid recombination and their evolutionary impact W. Garrett Mitchener College of Charleston Mathematics Department MitchenerG@cofc.edu http://mitchenerg.people.cofc.edu Introduction The basis
More informationLecture 20 Random Samples 0/ 13
0/ 13 One of the most important concepts in statistics is that of a random sample. The definition of a random sample is rather abstract. However it is critical to understand the idea behind the definition,
More informationLecture 9 and 10: Malicious Security - GMW Compiler and Cut and Choose, OT Extension
CS 294 Secure Computation February 16 and 18, 2016 Lecture 9 and 10: Malicious Security - GMW Compiler and Cut and Choose, OT Extension Instructor: Sanjam Garg Scribe: Alex Irpan 1 Overview Garbled circuits
More informationThe Genetic Algorithm is Useful to Fitting Input Probability Distributions for Simulation Models
The Genetic Algorithm is Useful to Fitting Input Probability Distributions for Simulation Models Johann Christoph Strelen Rheinische Friedrich Wilhelms Universität Bonn Römerstr. 164, 53117 Bonn, Germany
More informationAdaptive Generalized Crowding for Genetic Algorithms
Carnegie Mellon University From the SelectedWorks of Ole J Mengshoel Fall 24 Adaptive Generalized Crowding for Genetic Algorithms Ole J Mengshoel, Carnegie Mellon University Severinio Galan Antonio de
More informationAn Evolution Strategy for the Induction of Fuzzy Finite-state Automata
Journal of Mathematics and Statistics 2 (2): 386-390, 2006 ISSN 1549-3644 Science Publications, 2006 An Evolution Strategy for the Induction of Fuzzy Finite-state Automata 1,2 Mozhiwen and 1 Wanmin 1 College
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 informationAverage Case Complexity: Levin s Theory
Chapter 15 Average Case Complexity: Levin s Theory 1 needs more work Our study of complexity - NP-completeness, #P-completeness etc. thus far only concerned worst-case complexity. However, algorithms designers
More informationEvolutionary Computation. DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia)
Evolutionary Computation DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia) andrea.roli@unibo.it Evolutionary Computation Inspiring principle: theory of natural selection Species face
More informationFitness sharing and niching methods revisited
Fitness sharing and niching methods revisited Bruno Sareni, Laurent Krähenbühl To cite this version: Bruno Sareni, Laurent Krähenbühl. Fitness sharing and niching methods revisited. IEEE Transactions on
More informationBayesian Optimization Algorithm, Population Sizing, and Time to Convergence
Preprint UCRL-JC-137172 Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence M. Pelikan, D. E. Goldberg and E. Cantu-Paz This article was submitted to Genetic and Evolutionary Computation
More informationLocal Search & Optimization
Local Search & Optimization CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2017 Soleymani Artificial Intelligence: A Modern Approach, 3 rd Edition, Chapter 4 Outline
More informationHierarchical BOA, Cluster Exact Approximation, and Ising Spin Glasses
Hierarchical BOA, Cluster Exact Approximation, and Ising Spin Glasses Martin Pelikan 1, Alexander K. Hartmann 2, and Kumara Sastry 1 Dept. of Math and Computer Science, 320 CCB University of Missouri at
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 informationoptimization problem x opt = argmax f(x). Definition: Let p(x;t) denote the probability of x in the P population at generation t. Then p i (x i ;t) =
Wright's Equation and Evolutionary Computation H. Mühlenbein Th. Mahnig RWCP 1 Theoretical Foundation GMD 2 Laboratory D-53754 Sankt Augustin Germany muehlenbein@gmd.de http://ais.gmd.de/οmuehlen/ Abstract:
More informationIntroduction. Genetic Algorithm Theory. Overview of tutorial. The Simple Genetic Algorithm. Jonathan E. Rowe
Introduction Genetic Algorithm Theory Jonathan E. Rowe University of Birmingham, UK GECCO 2012 The theory of genetic algorithms is beginning to come together into a coherent framework. However, there are
More informationabout the problem can be used in order to enhance the estimation and subsequently improve convergence. New strings are generated according to the join
Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence Martin Pelikan Dept. of General Engineering and Dept. of Computer Science University of Illinois, Urbana, IL 61801 pelikan@illigal.ge.uiuc.edu
More informationA GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA Aviral Takkar Computer Engineering Department, Delhi Technological University( Formerly Delhi College of Engineering), Shahbad Daulatpur, Main Bawana Road,
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 informationFinding Robust Solutions to Dynamic Optimization Problems
Finding Robust Solutions to Dynamic Optimization Problems Haobo Fu 1, Bernhard Sendhoff, Ke Tang 3, and Xin Yao 1 1 CERCIA, School of Computer Science, University of Birmingham, UK Honda Research Institute
More informationFoundations of Machine Learning and Data Science. Lecturer: Avrim Blum Lecture 9: October 7, 2015
10-806 Foundations of Machine Learning and Data Science Lecturer: Avrim Blum Lecture 9: October 7, 2015 1 Computational Hardness of Learning Today we will talk about some computational hardness results
More informationLehmer Random Number Generators: Introduction
Lehmer Random Number Generators: Introduction Revised version of the slides based on the book Discrete-Event Simulation: a first course LL Leemis & SK Park Section(s) 21, 22 c 2006 Pearson Ed, Inc 0-13-142917-5
More informationWhat Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation Stephanie Forrest Dept. of Computer Science University of New Mexico Albuquerque, N.M. 87131-1386 Email:
More informationThe Decision List Machine
The Decision List Machine Marina Sokolova SITE, University of Ottawa Ottawa, Ont. Canada,K1N-6N5 sokolova@site.uottawa.ca Nathalie Japkowicz SITE, University of Ottawa Ottawa, Ont. Canada,K1N-6N5 nat@site.uottawa.ca
More informationEntanglement and information
Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit
More information1618. Dynamic characteristics analysis and optimization for lateral plates of the vibration screen
1618. Dynamic characteristics analysis and optimization for lateral plates of the vibration screen Ning Zhou Key Laboratory of Digital Medical Engineering of Hebei Province, College of Electronic and Information
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 informationTutorial: Device-independent random number generation. Roger Colbeck University of York
Tutorial: Device-independent random number generation Roger Colbeck University of York Outline Brief motivation of random number generation Discuss what we mean by a random number Discuss some ways of
More information6.842 Randomness and Computation Lecture 5
6.842 Randomness and Computation 2012-02-22 Lecture 5 Lecturer: Ronitt Rubinfeld Scribe: Michael Forbes 1 Overview Today we will define the notion of a pairwise independent hash function, and discuss its
More informationResearch Article A Novel Differential Evolution Invasive Weed Optimization Algorithm for Solving Nonlinear Equations Systems
Journal of Applied Mathematics Volume 2013, Article ID 757391, 18 pages http://dx.doi.org/10.1155/2013/757391 Research Article A Novel Differential Evolution Invasive Weed Optimization for Solving Nonlinear
More informationComputational Aspects of Aggregation in Biological Systems
Computational Aspects of Aggregation in Biological Systems Vladik Kreinovich and Max Shpak University of Texas at El Paso, El Paso, TX 79968, USA vladik@utep.edu, mshpak@utep.edu Summary. Many biologically
More informationEvolutionary Algorithms: Introduction. The Czech Institute of Informatics, Robotics and Cybernetics CTU Prague
: Introduction Jiří Kubaĺık The Czech Institute of Informatics, Robotics and Cybernetics CTU Prague http://cw.felk.cvut.cz/doku.php/courses/a0m33eoa/start pcontents Representation Operators Population
More informationHaploid-Diploid Algorithms
Haploid-Diploid Algorithms Larry Bull Department of Computer Science & Creative Technologies University of the West of England Bristol BS16 1QY, U.K. +44 (0)117 3283161 Larry.Bull@uwe.ac.uk LETTER Abstract
More informationThe function graphed below is continuous everywhere. The function graphed below is NOT continuous everywhere, it is discontinuous at x 2 and
Section 1.4 Continuity A function is a continuous at a point if its graph has no gaps, holes, breaks or jumps at that point. If a function is not continuous at a point, then we say it is discontinuous
More informationDesigner Genetic Algorithms: Genetic Algorithms in Structure Design. Inputs. C 0 A0 B0 A1 B1.. An Bn
A B C Sum Carry Carry Designer Genetic Algorithms: Genetic Algorithms in Structure Design Sushil J. Louis Department of Computer Science Indiana University, Bloomington, IN 47405 louis@iuvax.cs.indiana.edu
More informationRobust Multi-Objective Optimization in High Dimensional Spaces
Robust Multi-Objective Optimization in High Dimensional Spaces André Sülflow, Nicole Drechsler, and Rolf Drechsler Institute of Computer Science University of Bremen 28359 Bremen, Germany {suelflow,nd,drechsle}@informatik.uni-bremen.de
More informationBounding the Population Size in XCS to Ensure Reproductive Opportunities
Bounding the Population Size in XCS to Ensure Reproductive Opportunities Martin V. Butz and David E. Goldberg Illinois Genetic Algorithms Laboratory (IlliGAL) University of Illinois at Urbana-Champaign
More informationPengju
Introduction to AI Chapter04 Beyond Classical Search Pengju Ren@IAIR Outline Steepest Descent (Hill-climbing) Simulated Annealing Evolutionary Computation Non-deterministic Actions And-OR search Partial
More informationA Probabilistic Upper Bound on Differential Entropy
A Probabilistic Upper on ifferential Joseph estefano Member IEEE and Erik Learned-Miller Abstract A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution,
More informationc Copyright by Martin Pelikan, 2002
c Copyright by Martin Pelikan, 2002 BAYESIAN OPTIMIZATION ALGORITHM: FROM SINGLE LEVEL TO HIERARCHY BY MARTIN PELIKAN DIPL., Comenius University, 1998 THESIS Submitted in partial fulfillment of the requirements
More informationEvolutionary Computation
Evolutionary Computation - Computational procedures patterned after biological evolution. - Search procedure that probabilistically applies search operators to set of points in the search space. - Lamarck
More informationHierarchical BOA Solves Ising Spin Glasses and MAXSAT
Hierarchical BOA Solves Ising Spin Glasses and MAXSAT Martin Pelikan 1,2 and David E. Goldberg 2 1 Computational Laboratory (Colab) Swiss Federal Institute of Technology (ETH) Hirschengraben 84 8092 Zürich,
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 5 Nonlinear Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction
More informationClass Note #20. In today s class, the following four concepts were introduced: decision
Class Note #20 Date: 03/29/2006 [Overall Information] In today s class, the following four concepts were introduced: decision version of a problem, formal language, P and NP. We also discussed the relationship
More information10.3 Matroids and approximation
10.3 Matroids and approximation 137 10.3 Matroids and approximation Given a family F of subsets of some finite set X, called the ground-set, and a weight function assigning each element x X a non-negative
More informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More informationInferring the Causal Decomposition under the Presence of Deterministic Relations.
Inferring the Causal Decomposition under the Presence of Deterministic Relations. Jan Lemeire 1,2, Stijn Meganck 1,2, Francesco Cartella 1, Tingting Liu 1 and Alexander Statnikov 3 1-ETRO Department, Vrije
More informationDetection of signal transitions by order statistics filtering
Detection of signal transitions by order statistics filtering A. Raji Images, Signals and Intelligent Systems Laboratory Paris-Est Creteil University, France Abstract In this article, we present a non
More informationEvolutionary computation
Evolutionary computation Andrea Roli andrea.roli@unibo.it DEIS Alma Mater Studiorum Università di Bologna Evolutionary computation p. 1 Evolutionary Computation Evolutionary computation p. 2 Evolutionary
More informationLecture 5: Efficient PAC Learning. 1 Consistent Learning: a Bound on Sample Complexity
Universität zu Lübeck Institut für Theoretische Informatik Lecture notes on Knowledge-Based and Learning Systems by Maciej Liśkiewicz Lecture 5: Efficient PAC Learning 1 Consistent Learning: a Bound on
More informationOn the Complete Monotonicity of Heat Equation
[Pop-up Salon, Maths, SJTU, 2019/01/10] On the Complete Monotonicity of Heat Equation Fan Cheng John Hopcroft Center Computer Science and Engineering Shanghai Jiao Tong University chengfan@sjtu.edu.cn
More informationAdvanced Optimization
Advanced Optimization Lecture 3: 1: Randomized Algorithms for for Continuous Discrete Problems Problems November 22, 2016 Master AIC Université Paris-Saclay, Orsay, France Anne Auger INRIA Saclay Ile-de-France
More information