A tractable Walsh analysis of SAT and its implications for genetic algorithms
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Schemata, Distributions and Graphical Models in Evolutionary Optimization
Journal of Heuristics
Evolutionary Computation
RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Walsh analysis, epistasis, and optimization problem difficulty for evolutionary algorithms
Walsh analysis, epistasis, and optimization problem difficulty for evolutionary algorithms
Gene Expression and Fast Construction of Distributed Evolutionary Representation
Evolutionary Computation
Linkage identification based on epistasis measures to realize efficient genetic algorithms
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Predicting epistasis from mathematical models
Evolutionary Computation
The gambler's ruin problem, genetic algorithms, and the sizing of populations
Evolutionary Computation
Linkage identification by non-monotonicity detection for overlapping functions
Evolutionary Computation
Tightness time for the linkage learning genetic algorithm
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Computing the epistasis variance of large-scale traveling salesman problems
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Compact representations as a search strategy: compression EDAs
Theoretical Computer Science - Foundations of genetic algorithms
Nonlinearity linkage detection for financial time series analysis
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Extended probe method for linkage discovery over high-cardinality alphabets
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Detecting the epistatic structure of generalized embedded landscape
Genetic Programming and Evolvable Machines
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
An application of a multivariate estimation of distribution algorithm to cancer chemotherapy
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Lower and upper bounds for linkage discovery
IEEE Transactions on Evolutionary Computation
Structure learning and optimisation in a Markov-network based estimation of distribution algorithm
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Optimal query complexity bounds for finding graphs
Artificial Intelligence
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A multi-objective window optimisation problem
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
Generalized embedded landscape and its decomposed representation
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Compact genetic codes as a search strategy of evolutionary processes
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
| Hi-index | 0.00 |
This paper addresses the problem of discovering the structure of a fitness function from binary strings to the reals under the assumption of bounded epistasis. Two loci (string positions) are epistatically linked if the effect of changing the allele (value) at one locus depends on the allele at the other locus. Similarly, a group of loci are epistatically linked if the effect of changing the allele at one locus depends on the alleles at all other loci of the group. Under the assumption that the size of such groups of loci are bounded, and assuming that the function is given only as a "black box function", this paper presents and analyzes a randomized algorithm that finds the complete epistatic structure of the function in the form of the Walsh coefficients of the function.