Re:AlphaGo beats the world champion Lee Sedol in first of fi...
by ogrisel on Wednesday March 09, 2016 @03:28PM
(#11255514)
see also by the same team:
Re:AlphaGo beats the world champion Lee Sedol in first of fi...
by argonaut on Wednesday March 09, 2016 @04:30PM
(#11255872)
There is a near infinite number of such spaces.
Re:AlphaGo beats the world champion Lee Sedol in first of fi...
by ogrisel on Thursday March 10, 2016 @03:57AM
(#11258035)
I don't understand why would the "number of spaces" matters. What matters is can you design a learning algorithm that performs well in interesting spaces such as:
- discrete spaces such as atari games and go, - continuous spaces such as driving a car, controlling a robot or bid on a ad exchange.
Re:AlphaGo beats the world champion Lee Sedol in first of fi...
by argonaut on Thursday March 10, 2016 @07:17AM
(#11258721)
A really really large number of distinct decisions that need to be made. A car only needs to control a small set of actions (wheels, engine, a couple others I'm missing). A game player only needs to choose from a small set of actions (e.g. place piece at position X, move left/right/up/down/jump).
http://arxiv.org/abs/1509.02971
The fact that the (reinforcement) learning problem is hard or not is not directly related to whether the observation and action spaces are discrete or continuous.