MethodsStatistical physics (Monte Carlo optimisation)Population-annealed EM for the lattice key, compared with independent restarts
Method · statistical physics (Monte Carlo optimisation)
Population-annealed EM for the lattice key, compared with independent restarts
Problem Track A can't solve with restarts: the diagnostic run on the planted control shows EM started from the true key reaches a higher likelihood than any random restart (one sign per letter: -40,505 against -41,315; full setting: -53,462 against -53,957), so the failure is in the search, not the model. Lasry-style annealing and random restarts don't reach that basin.
Questions it answers
Code Python
Runs and results 3 runs
Applied to
4 datasetsHerbal A and Herbal B paragraph text: training and held-out pages, Latin genre texts, Naibbe cipher tables and example plaintexts (greshko/naibbe-cipher, commit 719f2f4c), ZL3b transcription
References
- Journal of the Physical Society of Japan 65(6): 1604-1608 (J-STAGE page checked). Parallel tempering (replica exchange). Track B candidate key search to compare with Lasry-style annealing.
- Neural Networks 11(2): 271-282 (bibliographic record with DOI checked on researchr.org). EM with the posterior computed from p(x, z) raised to a power beta that rises to 1, to escape poor local optima. Used in T41 generation 4 after the diagnostic showed the true key's basin has higher likelihood than any random restart.
- arXiv:1006.0252 (abstract page checked; journal reference not confirmed here). Population annealing: a population of states is annealed through a temperature ladder and resampled by Boltzmann weights at each step. Track B fresh idea in T41 generation 4, compared with independent restarts.