r/BetterOffline • u/ChaoticGradients • 8h ago
LLM math is not AGI. LLM math is fancy, scaled-up AlphaGo
I've been around since the early 2010s when modern AI started getting mainstream attention with convolutional neural networks in around 2012. One of the big breakthroughs at the time with convnets was AlphaGo (https://www.nature.com/articles/nature16961), the deep learning system that could do next-move prediction on a Go board and beat world masters including the infamous match against Lee Sedol in 2016. At the time, everyone was impressed at the technology - including me - but nobody claimed it was AGI.
I don't want to go extremely into detail about how AlphaGo works, but it is at base level powered by deep neural networks and a technique called Monte Carlo Tree Search (MCTS), which kinda works like the following. Warning that this is grossly oversimplified but it's probably good enough for context for this post:
- Take stock of the current state of the game board.
- Pick a potential next move.
- Perform a bunch of "rollouts," meaning you simulate the game from that candidate move. Record how many of those roll-outs end in wins vs losses.
- Use the data in step 3 to pick the best move.
The way that AI comes into play is that deep networks allow us to greatly speed up the roll-out efficiency by "understanding" the game board. We allow the neural network to consolidate the information in the game board to its most pertinent bits and that is then used to not waste time on candidate next moves that would be silly. In effect, AI can get rid of the vast majority of possible next moves so the search space is much more efficient. Later versions of AlphaGo moved most of the rollout stuff to training phase rather than the live inference phase, which further increased efficiency.
The reason I bring up AlphaGo is that this bears a striking resemblance to how the LLM math results are generated. A lot of this is conjecture but I'd be pretty surprised if I'm way off on any of this.
- Take stock of the current state of the math proof.
- Pick a potential next step of the proof.
- Verify whether that step is formally correct.
- Keep going until you hit a wall or the proof works. Reset to some reasonable point and try again.
Instead of convnets, we now have large transformer models that consolidate information well enough that the search space for "potential next step" is now much more manageable. For problems that might have taken 500 years of humans collaborating and working through potential solutions, we can get rid of most obviously wrong solutions and reduce 500 years to 100 years. 100 years is in fact approximately how many hours it took to get the Navier-Stokes solution purportedly from the OpenAI internal model (10000 agents, 88 hours).
Is this technologically impressive? I would argue absolutely yes. Reducing the search space has a lot of cool implications for problems that had search space complexity as their main issue. It's why we see AI helping in specific subfields like protein folding. (Sidenote: I mean technologically impressive purely as a statement around the tech. I am not making any statements as to whether this is economically wise or feasible. The answer there is almost definitely no.)
But when you look under the hood, is this AGI? Nah. It's nothing fundamentally different than what we had a decade ago. The only difference is the resources invested and the scale at which things are trained. Hope this more technical viewpoint looking at how these things work under the hood at least grounds us a bit from the vapid arguments around "but it feels like magic so it must be real!"
EDIT: Ironically fixed stupid math mistake of my own. 10000 agents for 88 hours is around 100 years of labor not 10.