Sciweavers

802 search results - page 61 / 161
» Experts in a Markov Decision Process
Sort
View
ALT
2006
Springer
14 years 4 months ago
Probabilistic Generalization of Simple Grammars and Its Application to Reinforcement Learning
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
Takeshi Shibata, Ryo Yoshinaka, Takashi Chikayama
DSS
2008
84views more  DSS 2008»
13 years 7 months ago
Human decision-making behavior and modeling effects
Previous research indicates that the human decision-making process is somewhat nonlinear and that nonlinear models would be more suitable than linear models for developing advance...
Choong Nyoung Kim, Kyung Hoon Yang, Jaekyung Kim
ICML
2006
IEEE
14 years 8 months ago
PAC model-free reinforcement learning
For a Markov Decision Process with finite state (size S) and action spaces (size A per state), we propose a new algorithm--Delayed Q-Learning. We prove it is PAC, achieving near o...
Alexander L. Strehl, Lihong Li, Eric Wiewiora, Joh...
ICML
2006
IEEE
14 years 8 months ago
An intrinsic reward mechanism for efficient exploration
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...
Özgür Simsek, Andrew G. Barto
ICRA
2007
IEEE
126views Robotics» more  ICRA 2007»
14 years 2 months ago
A formal framework for robot learning and control under model uncertainty
— While the Partially Observable Markov Decision Process (POMDP) provides a formal framework for the problem of robot control under uncertainty, it typically assumes a known and ...
Robin Jaulmes, Joelle Pineau, Doina Precup