Credit Assignment in Adaptive Evolutionary Algorithms

In this paper, a new method for assigning credit to search\ud operators is presented. Starting with the principle of optimizing\ud search bias, search operators are selected based on an ability to\ud create solutions that are historically linked to future generations.\ud Using a novel framework for defining performance\ud measurements, distributing credit for performance, and the\ud statistical interpretation of this credit, a new adaptive method is\ud developed and shown to outperform a variety of adaptive and\ud non-adaptive competitors

The asexual genome of Drosophila

The rate of recombination affects the mode of molecular evolution. In high-recombining sequence, the targets of selection are individual genetic loci; under low recombination, selection collectively acts on large, genetically linked genomic segments. Selection under linkage can induce clonal interference, a specific mode of evolution by competition of genetic clades within a population. This mode is well known in asexually evolving microbes, but has not been traced systematically in an obligate sexual organism. Here we show that the Drosophila genome is partitioned into two modes of evolution: a local interference regime with limited effects of genetic linkage, and an interference condensate with clonal competition. We map these modes by differences in mutation frequency spectra, and we show that the transition between them occurs at a threshold recombination rate that is predictable from genomic summary statistics. We find the interference condensate in segments of low-recombining sequence that are located primarily in chromosomal regions flanking the centromeres and cover about 20% of the Drosophila genome. Condensate regions have characteristics of asexual evolution that impact gene function: the efficacy of selection and the speed of evolution are lower and the genetic load is higher than in regions of local interference. Our results suggest that multicellular eukaryotes can harbor heterogeneous modes and tempi of evolution within one genome. We argue that this variation generates selection on genome architecture

Sex Differences in Recombination in Sticklebacks.

Recombination often differs markedly between males and females. Here we present the first analysis of sex-specific recombination in Gasterosteus sticklebacks. Using whole-genome sequencing of 15 crosses between G. aculeatus and G. nipponicus, we localized 698 crossovers with a median resolution of 2.3 kb. We also used a bioinformatic approach to infer historical sex-averaged recombination patterns for both species. Recombination is greater in females than males on all chromosomes, and overall map length is 1.64 times longer in females. The locations of crossovers differ strikingly between sexes. Crossovers cluster toward chromosome ends in males, but are distributed more evenly across chromosomes in females. Suppression of recombination near the centromeres in males causes crossovers to cluster at the ends of long arms in acrocentric chromosomes, and greatly reduces crossing over on short arms. The effect of centromeres on recombination is much weaker in females. Genomic differentiation between G. aculeatus and G. nipponicus is strongly correlated with recombination rate, and patterns of differentiation along chromosomes are strongly influenced by male-specific telomere and centromere effects. We found no evidence for fine-scale correlations between recombination and local gene content in either sex. We discuss hypotheses for the origin of sexual dimorphism in recombination and its consequences for sexually antagonistic selection and sex chromosome evolution

Adaptive crossover in genetic algorithms using statistics mechanism

The final published version of this article is available at the link below. Copyright @ MIT Press.Genetic Algorithms (GAs) emulate the natural evolution process and maintain a popilation of potential solutions to a given problem. Through the population, GAs implicitly maintain the statistics about the search space. This implicit statistics can be used explicitly to enhance GA's performance. Inspired by this idea, a statistics-based adaptive non-uniform crossover (SANUX) has been proposed. SANUX uses the statisics information of the alleles in each locus to adaptively caluclate the swapping probability of that locus for crossover operation. A simple triangular function has been used to calculate the swapping probability. In this paper new functions, the trapezoid and exponential functions, are proposed for SANUX instead of the triangular function. Experiment results show that both functions further improve the performance of SANUX

An incremental approach to genetic algorithms based classification

Incremental learning has been widely addressed in the machine learning literature to cope with learning tasks where the learning environment is ever changing or training samples become available over time. However, most research work explores incremental learning with statistical algorithms or neural networks, rather than evolutionary algorithms. The work in this paper employs genetic algorithms (GAs) as basic learning algorithms for incremental learning within one or more classifier agents in a multi-agent environment. Four new approaches with different initialization schemes are proposed. They keep the old solutions and use an “integration” operation to integrate them with new elements to accommodate new attributes, while biased mutation and crossover operations are adopted to further evolve a reinforced solution. The simulation results on benchmark classification data sets show that the proposed approaches can deal with the arrival of new input attributes and integrate them with the original input space. It is also shown that the proposed approaches can be successfully used for incremental learning and improve classification rates as compared to the retraining GA. Possible applications for continuous incremental training and feature selection are also discussed