Optimal finite memory learning algorithms for the finite sample problem

DOI10.1016/S0019-9958(76)90456-3zbMath0332.62017OpenAlexW2000114801MaRDI QIDQ4098493

M. A. Freedman, Thomas M. Cover, 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)

Related Items (4)

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 ⋮ On asymptotically optimal methods of prediction and adaptive coding for Markov sources

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