A natural approach to studying schema processing
Jack McKay Fletcher, Thomas Wennekers

TL;DR
This paper introduces a mathematical method to identify all schemata in a GA population, revealing insights into schema processing, the BBH, and how crossover methods combine building blocks, supported by theoretical and experimental analysis.
Contribution
It presents a novel mathematical approach to fully identify schemata in GAs, enabling detailed study of schema processing and the BBH.
Findings
Approximately 25-35% of building blocks result from crossover.
Increasing building block combination does not improve GA efficiency.
The search space for good schemata forms a complete lattice.
Abstract
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 GAs building blocks are semi-theoretical objects in that they are thought only to be implicitly exploited via the selection and crossover operations of a GA. In the current work, we discover a mathematical method to identify the complete set of schemata present in a given population of a GA; as such a natural way to study schema processing (and thus the BBH) is revealed. We demonstrate how this approach can be used both theoretically and experimentally. Theoretically, we show that the search space for good schemata is a complete lattice and that each generation samples a complete sub-lattice of this search space. In addition, we show that combining…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Natural Language Processing Techniques · Web Data Mining and Analysis
