DeepAI AI Chat
Log In Sign Up

Overcoming Complexity Catastrophe: An Algorithm for Beneficial Far-Reaching Adaptation under High Complexity

by   Sasanka Sekhar Chanda, et al.

In his seminal work with NK algorithms, Kauffman noted that fitness outcomes from algorithms navigating an NK landscape show a sharp decline at high complexity arising from pervasive interdependence among problem dimensions. This phenomenon - where complexity effects dominate (Darwinian) adaptation efforts - is called complexity catastrophe. We present an algorithm - incremental change taking turns (ICTT) - that finds distant configurations having fitness superior to that reported in extant research, under high complexity. Thus, complexity catastrophe is not inevitable: a series of incremental changes can lead to excellent outcomes.


page 1

page 2

page 3

page 4


An Algorithm to find Superior Fitness on NK Landscapes under High Complexity: Muddling Through

Under high complexity - given by pervasive interdependence between const...

Toward a fitness landscape model of firms' IT-enabled dynamic capabilities

This chapter presents, extends and integrates a complexity science persp...

Complexity of evolutionary equilibria in static fitness landscapes

A fitness landscape is a genetic space -- with two genotypes adjacent if...

An Algorithm to Effect Prompt Termination of Myopic Local Search on Kauffman-s NK Landscape

In the NK model given by Kauffman, myopic local search involves flipping...

HPO: We won't get fooled again

Hyperparameter optimization (HPO) is a well-studied research field. Howe...

Sub-Structural Niching in Non-Stationary Environments

Niching enables a genetic algorithm (GA) to maintain diversity in a popu...

On the Workings of Genetic Algorithms: The Genoclique Fixing Hypothesis

We recently reported that the simple genetic algorithm (SGA) is capable ...