When memory pays: Discord in hidden Markov models

Abstract

When is keeping a memory of observations worthwhile? We use hidden Markov models to look at phase transitions that emerge when comparing state estimates in systems with discrete states and noisy observations. We infer the underlying state of the hidden Markov models from the observations in two ways: through naive observations, which take into account only the current observation, and through Bayesian filtering, which takes the history of observations into account. Defining a discord order parameter to distinguish between the different state estimates, we explore hidden Markov models with various numbers of states and symbols and varying transition-matrix symmetry. All behave similarly. We calculate analytically the critical point where keeping a memory of observations starts to pay off. A mapping between hidden Markov models and Ising models gives added insight into the associated phase transitions.

arXiv comment11 pages, 8 figures

References in corpus (8)

• The Value of Information for Populations in Varying Environments
• Sensory capacity: an information theoretical measure of the performance of a sensor
• The Entropy of a Binary Hidden Markov Process
• Hidden Markov models for stochastic thermodynamics
• Optimized finite-time information machine
• When memory pays: Discord in hidden Markov models
• On Maximum a Posteriori Estimation of Hidden Markov Processes
• Environmental statistics and optimal regulation

Cited by in corpus (6)

• Phase transition in protocols minimizing work fluctuations
• Thermodynamic cost and benefit of memory
• Optimal work extraction and mutual information in a generalized Szilárd engine
• Optimal Work Extraction and the Minimum Description Length Principle
• When memory pays: Discord in hidden Markov models
• Phase transition for parameter learning of Hidden Markov Models