Skip to content
Last Dictionary

fitness function

nounAlso: fitness, fitness landscape, fitness score

In plain wordsIn evolution-inspired computing, the scoring rule that says how good each candidate solution is, which decides which candidates survive and get to 'reproduce'.

  1. In evolutionary computationevolutionary computation, n.: Problem-solving by simulated evolution, much as breeders improve crops: keep many candidate answers, let the better ones produce slightly altered offspring, drop the worse, and repeat for many rounds., the function that assigns each candidate solution a score of its quality, determining its chance of being selected for reproduction; it plays the role of the objective functionobjective function, n.: The score that an optimization process tries to push as low, or as high, as possible. For an AI, it defines what 'doing well' means during training. in optimization or of the rewardreward, n.: The score an AI system receives after an action, telling it how good the outcome was. Reinforcement learning trains the system to collect as much reward as possible over time. in reinforcement learningreinforcement learning, n.: A way of teaching a computer program by trial and error: it tries actions, earns points for good results and penalties for bad ones, and gradually learns which choices pay off over time.. Fitness may be computed analytically, by simulation, by physical experiment or by human judgment (interactive evolution), and is often the most expensive part of the algorithm, which motivates cheap surrogate models. The fitness landscape — fitness viewed as a surface over the space of solutions — frames search difficulty in terms of peaks, plateaus, ruggedness and deception. A poorly specified fitness function gets exploited in unintended ways, a long-documented failure that is an early form of specification gamingspecification gaming, n.: When an AI meets the letter of its goal while defeating its purpose, like a genie who grants exactly the words of a wish instead of what the wisher meant..

    The robots learned to flip over and crawl on their elbows, which our fitness function happened to reward.

Origin

Borrowed from evolutionary biology, where fitness measures reproductive success; Sewall Wright introduced the fitness (adaptive) landscape in 1932. The term was standard in genetic-algorithm research by the 1970s, following John Holland.

Usage note

Joel Lehman, Jeff Clune and dozens of colleagues collected anecdotes of evolved solutions that exploited bugs or loopholes in fitness functions; the collection is widely cited in AI-safety discussions of reward hacking.

Related

See also
  • genetic algorithmgenetic algorithm, n.: A problem-solving method that copies natural evolution: many candidate solutions compete, the best are 'bred' by mixing and randomly tweaking them, and over many generations the solutions improve.
  • evolutionary computationevolutionary computation, n.: Problem-solving by simulated evolution, much as breeders improve crops: keep many candidate answers, let the better ones produce slightly altered offspring, drop the worse, and repeat for many rounds.
  • objective functionobjective function, n.: The score that an optimization process tries to push as low, or as high, as possible. For an AI, it defines what 'doing well' means during training.
  • rewardreward, n.: The score an AI system receives after an action, telling it how good the outcome was. Reinforcement learning trains the system to collect as much reward as possible over time.
  • specification gamingspecification gaming, n.: When an AI meets the letter of its goal while defeating its purpose, like a genie who grants exactly the words of a wish instead of what the wisher meant.
  • quality diversityquality diversity, n.: A family of evolution-inspired search methods that aim to collect many different good solutions — for example, many distinct ways for a robot to walk — rather than a single best one.

Sources

  1. Lehman, J. et al. (2020). The Surprising Creativity of Digital Evolution: A Collection of Anecdotes from the Evolutionary Computation and Artificial Life Research Communities. Artificial Life 26(2), 274–306.

Mentioned in

evolutionary computationevolutionary computation, n.: Problem-solving by simulated evolution, much as breeders improve crops: keep many candidate answers, let the better ones produce slightly altered offspring, drop the worse, and repeat for many rounds., genetic algorithmgenetic algorithm, n.: A problem-solving method that copies natural evolution: many candidate solutions compete, the best are 'bred' by mixing and randomly tweaking them, and over many generations the solutions improve., genetic programminggenetic programming, n.: Using simulated evolution to write computer programs: random programs compete at a task, and the best are combined and mutated over many generations until one does the task well.