In order to analyze and extract different structural properties of distribu- tions, one can introduce different coordinate systems over the manifold of distributions. In Evolutionary Computation, the Walsh bases and the Building Block Bases are often used to describe populations, which simplifies the analysis of evolutionary operators applying on populations. Quite independent from these approaches, information geometry has been de- veloped as a geometric way to analyze different order dependencies between random variables (e.g., neural activations or genes). In these notes I briefly review the essentials of various coordinate bases and of information geometry. The goal is to give an overview and make the approaches comparable. Besides introducing meaningful coordinate bases, information geometry also offers an explicit way to distinguish different order interactions and it offers a geometric view on the manifold and thereby also on operators that apply on the manifold. For instance, uniform crossover can be interpreted as an orthogonal projection of a population along an m-geodesic, monotonously reducing the �-coordinates that describe interactions between genes.
[1]
Sami Khuri,et al.
Walsh and Haar functions in genetic algorithms
,
1994,
SAC '94.
[2]
Shun-ichi Amari,et al.
Information geometry on hierarchy of probability distributions
,
2001,
IEEE Trans. Inf. Theory.
[3]
Marc Toussaint,et al.
The Structure of Evolutionary Exploration: On Crossover, Buildings Blocks, and Estimation-Of-Distribution Algorithms
,
2002,
GECCO.
[4]
Alden H. Wright,et al.
An Estimation of Distribution Algorithm Based on Maximum Entropy
,
2004,
GECCO.
[5]
Christopher G. Langton,et al.
Computation at the edge of chaos: Phase transitions and emergent computation
,
1990
.
[6]
Olaf Sporns,et al.
Classes of network connectivity and dynamics
,
2001,
Complex..
[7]
Christopher R. Stephens,et al.
What Basis for Genetic Dynamics?
,
2004,
GECCO.