Sciweavers

2990 search results - page 527 / 598
» Hidden Markov processes
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...
ICML
2007
IEEE
15 years 10 months ago
Multi-task reinforcement learning: a hierarchical Bayesian approach
We consider the problem of multi-task reinforcement learning, where the agent needs to solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but unknow...
Aaron Wilson, Alan Fern, Soumya Ray, Prasad Tadepa...
ICML
2008
IEEE
15 years 10 months ago
Reinforcement learning in the presence of rare events
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
Jordan Frank, Shie Mannor, Doina Precup
ICML
2006
IEEE
15 years 10 months ago
Using inaccurate models in reinforcement learning
In the model-based policy search approach to reinforcement learning (RL), policies are found using a model (or "simulator") of the Markov decision process. However, for ...
Pieter Abbeel, Morgan Quigley, Andrew Y. Ng
ICML
2006
IEEE
15 years 10 months ago
A choice model with infinitely many latent features
Elimination by aspects (EBA) is a probabilistic choice model describing how humans decide between several options. The options from which the choice is made are characterized by b...
Carl Edward Rasmussen, Dilan Görür, Fran...