Optimal finite memory learning algorithms for the finite sample problem

DOI10.1016/S0019-9958(76)90456-3MaRDI QIDQ4098493zbMATH OpenOpenAlexFDO

Authors Thomas M. Cover, M. A. Freedman, Martin Edward Hellman

Publication date 1976

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

Full work available at URL https://doi.org/10.1016/s0019-9958(76)90456-3

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Cited in

(4)

• On asymptotically optimal methods of prediction and adaptive coding for Markov sources
• Recursive procedures for multiple decisions: Finite time memory and stepwise maximum likelihood procedure
• Lower Bound on the Error Probability for Families with Bounded Likelihood Ratios
• Statistical estimation with bounded memory

This page was built for publication: Optimal finite memory learning algorithms for the finite sample problem

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