Exploiting random walks for learning

DOI10.1006/INCO.2002.3083MaRDI QIDQ1854545zbMATH OpenOpenAlexFDO

Authors Paul Fischer, Klaus-Uwe Höffgen, Peter L. Bartlett

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

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Inference from stochastic processes and prediction (62M20) Applications of statistics to psychology (62P15) Learning and adaptive systems in artificial intelligence (68T05) Stochastic learning and adaptive control (93E35)

Recommendations

• Learning DNF from random walks
• New results for random walk learning
• On Exact Learning from Random Walk
• scientific article; zbMATH DE number 5957428
• Efficient learning of typical finite automata from random walks

Cites work

• A theory of the learnable
• Asymptotic analysis of a random walk on a hypercube with many dimensions
• Efficient learning of typical finite automata from random walks
• Equivalence of models for polynomial learnability
• Estimation and approximation bounds for gradient-based reinforcement learning
• scientific article; zbMATH DE number 67625 (Why is no real title available?)
• Minimum complexity regression estimation with weakly dependent observations
• On Learning Ring-Sum-Expansions
• Predicting \(\{ 0,1\}\)-functions on randomly drawn points

Cited in

(6)

• Learning dynamical systems in a stationary environment
• On biased random walks, corrupted intervals, and learning under adversarial design
• Learning DNF from random walks
• On Exact Learning from Random Walk
• Simple and fast algorithms for interactive machine learning with random counter-examples
• New results for random walk learning

This page was built for publication: Exploiting random walks for learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854545)