PofoliaShared via Pofolia

Proceedings of the National Academy of Sciences· 2026Q1

The efficiency of information gain by natural selection

Ryan Seamus McGee, Olivia Kosterlitz, Artem Kaznatcheev, Benjamin Kerr et al.

Short summary

A new model using computational learning theory shows natural selection is an asymptotically optimal algorithm that efficiently acquires information about environments, outperforming comparable processes in complex settings.

AI-generated from the title and abstract; the full text is not read.

Key points

  • Natural selection can be viewed as a learning process that accumulates information about environmental conditions.
  • A new model, using computational learning theory's concept of regret, quantifies selection's inefficiency in terms of relative lineage fitness.
  • The model establishes bounds on information gain efficiency applicable to frequency-dependent selection and arbitrary environmental change.
  • Selection is shown to be an asymptotically optimal algorithm, acquiring information more efficiently than comparable processes in complex environments.

AI-generated from the title and abstract; the full text is not read.

Abstract

Natural selection enriches populations for genotypes that are well adapted to their environments, accumulating information about the selective conditions in the process. Therefore, selection can be viewed as a learning process through which populations acquire information about the environment. Motoo Kimura derived a relationship between the amount of information gained by selection and a measure of the inefficiency of the selective process, known as substitution load [M. Kimura, Genet. Res. 2, 127–140 (1961)]. Due to the gradual nature of selection and the ongoing mismatch of types to the environment, a lineage that is still acquiring information has lower mean fitness than a lineage that already has it. While this has been an influential insight, we find that Kimura’s model is inconsistent with selection experiments involving Escherichia coli . To address limitations in this model and develop a more robust measure for the efficiency of selection, we turn to computational learning theory. We show that the learning-theoretic concept of regret quantifies the inefficiency of selection as a learning process in terms of relative lineage fitness. We establish bounds on the efficiency of information gain in general settings, including frequency-dependent selection and arbitrary environmental change. We experimentally validate these bounds and demonstrate that our extended theory recovers Kimura’s fundamental insight. Finally, we show that selection is an asymptotically optimal algorithm for the basic problem faced by evolving populations and that it acquires information more efficiently than comparable processes in complex environments.

The authors' abstract, as published at the source. Proceedings of the National Academy of Sciences, 2026 · DOI ↗

TakeawaysPremium
Ask the paperFree account

Continue with a free account

Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.

Continue free on the web

Sign in with Google or Apple; no card needed. You come back to this paper.

On your phone:

Field: Genetics (Biochemistry, Genetics and Molecular Biology)

GeneticsBiochemistry, Genetics and Molecular Biology