I watched the commentary that Michael Redmond gave (9-dan-professional) and he didn't point out one obvious mistake that Lee Sedol made the entire match. Just really high quality play by AlphaGo. Really amazing moment to see Lee Sedol resign by putting one of his opponent's stones on the board.
Yeah according to Redmond, it seemed that AlphaGo made a few "mistakes" whereas Sedol made none. And yet AlphaGo came out substantially ahead. So I'm not sure what that means. Perhaps we need to see more in-depth analysis of the moves, but it seems that AlphaGo just out-calculated Sedol.
AlphaGo beats the world champion Lee Sedol in first of five matches
281–290 of 596 posts
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#282Earlier quoted context omitted.
It's a proof-of-concept. What they've proved is that the same kind of intelligence required to play Go can be implemented with computer hardware. Before now, software couldn't beat a ranked human player at Go no matter how much computing power we threw at it . Now we can. Give it ten years and, between algorithmic optimizations and advances in processing, you'll have an unbeatable Go app on your phone.
> Give it ten years and, between algorithmic optimizations and advances in processing, you'll have an unbeatable Go app on your phone. I find this overly optimistic because of the huge amount of power required to run the Go application. Remember, we're getting closer and closer to the theoretical lower limit in the size of silicon chips, which is around 4nm (that's about a dozen silicon atoms). That's a 3-4x improvem…
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#283Earlier quoted context omitted.
How do you count examples? The computer can generate its own examples by playing against itself. So in theory it needs 0 examples. This is not a useful metric at all.
I would count every played game as an example. What I mean is that I am more impressed by anyone of anything that can do a task (go, golf, chess, learning a foreign language, doing the dishes even) well with just a single example, or e.g. an hour of training. Being able to train in solitude is an advantage indeed. You need two humans to do this, but you also need two AlphaGo-instances as well.
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#284Earlier quoted context omitted.
> Give it ten years and, between algorithmic optimizations and advances in processing, you'll have an unbeatable Go app on your phone. I find this overly optimistic because of the huge amount of power required to run the Go application. Remember, we're getting closer and closer to the theoretical lower limit in the size of silicon chips, which is around 4nm (that's about a dozen silicon atoms). That's a 3-4x improvem…
As solid as your argument may be, everyone saw arguments like this over and over. Every single time they were solid. For a time, it was the high frequency noise that would not be manageable (80s), then heat dissipation (90s), then limits on pipeline optimization (00s) and now size constraints on transistors. They were all hard barriers, deemed impossible and all were overcome. I already know that your answer will be:…
That previous constraints have been beaten in no way supports the argument that we will beat the laws of physics this time.
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#285Earlier quoted context omitted.
That's silly. Why would you want to put human limitations on the computer? We don't artificially put computer limitations on the human.
I don't think it's silly at all. I think you have a good point about this particular contest, but there are plenty of other applications where training data is prohibitively expensive or time-consuming to collect. One way to proceed is to work on making it easier to collect and curate this data, and another is to work on algorithms that require much less data to obtain good performance.
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#286Earlier quoted context omitted.
Your making the same assumption people made about computing in the 50s, then 70s, then 90s, etc.
Please do elaborate. I try to base my assumptions (which I accept may turn out to be completely wrong) on physics and experience in working in semiconductors. I just don't see a 1000x+ decrease in the power required happening in a decade or two without some revolutionary technology I can't even imagine. Is this what you meant? I'm sure most people couldn't imagine modern silicon chips in the 1950s vacuum tube era. Bu…
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#287Earlier quoted context omitted.
Here's a way to measure the sophistication of a game of skill. Consider two players A and Z. A is a ten-year-old who has just been told the rules; Z is God. Now, in between them, put a series of other players B, ..., Y, where B beats A 2/3 of the time, C beats B 2/3 of the time, ..., Z beats Y 2/3 of the time. (We assume God doesn't use his magical divine powers to cheat by, e.g., making Y play bad moves.) Unfortunat…
The tenchess counterargument doesn't work in the context of Elo (from which chain lengths are derived). A has 150 more Elo rating than B in chess. Elo says A has a 2/3 EV on the game result, and B has 1/3. In tenchess, A will get 20/3 points on average and B will get 10/3 points. A will have more points than B in 79% of tenchess games, but the Elo ratings will not change. Elo doesn't consider winning and losing as bi…
In particular, you don't get the total number of points you'd have got by playing the chess games individually. You get 0, 1/2, or 1. In particularly particular, A doesn't get any fewer points from a marginal win than from a blowout. (Just as, when playing chess, you don't get fewer points from taking 100 moves to grind out a tiny positional advantage than from a 20-move brilliancy.)
So A and B don't get 20/3 and 10/3 points on average from a game of tenchess; that's the number of "chess points" they get on average, but the average of the number of chess points isn't a thing that actually matters when they're playing tenchess.
(If A wins 2/3 of the time at chess and they never draw, then it turns out that A gets about 0.855 points per tenchess game.)
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#288Earlier quoted context omitted.
> Give it ten years and, between algorithmic optimizations and advances in processing, you'll have an unbeatable Go app on your phone. I find this overly optimistic because of the huge amount of power required to run the Go application. Remember, we're getting closer and closer to the theoretical lower limit in the size of silicon chips, which is around 4nm (that's about a dozen silicon atoms). That's a 3-4x improvem…
The unbeatable GO app on your phone doesn't have to do the processing locally.
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#289Earlier quoted context omitted.
As solid as your argument may be, everyone saw arguments like this over and over. Every single time they were solid. For a time, it was the high frequency noise that would not be manageable (80s), then heat dissipation (90s), then limits on pipeline optimization (00s) and now size constraints on transistors. They were all hard barriers, deemed impossible and all were overcome. I already know that your answer will be:…
This looks like a good example of the Normalcy bias logical fallacy: https://en.wikipedia.org/wiki/Normalcy_bias That previous constraints have been beaten in no way supports the argument that we will beat the laws of physics this time.
If the normalcy bias was in effect, they wouldn't be spending that money.
Re: AlphaGo beats the world champion Lee Sedol in first of five matches
#290To my mind, this is a really significant achievement not because a computer was able to beat a person at Go, but because the DeepMind team was able to show that deep learning could be used successfully on a complex task that requires more than an effective feature detector, and that it could be done without having all of the training data in advance. Learning how to search the board as part of the training is brilliant.
The next step is extending the technique to domains that are not easily searchable (fortunately for DeepMind, Google might know a thing or two about that), and to extend it to problems where the domain of optimal solutions is less continuous.