Sciweavers

166 search results - page 4 / 34
» Online model learning in adversarial Markov decision process...
Sort
View
COLT
1992
Springer
15 years 1 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani
IJCAI
2007
14 years 11 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
ICWS
2004
IEEE
14 years 11 months ago
Dynamic Workflow Composition using Markov Decision Processes
The advent of Web services has made automated workflow composition relevant to Web based applications. One technique that has received some attention, for automatically composing ...
Prashant Doshi, Richard Goodwin, Rama Akkiraju, Ku...
ML
2002
ACM
143views Machine Learning» more  ML 2002»
14 years 9 months ago
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
An issue that is critical for the application of Markov decision processes MDPs to realistic problems is how the complexity of planning scales with the size of the MDP. In stochas...
Michael J. Kearns, Yishay Mansour, Andrew Y. Ng
AIPS
2008
14 years 12 months ago
Bounded-Parameter Partially Observable Markov Decision Processes
The POMDP is considered as a powerful model for planning under uncertainty. However, it is usually impractical to employ a POMDP with exact parameters to model precisely the real-...
Yaodong Ni, Zhi-Qiang Liu