~/talk

Presentation of Evolution and Algorithms

Talkat Computational Theories of Evolution · 2014-03-17..03-21
links:none on file
links:none on file
slides:none on file

Shows that standard population genetics under weak selection implements the multiplicative weights update: allele frequencies follow the MW equations, so expected fitness improves while trading off entropy, and regret to the best “expert” is about 1/sqrt(T). Gives specific scaling: Kimura-style information accrues ~C per generation and adaptations plausibly occur every ~300–400 generations. Proves a complexity claim for random pairwise-interaction fitness landscapes: PLS-hard: exponential convergence (even infinite populations need exponential time or size to fix local optima).

AI-written summary · about

  1. 0:00Introduction to the topic
  2. 1:34Algorithms and complexity
  3. 7:15The experts problem
  4. 17:30Evolutionary heuristics
  5. 24:01The role of sex in evolution
  6. 32:29Evolution as an algorithm
  7. 50:55Computational complexity limits
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.