СледваСледващо ръководство
Zhipu GLM модели
Фирми
Фирми РЪКОВОДСТВО
AlphaGo combined neural networks with Monte Carlo Tree Search to play Go.
Чуйте това ръководствоAI-разказан · ~2 min
AlphaZero used self-play given game rules in Go, chess, and shogi, while MuZero learned a model sufficient for planning without being given the environment dynamics.
Go is difficult for brute-force search because of its large search space and the challenge of evaluating positions. AlphaGo combines a policy network, which suggests promising moves, and a value network, which evaluates board positions, with Monte Carlo Tree Search. Its original Nature paper describes supervised learning from human expert games followed by reinforcement learning from self-play. AlphaZero generalizes self-play reinforcement learning to Go, chess, and shogi; it starts from random play and uses the game rules without human game examples. The AlphaZero paper reports superhuman play in the tested games, including reaching that level in chess and shogi within 24 hours of training. MuZero is different: it learns a latent model of rewards and state transitions sufficient for planning, without being supplied the game’s rules or full dynamics. These are research results in games, not evidence that the same performance transfers to arbitrary planning tasks.
Compare AlphaGo’s supervised learning from expert games with reinforcement learning from self-play.
Use AlphaZero’s experiments to study search and self-play under known game rules.
Inspect how a policy prior and value estimate can guide Monte Carlo Tree Search.
Compare MuZero’s learned planning model with systems that receive explicit game rules.
AlphaGo, AlphaZero, and MuZero show different ways to combine learned evaluation with search in structured games. Applying these methods to other domains requires defining actions, rewards, constraints, and an evaluation environment; game results alone do not establish performance in robotics, mathematics, or language tasks.
Безплатен бюлетин
Три проверени AI истории всяка делнична сутрин, написани на достъпен език. Безплатно завинаги, без реклами.
Един имейл всеки делничен ден. Отписване с едно кликване. Никога не продаваме и не споделяме вашия имейл адрес.
Тествайте себе си
Незабавна обратна връзка за всеки отговор и сертификат за споделяне с подлежащ на проверка идентификационен номер, след като преминете курс.
Подкрепете безплатното AI образование. AI Understanding е 501(c)(3) с нестопанска цел — без реклами, без платен достъп, никога. Направете дарение
AlphaGo combined neural networks with Monte Carlo Tree Search to play Go. AlphaZero used self-play given game rules in Go, chess, and shogi, while MuZero learned a model sufficient for planning without being given the environment dynamics.
Огромният фактор на разклоняване на Go прави търсенето с груба сила невъзможно, така че успехът изисква научена интуиция.
AlphaGo победи топ шампиона в Go Lee Sedol с 4-1 в много гледан мач от 2016 г.
The AlphaZero paper evaluates its general reinforcement-learning algorithm in Go, chess, and shogi. Its results are specific to those games and experiments.
AlphaZero използва Monte Carlo Tree Search, ръководен от политиката на невронната мрежа и прогнозите за стойността.
Мрежовите изходи, които изглеждат обещаващи (политика) и прогноза за това кой ще спечели (стойност), фокусирайки търсенето.
Продължавай да учиш
Още ръководства, избрани за тази тема
СледваСледващо ръководство
Zhipu GLM модели
Фирми