Sciweavers


Publication
352views
14 years 8 days ago
Efficient methods for near-optimal sequential decision making under uncertainty
This chapter discusses decision making under uncertainty. More specifically, it offers an overview of efficient Bayesian and distribution-free algorithms for making near-optimal se...
Christos Dimitrakakis

Publication
222views
14 years 1 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis

Publication
334views
14 years 1 months ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis
ICAART
2010
INSTICC
14 years 1 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis

2
posts
with
280
views
299profile views Browse  My Posts »
Daniel L. ElliottStudent, PhD
Colorado State University
Daniel L. Elliott
I am a Ph.D. student working with Chuck Anderson studying reinforcement learning. I also enjoy high dimensional data issues, mixture models, neural networks, and simple, yet effec...
ICML
1999
IEEE
14 years 5 months ago
Using Reinforcement Learning to Spider the Web Efficiently
Consider the task of exploring the Web in order to find pages of a particular kind or on a particular topic. This task arises in the construction of search engines and Web knowled...
Jason Rennie, Andrew McCallum
ICML
2000
IEEE
14 years 5 months ago
Combining Reinforcement Learning with a Local Control Algorithm
We explore combining reinforcement learning with a hand-crafted local controller in a manner suggested by the chaotic control algorithm of Vincent, Schmitt and Vincent (1994). A c...
Andrew G. Barto, Jette Randløv, Michael T. ...
ICML
2004
IEEE
14 years 5 months ago
Using relative novelty to identify useful temporal abstractions in reinforcement learning
lative Novelty to Identify Useful Temporal Abstractions in Reinforcement Learning ?Ozg?ur S?im?sek ozgur@cs.umass.edu Andrew G. Barto barto@cs.umass.edu Department of Computer Scie...
Özgür Simsek, Andrew G. Barto
ICML
2004
IEEE
14 years 5 months ago
Learning to fly by combining reinforcement learning with behavioural cloning
Reinforcement learning deals with learning optimal or near optimal policies while interacting with the environment. Application domains with many continuous variables are difficul...
Eduardo F. Morales, Claude Sammut