Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction
From MaRDI portal
Publication:4565944
DOI10.1063/1.4985199zbMath1462.62756arXiv1705.08042OpenAlexW3106023132WikidataQ52335843 ScholiaQ52335843MaRDI QIDQ4565944
Paul M. Riechers, James P. Crutchfield
Publication date: 13 June 2018
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.08042
Inference from stochastic processes and prediction (62M20) Inference from stochastic processes and spectral analysis (62M15) Markov processes: estimation; hidden Markov models (62M05) Applications of statistics to physics (62P35) Statistical aspects of information-theoretic topics (62B10) Prediction theory (aspects of stochastic processes) (60G25)
Related Items
Spectral simplicity of apparent complexity. II. Exact complexities and complexity spectra, Optimality and complexity in measured quantum-state stochastic processes, Strong and weak optimizations in classical and quantum models of stochastic processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Predictive rate-distortion for infinite-order Markov processes
- Exact synchronization for finite-state sources
- Asymptotic synchronization for finite-state sources
- Exponential bounds for convergence of entropy rate approximations in hidden Markov models satisfying a path-mergeability condition
- Spectra of digraphs
- Prediction, retrodiction, and the amount of information stored in the present
- Toward a quantitative theory of self-generated complexity
- Mathematical population genetics. I: Theoretical introduction.
- Quantum automata and quantum grammars
- Structure and randomness of continuous-time, discrete-event processes
- The calculi of emergence: Computation, dynamics and induction
- Generalized inverses. Theory and applications.
- Exact complexity: the spectral decomposition of intrinsic computation
- Leveraging environmental correlations: the thermodynamics of requisite variety
- Informational and causal architecture of continuous-time renewal processes
- Equivalence of state representations for hidden Markov models
- Predictability, Complexity, and Learning
- Finitary Codings and Weak Bernoulli Partitions
- Information accessibility and cryptic processes
- Approximations for the Entropy for Functions of Markov Chains
- Nonequilibrium Statistical Physics of Small Systems
- Hidden Markov models for stochastic thermodynamics
- Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
- Optimal causal inference: Estimating stored information and approximating causal architecture
- Anatomy of a bit: Information in a time series observation
- How hidden are hidden processes? A primer on crypticity and entropy convergence
- Elements of Information Theory
- Probabilistic automata
- Regularities unseen, randomness observed: Levels of entropy convergence
- Spectral Theory. I Convergence to Projections
- Computational mechanics: pattern and prediction, structure and simplicity.
