Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?

@article{Ruebeck2018PredictionAG,
title={Prediction and Generation of Binary Markov Processes: Can a Finite-State Fox Catch a Markov Mouse?},
author={J. Ruebeck and Ryan G. James and John R. Mahoney and James P. Crutchfield},
journal={Chaos},
year={2018},
volume={28 1},
pages={
013109
}
}
• Published 1 August 2017
• Computer Science
• Chaos
Understanding the generative mechanism of a natural system is a vital component of the scientific method. Here, we investigate one of the fundamental steps toward this goal by presenting the minimal generator of an arbitrary binary Markov process. This is a class of processes whose predictive model is well known. Surprisingly, the generative model requires three distinct topologies for different regions of parameter space. We show that a previously proposed generator for a particular set of…
9 Citations

Figures from this paper

Strong and Weak Optimizations in Classical and Quantum Models of Stochastic Processes

• Computer Science
Journal of Statistical Physics
• 2019
Among the predictive hidden Markov models that describe a given stochastic process, the {\epsilon}-machine is strongly minimal in that it minimizes every Renyi-based memory measure, but there are those for which there does not exist any strongly minimal model.

The fundamental thermodynamic bounds on finite models.

This work derives bounds on finite modeling-the production or anticipation of patterns (time-series data)-by devices that model the pattern in a piecewise manner and are equipped with a finite amount of memory by considering devices that consume or effect arbitrary changes on a pattern.

The Origins of Computational Mechanics: A Brief Intellectual History and Several Clarifications

This brief review clarifies several misunderstandings and addresses concerns recently raised regarding early works in the field (1980s) and shows the significant progress achieved over three decades and points to the many intriguing and outstanding challenges in understanding the computational nature of complex dynamic systems.

Oracular information and the second law of thermodynamics

It is shown that if oracular information could be incorporated within any device that anticipates and consumes a pattern to release work, this would be inconsistent with the second law of thermodynamics, which suggests that oracular Information is only physical when used by machines that are the cause of patterns.

Memory compression and thermal efficiency of quantum implementations of non-deterministic hidden Markov models

This work provides a systematic prescription for constructing quantum implementations of non-deterministic HMMs that re-establish the quantum advantages against this broader class, and shows that whenever the classical implementation suffers from thermal dissipation due to its need to process information in a time-local manner, the quantum implementations will both mitigate some of this dissipation, and achieve an advantage in memory compression.

Understanding sequential measurements in psi-epistemic ontological models

It is shown that consideration of sequential measurements, and the fact that the quantum state changes during measurements, has been a neglected topic in this area as it places nontrivial restrictions on the structure of ψ-epistemic ontological models.

Menggunakan Finite State Automata

• Computer Science
• 2020
This application can help small and medium entrepreneurs to calculate large amounts of data and will reduce the error rate, and can assist in carrying out a more efficient financial management process.

Binary Recursive Estimation on Noisy Hardware

• Computer Science
2019 IEEE International Symposium on Information Theory (ISIT)
• 2019
The loss in estimation performance due to noise in recursive probability computation for the binary case is analyzed, an optimal energy allocation strategy is developed, and simulations show the validity of analytical bounds.

Spectral Simplicity of Apparent Complexity, Part I: The Nondiagonalizable Metadynamics of Prediction

• Mathematics
Chaos
• 2018
The first closed-form expressions for complexity measures, couched either in terms of the Drazin inverse or the eigenvalues and projection operators of the appropriate transition dynamic of the recently introduced meromorphic functional calculus are established.

References

SHOWING 1-10 OF 18 REFERENCES

On the Generative Nature of Prediction

• Computer Science
• 2009
This work proposes an alternative notion of predictive models in terms of a hidden Markov model capable of generating the underlying stochastic process that is less restrictive and thereby allows for predictive models that are more concise than the e-machine.

Predictive models and generative complexity

This paper gives a mathematical proof of the idea that the ɛ-machine is the minimal HMM with an additional (partial) determinism condition, and shows that generative complexity depends on the process in a nice way.

Non-sufficient Memories That Are Sufficient for Prediction

• Computer Science
Complex
• 2009
This work proposes a notion of prediction that does not require sufficiency and shows how the corresponding models can be substantially smaller than the e-machine and are closely related to generative HMMs.

Computational Mechanics: Pattern and Prediction, Structure and Simplicity

• Computer Science
ArXiv
• 1999
It is shown that the causal-state representation—an ∈-machine—is the minimal one consistent with accurate prediction, and several results are established on ∉-machine optimality and uniqueness and on how∈-machines compare to alternative representations.

Minimum memory for generating rare events.

• Computer Science
Physical review. E
• 2017
It is shown that the recently discovered classical-quantum ambiguity of simplicity also occurs when comparing the structure of process fluctuations, which leads to an expression for the minimum memory required to generate rare events.

Information trimming: Sufﬁcient statistics, mutual information, and predictability from effective channel states

• Computer Science
• 2017
This work demonstrates that both variables can be replaced simultaneously in the case where one variable is a stochastic process’ past and the other its future, and translates the result about minimal sufﬁcient statistics to the mutual information between the forward- and reverse-time causal states of computational mechanics.

Synchronization and Control in Intrinsic and Designed Computation: An Information-Theoretic Analysis of Competing Models of Stochastic Computation

• Computer Science
Chaos
• 2010
It is shown that synchronization is determined by both the process's internal organization and by an observer's model of it, and this work introduces a hierarchy of information quantifiers as derivatives and integrals of these entropies, which parallels a similar hierarchy introduced for block entropy.

Between Order and Chaos

One of the earliest form of agents is called a cellular automata (CA), which consists of a lattice of cells, or sites, whose value is commonly expressed as 0 or 1, black or white, on or off, or a color selected from a set of colors.

Exact common information

• Computer Science, Mathematics
2014 IEEE International Symposium on Information Theory
• 2014
The quantity G(X; Y) = minX→W→Y H(W) as a natural bound on the exact common information and study its properties and computation and give a multiletter characterization for it as the limit.

A new dual to the Gács-Körner common information defined via the Gray-Wyner system

• Computer Science
2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
• 2010
A new notion of common information between the random variables is proposed that is dual to the Gács-Körner common information from this viewpoint in a well-defined sense and characterized explicitly in terms of two auxiliary quantities that are asymmetric in nature.