The Blessing and the Curse of Multiplicative Updates
summary
Multiplicative updates multiply nonnegative weights and recover Bayes via prior×likelihood, implemented physically with 10^20 strands in in vitro selection using PCR amplification; raw multiplicative dynamics give exponential growth but wipe out diversity so one strand wins. Proven fixes include conservative/Winnow thresholding (blind selection with sample-based dot products, bound ≈ k·log(n/k)), mix in 1% uniform to preserve a lower-bound, capping to create exponentially many corners, and a two-cup cross-pouring protocol that produces long-term memory and works empirically in simulated tube experiments.
AI-written summary · about
chapters (31)
- 0:00Intro
- 0:37Definition of multiplicative updates
- 1:19Machine learning vs nature
- 6:11Basic scheme
- 6:52Duplicating DNA with PCR
- 8:46The caveat
- 9:19Mathematical description of in-vitro selection
- 11:28Update Good RNA in tubes
- 12:33Implementing Bayes rule in RNA
- 13:34Iterating Bayes Rule with same data likelihoods
- 15:07The best are too good
- 15:57View of evolution
- 16:43Another tube experiment
- 18:33Boundaries prevent the curse
- 18:55A first key problem
- 20:41Solution
- 25:25Nature 2: Coupling preserves diversity
- 25:55A second problem
- 27:39Key problem 2
- 29:04Related machine learning problem
- 31:05Normalized Winnow Algorithm (N. Littlestone)
- 34:42ML 1: prevent overtraining with conservative update
- 35:38Super predator
- 35:54cap weights
- 36:20Why capping?
- 37:45What if environment changes over time
- 38:27Disk spindown problem
- 47:27ML 4: sleeping
- 48:11Blind in-vitro implementation of sleeping
- 50:12Summary
- 50:46Final question
