The Fundamental Learning Problem that Genetic Algorithms with Uniform Crossover Solve Efficiently and Repeatedly As Evolution Proceeds

07/15/2013
by   Keki M. Burjorjee, et al.
0

This paper establishes theoretical bonafides for implicit concurrent multivariate effect evaluation--implicit concurrency for short---a broad and versatile computational learning efficiency thought to underlie general-purpose, non-local, noise-tolerant optimization in genetic algorithms with uniform crossover (UGAs). We demonstrate that implicit concurrency is indeed a form of efficient learning by showing that it can be used to obtain close-to-optimal bounds on the time and queries required to approximately correctly solve a constrained version (k=7, η=1/5) of a recognizable computational learning problem: learning parities with noisy membership queries. We argue that a UGA that treats the noisy membership query oracle as a fitness function can be straightforwardly used to approximately correctly learn the essential attributes in O(log^1.585 n) queries and O(n log^1.585 n) time, where n is the total number of attributes. Our proof relies on an accessible symmetry argument and the use of statistical hypothesis testing to reject a global null hypothesis at the 10^-100 level of significance. It is, to the best of our knowledge, the first relatively rigorous identification of efficient computational learning in an evolutionary algorithm on a non-trivial learning problem.

READ FULL TEXT
research
05/15/2009

On the Workings of Genetic Algorithms: The Genoclique Fixing Hypothesis

We recently reported that the simple genetic algorithm (SGA) is capable ...
research
04/16/2012

Explaining Adaptation in Genetic Algorithms With Uniform Crossover: The Hyperclimbing Hypothesis

The hyperclimbing hypothesis is a hypothetical explanation for adaptatio...
research
02/21/2022

Learning Low Degree Hypergraphs

We study the problem of learning a hypergraph via edge detecting queries...
research
09/07/2019

Hard properties with (very) short PCPPs and their applications

We show that there exist properties that are maximally hard for testing,...
research
04/19/2017

Noise-Tolerant Interactive Learning from Pairwise Comparisons

We study the problem of interactively learning a binary classifier using...
research
03/17/2023

Stat-weight: Improving the Estimator of Interleaved Methods Outcomes with Statistical Hypothesis Testing

Interleaving is an online evaluation approach for information retrieval ...
research
11/01/2021

Provably efficient, succinct, and precise explanations

We consider the problem of explaining the predictions of an arbitrary bl...

Please sign up or login with your details

Forgot password? Click here to reset