A Markovian extension of Valiant's learning model

DOI10.1006/INCO.1995.1037MaRDI QIDQ1892872zbMATH OpenOpenAlexFDO

Authors David Aldous, Umesh V. Vazirani

Publication date 6 July 1995

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1037

zbMATH Keywords

learning modelOccam algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Extension of the PAC framework to finite and countable Markov chains
• Occam's razor
• A new on-line learning model
• scientific article; zbMATH DE number 2019610
• Learning probabilistic automata and Markov chains via queries

Cited in

(13)

• Learning DNF from random walks
• A new on-line learning model
• Global PAC bounds for learning discrete time Markov chains
• scientific article; zbMATH DE number 2019610 (Why is no real title available?)
• Making the error-controlling algorithm of observable operator models constructive
• Learning Variable-Length Markov Models of Behavior
• Occam's razor
• ONLINE LEARNING WITH MARKOV SAMPLING
• Learning dynamical systems in a stationary environment
• Toward efficient agnostic learning
• Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
• Empirical validation of a Markovian learning model for knowledge structures
• Extension of the PAC framework to finite and countable Markov chains

This page was built for publication: A Markovian extension of Valiant's learning model

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