Exploiting Random Walks for Learning
Authors:
- Peter L. BartlettPBPeter L. Bartlett
- Paul FischerbPFPaul Fischerb
- Klaus- Uwe HöffgencKHKlaus- Uwe Höffgenc
- 1 August 2002
- journal article
- Published by Elsevier in Information and Computation
- Vol. 176 (2) , 121-135
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Minimum complexity regression estimation with weakly dependent observationsIEEE Transactions on Information Theory, 1996
- On Learning Ring-Sum-ExpansionsSIAM Journal on Computing, 1992
- Equivalence of models for polynomial learnabilityInformation and Computation, 1991
- Asymptotic analysis of a random walk on a hypercube with many dimensionsRandom Structures & Algorithms, 1990
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988