Learning with Finite Memory
From MaRDI portal
Publication:5595657
DOI10.1214/aoms/1177696958zbMath0198.52803OpenAlexW1969061574MaRDI QIDQ5595657
Martin Edward Hellman, Thomas M. Cover
Publication date: 1970
Published in: The Annals of Mathematical Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoms/1177696958
Related Items (21)
Recursive procedures for multiple decisions: Finite time memory and stepwise maximum likelihood procedure ⋮ Information diffusion in social sensing ⋮ Overlap in observational studies with high-dimensional covariates ⋮ Learning with limited memory: Bayesianism vs heuristics ⋮ Bounded memory in a changing world: biases in behaviour and belief ⋮ Forgetful updating and stubborn decision-makers ⋮ Bad reputation with simple rating systems ⋮ Confirmation bias in social networks ⋮ The value of (bounded) memory in a changing world ⋮ Herbert Robbins and sequential analysis ⋮ Learning with bounded memory in games ⋮ How fragile are information cascades? ⋮ Advice Coins for Classical and Quantum Computation ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ Lower Bound on the Error Probability for Families with Bounded Likelihood Ratios ⋮ Statistical estimation with bounded memory ⋮ The apparent conflict between estimation and control - a survey of the two-armed bandit problem ⋮ Cognitively-constrained learning from neighbors ⋮ Reinforcement with Fading Memories ⋮ Two Party Distribution Testing: Communication and Security ⋮ Plausible cooperation
This page was built for publication: Learning with Finite Memory
