Former DeepMind dev: the 'lookup table' that beat Go champs hashed with a convnet
syhw · x · 2026-10-10
Francois Fleuret mocked the claim that 'a big lookup table can beat the best humans at Go,' saying it stretches the term as much as the Chinese room stretches 'book'. Syhw, replying, revealed the technical detail: the hash for that hashmap was simply a convnet — i.e., AlphaGo-era policy networks mapped board states to moves, so the 'lookup table' relied on neural network generalization all along.
Related event: LeCun vs Fleuret: Is Chain-of-Thought Really Search?(13 posts)→
More from Fun
- Epsilon-delta humor: for every epsilon, a delta is coming for you — miniapeur · 2026-10-10
- Memo Akten's 'Abiogenesis' uses neural nets to create life-like forms from microscopy imagery — memoakten · 2026-10-10
- GPT 6 Astra Pro and Ultra tested on 657 economics problems, ranked by difficulty — burny_tech · 2026-10-10
- Dev rebuilds Adobe's entire product suite from scratch as free, open-source alternatives — mallow610 · 2026-10-10
- Consciousness theories roasted in one thread: functionalism, IIT dismissals and solipsism — burny_tech · 2026-10-10
- Guardian cartoon roasts AI-age job titles, from AI whisperer to Chief Hype Officer — nordicinst · 2026-10-10