It is amazing that our neural networks work at all; terrifying that we can dump in so much GPU power that our training methods work at all; and the fact that AlphaGo can even exist is still blowing my mind. It’s like watching a trillion spiders with the intelligence of earthworms, working for 100,000 years, using tissue paper to construct nuclear weapons.
People occasionally ask me about signs that the remaining timeline might be short. It’s very easy for nonprofessionals to take too much alarm too easily. Deep Blue beating Kasparov at chess was not such a sign. Robotic cars are not such a sign.
This is.
“Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves… Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0.”
Repeat: IT DEFEATED THE EUROPEAN GO CHAMPION 5-0.
As the authors observe, this represents a break of at least one decade faster than trend in computer Go.
This matches something I’ve previously named in private conversation as a warning sign—sharply above-trend performance at Go from a neural algorithm. What this indicates is not that deep learning in particular is going to be the Game Over algorithm. Rather, the background variables are looking more like “Human neural intelligence is not that complicated and current algorithms are touching on keystone, foundational aspects of it.” What’s alarming is not this particular breakthrough, but what it implies about the general background settings of the computational universe.
To try spelling out the details more explicitly, Go is a game that is very computationally difficult for traditional chess-style techniques. Human masters learn to play Go very intuitively, because the human cortical algorithm turns out to generalize well. If deep learning can do something similar, plus (a previous real sign) have a single network architecture learn to play loads of different old computer games, that may indicate we’re starting to get into the range of “neural algorithms that generalize well, the way that the human cortical algorithm generalizes well”.
This result also supports that “Everything always stays on a smooth exponential trend, you don’t get discontinuous competence boosts from new algorithmic insights” is false even for the non-recursive case, but that was already obvious from my perspective. Evidence that’s more easily interpreted by a wider set of eyes is always helpful, I guess.
Next sign up might be, e.g., a similar discontinuous jump in machine programming ability—not to human level, but to doing things previously considered impossibly difficult for AI algorithms.
I hope that everyone in 2005 who tried to eyeball the AI alignment problem, and concluded with their own eyeballs that we had until 2050 to start really worrying about it, enjoyed their use of whatever resources they decided not to devote to the problem at that time.
Found two Eliezer-posts from 2016 (on Facebook) that I feel helped me better grok his perspective.
Sep. 14, 2016:
And earlier, Jan. 27, 2016: