no code implementations • 27 Dec 2023 • James P. Crutchfield, David D. Dunn, Alexandra M. Jurgens
Recording the undersea three-dimensional bioacoustic sound field in real-time promises major benefits to marine behavior studies.
no code implementations • 23 Nov 2023 • Adam T. Rupe, James P. Crutchfield
After more than a century of concerted effort, physics still lacks basic principles of spontaneous self-organization.
1 code implementation • 25 Apr 2023 • Adam Rupe, Karthik Kashinath, Nalini Kumar, James P. Crutchfield
Spontaneous self-organization is ubiquitous in systems far from thermodynamic equilibrium.
no code implementations • 25 Mar 2023 • Sarah E. Marzen, Paul M. Riechers, James P. Crutchfield
One conclusion is that large probabilistic state machines -- specifically, large $\epsilon$-machines -- are key to generating challenging and structurally-unbiased stimuli for ground-truthing recurrent neural network architectures.
no code implementations • 9 Jun 2022 • Samuel P. Loomis, James P. Crutchfield
Predictive states for stochastic processes are a nonparametric and interpretable construct with relevance across a multitude of modeling paradigms.
no code implementations • 19 Sep 2021 • Samuel P. Loomis, James P. Crutchfield
Predictive equivalence in discrete stochastic processes have been applied with great success to identify randomness and structure in statistical physics and chaotic dynamical systems and to inferring hidden Markov models.
1 code implementation • 23 Nov 2020 • Nicolas Brodu, James P. Crutchfield
A structural representation -- a finite- or infinite-state kernel $\epsilon$-machine -- is extracted by a reduced-dimension transform that gives an efficient representation of causal states and their topology.
1 code implementation • 12 Oct 2020 • Adam Rupe, James P. Crutchfield
Local causal states are latent representations that capture organized pattern and structure in complex spatiotemporal systems.
no code implementations • 29 Aug 2020 • Alexandra M. Jurgens, James P. Crutchfield
We also show how this method gives the minimal set of infinite predictive features.
no code implementations • ICLR 2020 • Sarah Marzen, James P. Crutchfield
The inference of models, prediction of future symbols, and entropy rate estimation of discrete-time, discrete-event processes is well-worn ground.
2 code implementations • 25 Sep 2019 • Adam Rupe, Nalini Kumar, Vladislav Epifanov, Karthik Kashinath, Oleksandr Pavlyk, Frank Schlimbach, Mostofa Patwary, Sergey Maidanov, Victor Lee, Prabhat, James P. Crutchfield
Extracting actionable insight from complex unlabeled scientific data is an open challenge and key to unlocking data-driven discovery in science.
no code implementations • 16 Sep 2019 • Adam Rupe, Karthik Kashinath, Nalini Kumar, Victor Lee, Prabhat, James P. Crutchfield
Extreme weather is one of the main mechanisms through which climate change will directly impact human society.
no code implementations • 1 Jan 2018 • Adam Rupe, James P. Crutchfield
The approach is behavior-driven in the sense that it does not rely on directly analyzing spatiotemporal equations of motion, rather it considers only the spatiotemporal fields a system generates.
no code implementations • 18 Oct 2017 • James P. Crutchfield
The principle goal of computational mechanics is to define pattern and structure so that the organization of complex systems can be detected and quantified.
no code implementations • 19 Sep 2017 • Ryan G. James, Jeffrey Emenheiser, James P. Crutchfield
The dependency decomposition then allows us to define a measure of the information about a target that can be uniquely attributed to a particular source as the least amount which the source-target statistical dependency can influence the information shared between the sources and the target.
no code implementations • 27 Feb 2017 • Sarah E. Marzen, James P. Crutchfield
Scientific explanation often requires inferring maximally predictive features from a given data set.
no code implementations • 7 Feb 2017 • Ryan G. James, John R. Mahoney, James P. Crutchfield
The theoretically ideal implementation is the use of minimal sufficient statistics, where it is well-known that either X or Y can be replaced by their minimal sufficient statistic about the other while preserving the mutual information.
no code implementations • 17 Sep 2016 • Alexander B. Boyd, Dibyendu Mandal, James P. Crutchfield
Employing computational mechanics and a new information-processing Second Law of Thermodynamics (IPSL) we remove these restrictions, analyzing general finite-state ratchets interacting with structured environments that generate correlated input signals.
no code implementations • 5 Sep 2016 • Ryan G. James, James P. Crutchfield
Accurately determining dependency structure is critical to discovering a system's causal organization.
no code implementations • 2 Jul 2015 • Pooneh M. Ara, Ryan G. James, James P. Crutchfield
When this occurs, the present captures all of the dependency between past and future.
no code implementations • 18 Apr 2015 • Sarah E. Marzen, Michael R. DeWeese, James P. Crutchfield
A first step towards that larger goal is to develop information measures for individual output processes, including information generation (entropy rate), stored information (statistical complexity), predictable information (excess entropy), and active information accumulation (bound information rate).
no code implementations • 1 Apr 2015 • James P. Crutchfield, Sarah Marzen
We introduce a simple analysis of the structural complexity of infinite-memory processes built from random samples of stationary, ergodic finite-memory component processes.
no code implementations • 30 Dec 2014 • James P. Crutchfield, Ryan G. James, Sarah Marzen, Dowman P. Varn
We recount recent history behind building compact models of nonlinear, complex processes and identifying their relevant macroscopic patterns or "macrostates".
no code implementations • 9 Dec 2014 • Sarah Marzen, James P. Crutchfield
Predictive rate-distortion analysis suffers from the curse of dimensionality: clustering arbitrarily long pasts to retain information about arbitrarily long futures requires resources that typically grow exponentially with length.
no code implementations • 5 Sep 2013 • Christopher C. Strelioff, James P. Crutchfield
Properties of epsilon-machines and uHMMs allow for the derivation of analytic expressions for estimating transition probabilities, inferring start states, and comparing the posterior probability of candidate model topologies, despite process internal structure being only indirectly present in data.