Related papers: Schemata as Building Blocks: Does Size Matter?

In the light of a recently derived evolution equation for genetic algorithms we consider the schema theorem and the building block hypothesis. We derive a schema theorem based on the concept of effective fitness showing that schemata of…

An evolution equation for a population of strings evolving under the genetic operators: selection, mutation and crossover is derived. The corresponding equation describing the evolution of schematas is found by performing an exact coarse…

The concept of fitness is introduced, and a simple derivation of the Fundamental Theorem of Natural Selection (which states that the average fitness of a population increases if its variance is nonzero) is given. After a short discussion of…

Metabolism and evolution are closely connected: if a mutation incurs extra energetic costs for an organism, there is a baseline selective disadvantage that may or may not be compensated for by other adaptive effects. A long-standing, but to…

In this paper, we discuss the fitness landscape evolution of permanent replicator systems using a hypothesis that the specific time of evolutionary adaptation of the system parameters is much slower than the time of internal evolutionary…

We investigate the evolutionary dynamics of an idealised model for the robust self-assembly of two-dimensional structures called polyominoes. The model includes rules that encode interactions between sets of square tiles that drive the…

We present an empirical study in the geometric task of learning interatomic potentials, which shows equivariance matters even more at larger scales; we show a clear power-law scaling behaviour with respect to data, parameters and compute…

The Building Block Hypothesis (BBH) states that adaptive systems combine good partial solutions (so-called building blocks) to find increasingly better solutions. It is thought that Genetic Algorithms (GAs) implement the BBH. However, for…

We study size-based schedulers, and focus on the impact of inaccurate job size information on response time and fairness. Our intent is to revisit previous results, which allude to performance degradation for even small errors on job size…

Whether or not cooperation is favored over defection in evolutionary games can be assigned by structure coefficients for any arrangement of cooperators and defectors on any network modeled as a regular graph. We study how these structure…

Skepticism of the building block hypothesis (BBH) has previously been expressed on account of the weak theoretical foundations of this hypothesis and the anomalies in the empirical record of the simple genetic algorithm. In this paper we…

A schema is a naturally defined subset of the space of fixed-length binary strings. The Holland Schema Theorem gives a lower bound on the expected fraction of a population in a schema after one generation of a simple genetic algorithm. This…

In order to accommodate the empirical fact that population structures are rarely simple, modern studies of evolutionary dynamics allow for complicated and highly-heterogeneous spatial structures. As a result, one of the most difficult…

The pace of progress in the fields of Evolutionary Computation and Machine Learning is currently limited -- in the former field, by the improbability of making advantageous extensions to evolutionary algorithms when their capacity for…

We present convincing empirical evidence for an effective and general strategy for building accurate small models. Such models are attractive for interpretability and also find use in resource-constrained environments. The strategy is to…

Darwinian evolution can be illustrated as an uphill walk in a landscape, where the surface consists of genotypes, the height coordinates represent fitness, and each step corresponds to a point mutation. Epistasis, roughly defined as the…

Proof schemata are infinite sequences of proofs which are defined inductively. In this paper we present a general framework for schemata of terms, formulas and unifiers and define a resolution calculus for schemata of quantifier-free…

This paper studies fitness inheritance as an efficiency enhancement technique for a class of competent genetic algorithms called estimation distribution algorithms. Probabilistic models of important sub-solutions are developed to estimate…

This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…

Given large datasets and sufficient compute, is it beneficial to design neural architectures for the structure and symmetries of each problem? Or is it more efficient to learn them from data? We study empirically how equivariant and…