Ultimate limit on learning non-Markovian behavior: Fisher information rate and excess information
Not on the map. Why?
Abstract (arXiv)
We address the fundamental limits of learning unknown parameters of any stochastic process from time-series data, and discover exact closed-form expressions for how optimal inference scales with observation length. Given a parametrized class of candidate models, the Fisher information of observed sequence probabilities lower-bounds the variance in model estimation from finite data. As sequence-length increases, the minimal variance scales as the square inverse of the length -- with constant coefficient given by the information rate. We discover a simple closed-form expression for this information rate, even in the case of infinite Markov order. We furthermore obtain the exact analytic lower bound on model variance from the observation-induced metadynamic among belief states. We discover ephemeral, exponential, and more general modes of convergence to the asymptotic information rate. Surprisingly, this myopic information rate converges to the asymptotic Fisher information rate with exactly the same relaxation timescales that appear in the myopic entropy rate as it converges to the Shannon entropy rate for the process. We illustrate these results with a sequence of examples that highlight qualitatively distinct features of stochastic processes that shape optimal learning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 33 references that are in the map. First posted on arXiv 6 Oct 2023.
Builds on
4 of 33 references.
References · 4
- 2017Attention Is All You Needcited by 60,361
- 2020Shannon Entropy Rate of Hidden Markov Processescited by 8
- 2013Bayesian Structural Inference for Hidden Processescited by 5
- 2023Complexity-calibrated Benchmarks for Machine Learning Reveal When Next-Generation Reservoir Computer Predictions Succeed and Misleadcited by 2
Built on by
Not cited yet.