1. Home
  2. Material Detail: The optimistic principle for online planning in Markov decision processes

Material Detail

The optimistic principle for online planning in Markov decision processes

The optimistic principle for online planning in Markov decision processes

This video was recorded at Large-scale Online Learning and Decision Making (LSOLDM) Workshop, Cumberland Lodge 2012. Given an initial state, what is the best possible action that can be returned by a planning algorithm that is given a finite numerical budget (e.g. number of calls to a model of the state-transition and reward functions). We investigate optimistic strategies and provide regret bounds in terms of a new measure of the complexity of the planning problem.
Keywords:
videolectures, ocwc, oec
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Presentation
Date Added to MERLOT:
February 10, 2015
Date Modified in MERLOT:
February 10, 2015
Author:
Submitter:
The Open Education Consortium
Primary Audience:
College General Ed, College Lower Division, College Upper Division
Technical Format:
Video
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
No
Accessibility Information Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States

Browse...

Disciplines with similar materials as The optimistic principle for online planning in Markov decision processes
People who viewed this also viewed
Other materials like The optimistic principle for online planning in Markov decision processes

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.