$95.00
Availability: In stock

From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning 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...

  • Name : From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
  • Vendor : Now Publishers
  • Type : Books
  • Manufacturing : 2024 / 07 / 28
  • Barcode : 9781601987662
-
+
Categories:

Guaranteed safe checkout:

apple paygoogle paymasterpaypalshopify payvisa
From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
- +
From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning 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.

Author: Remi Munos
Binding Type: Paperback
Publisher: Now Publishers
Published: 01/31/2014
Series: Foundations and Trends(r) in Machine Learning #21
Pages: 146
Weight: 0.47lbs
Size: 9.21h x 6.14w x 0.31d
ISBN: 9781601987662

Ezra's Archive Does not ship outside of the United States

Delivery Options:

1. Economy: 

Estimated Delivery Time - 5 to 8 Business Days

Shipping Cost - $4.15

2. USPS Priority:

Estimated Delivery Time - 1 to 3 Business Days 

Shipping Cost - $8.85

3. Free Economy Shipping: Only Applicable to Orders over $60

Returns and Refunds: 

Purchased items are not eligible to be returned. However, a refund or item replacement may be granted should an item be damaged or misplaced during shipping. To make a refund or replacement claim please contact us via email at Ezra'sArchive@outlook.com

 

 

 

 

Get 20% Off Your First Order
Sign up and unlock your instant discount.
Powered by Attrac: a Shopify marketing app for announcement bars, banners, and popups.