Optimal causal inference: Estimating stored information and approximating causal architecture

DOI10.1063/1.3489885zbMath1311.68055arXiv0708.1580OpenAlexW2964070029WikidataQ51898677 ScholiaQ51898677MaRDI QIDQ5251240

Susanne Still, Christopher J. Ellison, James P. Crutchfield

Publication date: 19 May 2015

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.1580

Mathematics Subject Classification ID

Filtering in stochastic control theory (93E11) Estimation and detection in stochastic control theory (93E10) Signal detection and filtering (aspects of stochastic processes) (60G35) Information storage and retrieval of data (68P20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (9)

Predictive rate-distortion for infinite-order Markov processes ⋮ Spectral simplicity of apparent complexity. I. The nondiagonalizable metadynamics of prediction ⋮ Computational mechanics of input-output processes: structured transformations and the \(\epsilon\)-transducer ⋮ THE INFORMATION BOTTLENECK METHOD FOR OPTIMAL PREDICTION OF MULTILEVEL AGENT-BASED SYSTEMS ⋮ Topology, convergence, and reconstruction of predictive states ⋮ The Deterministic Information Bottleneck ⋮ Shannon entropy rate of hidden Markov processes ⋮ Prediction and dissipation in nonequilibrium molecular sensors: conditionally Markovian channels driven by memoryful environments ⋮ Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation

Cites Work

• Prediction, retrodiction, and the amount of information stored in the present
• Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
• Toward a quantitative theory of self-generated complexity
• Regular and chaotic dynamics.
• The calculi of emergence: Computation, dynamics and induction
• Reductions of hidden information sources
• Finitary Codings and Weak Bernoulli Partitions
• INFORMATION BOTTLENECKS, CAUSAL STATES, AND STATISTICAL RELEVANCE BASES: HOW TO REPRESENT RELEVANT INFORMATION IN MEMORYLESS TRANSDUCTION
• How Many Clusters? An Information-Theoretic Perspective
• Nonlinear Time Series Analysis
• Synchronization and control in intrinsic and designed computation: An information-theoretic analysis of competing models of stochastic computation
• Elements of Information Theory
• An algorithm for computing the capacity of arbitrary discrete memoryless channels
• Computation of channel capacity and rate-distortion functions
• Regularities unseen, randomness observed: Levels of entropy convergence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal causal inference: Estimating stored information and approximating causal architecture