Sciweavers

10 search results - page 1 / 2
» Asymptotic Learnability of Reinforcement Problems with Arbit...
Sort
View
ALT
2006
Springer
14 years 7 months ago
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
Daniil Ryabko, Marcus Hutter
MMAS
2010
Springer
13 years 5 months ago
An Asymptotic Analysis of the Mean First Passage Time for Narrow Escape Problems: Part I: Two-Dimensional Domains
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....
S. Pillay, Michael J. Ward, A. Peirce, Theodore Ko...
ATAL
2007
Springer
14 years 5 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
SIGCOMM
1996
ACM
14 years 3 months ago
On the Relevance of Long-Range Dependence in Network Traffic
There is much experimental evidence that network traffic processes exhibit ubiquitous properties of self-similarity and long-range dependence, i.e., of correlations over a wide ran...
Matthias Grossglauser, Jean-Chrysostome Bolot
JAIR
2011
187views more  JAIR 2011»
13 years 5 months ago
A Monte-Carlo AIXI Approximation
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
Joel Veness, Kee Siong Ng, Marcus Hutter, William ...