Exploiting random walks for learning
From MaRDI portal
Publication:1854545
DOI10.1006/inco.2002.3083zbMath1012.68150OpenAlexW2060177694MaRDI QIDQ1854545
Paul Fischer, Klaus-Uwe Höffgen, Bartlett, Peter L.
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.2002.3083
Inference from stochastic processes and prediction (62M20) Sums of independent random variables; random walks (60G50) Learning and adaptive systems in artificial intelligence (68T05) Stochastic learning and adaptive control (93E35) Applications of statistics to psychology (62P15)
Related Items (1)
Cites Work
- Unnamed Item
- Equivalence of models for polynomial learnability
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- Estimation and approximation bounds for gradient-based reinforcement learning
- Asymptotic analysis of a random walk on a hypercube with many dimensions
- A theory of the learnable
- On Learning Ring-Sum-Expansions
- Minimum complexity regression estimation with weakly dependent observations
- Efficient learning of typical finite automata from random walks
This page was built for publication: Exploiting random walks for learning