10 search results - page 1 / 2 » Asymptotic Learnability of Reinforcement Problems with Arbit... |
ALT
2006
Springer
14 years 1 months ago
2006
Springer
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...
MMAS
2010
Springer
12 years 11 months ago
2010
Springer
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....
ATAL
2007
Springer
13 years 10 months ago
2007
Springer
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...
SIGCOMM
1996
ACM
13 years 8 months ago
1996
ACM
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...
JAIR
2011
12 years 11 months ago
2011
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...