0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Artificial intelligence > Machine learning

Buy Now

From Bandits to Monte-Carlo Tree Search - The Optimistic Principle Applied to Optimization and Planning (Paperback) Loot Price: R2,256
Discovery Miles 22 560
From Bandits to Monte-Carlo Tree Search - The Optimistic Principle Applied to Optimization and Planning (Paperback): Remi Munos

From Bandits to Monte-Carlo Tree Search - The Optimistic Principle Applied to Optimization and Planning (Paperback)

Remi Munos

Series: Foundations and Trends (R) in Machine Learning

 (sign in to rate)
Loot Price R2,256 Discovery Miles 22 560 | Repayment Terms: R211 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

From Bandits to Monte-Carlo Tree Search covers several aspects of the ""optimism in the face of uncertainty"" principle for large scale optimization problems under finite numerical budget. The monograph's initial motivation came from the empirical success of the so-called ""Monte-Carlo Tree Search"" method popularized in Computer Go and further extended to many other games as well as optimization and planning problems. It lays out the theoretical foundations of the field by characterizing the complexity of the optimization problems and designing efficient algorithms with performance guarantees. The main direction followed in this monograph consists in decomposing a complex decision making problem (such as an optimization problem in a large search space) into a sequence of elementary decisions, where each decision of the sequence is solved using a stochastic ""multi-armed bandit"" (mathematical model for decision making in stochastic environments). This defines a hierarchical search which possesses the nice feature of starting the exploration by a quasi-uniform sampling of the space and then focusing, at different scales, on the most promising areas (using the optimistic principle) until eventually performing a local search around the global optima of the function. This monograph considers the problem of function optimization in general search spaces (such as metric spaces, structured spaces, trees, and graphs) as well as the problem of planning in Markov decision processes. Its main contribution is a class of hierarchical optimistic algorithms with different algorithmic instantiations depending on whether the evaluations are noisy or noiseless and whether some measure of the local ''smoothness'' of the function around the global maximum is known or unknown.

General

Imprint: Now Publishers Inc
Country of origin: United States
Series: Foundations and Trends (R) in Machine Learning
Release date: 2014
First published: 2014
Authors: Remi Munos
Dimensions: 234 x 156 x 8mm (L x W x T)
Format: Paperback
Pages: 146
ISBN-13: 978-1-60198-766-2
Categories: Books > Computing & IT > Applications of computing > Artificial intelligence > Machine learning
LSN: 1-60198-766-8
Barcode: 9781601987662

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners