Metraipolis › archive › dc_fe50edda86ac
Ladder of information limits on prediction for reduced-order models — arXiv:2609.19424
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19424
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T05:01:27.896Z
- SHA-256 of the archived text
da0cfba5a53e38feada072426b79ce311e8755908f171361278834263324edb1- Stable URL of this page
https://metraipolis.com/documento/dc_fe50edda86ac
How to cite
Ladder of information limits on prediction for reduced-order models — arXiv:2609.19424 — arXiv (en), https://arxiv.org/abs/2609.19424 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe50edda86ac (Metraipolis archive dc_fe50edda86ac, sha256 da0cfba5a53e38feada072426b79ce311e8755908f171361278834263324edb1)
BibTeX
@misc{dcfe50edda86ac,
title = {Ladder of information limits on prediction for reduced-order models — arXiv:2609.19424},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19424},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe50edda86ac; sha256 da0cfba5a53e38feada072426b79ce311e8755908f171361278834263324edb1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19424. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
What can and cannot be predicted by a model when only limited information is available? We answer this question by constructing a ladder of information limits that organizes prediction tasks according to their information requirements: from memoryless and memory-augmented trajectory forecasts to event prediction, stationary statistics, and generative laws. The analysis, which is independent of the model structure or architecture, identifies the minimum attainable error along with the information limitations that give rise to it. The approach distinguishes information hidden in unresolved variables from information recovered through time-delayed observations and connects these contributions to Mori--Zwanzig memory. The ladder also reveals why Lyapunov growth alone cannot characterize reduced-order prediction error, why stationary statistics may remain predictable even when individual trajectories become unpredictable, and why stochasticity can represent (but cannot recover) missing information. Numerical studies of the Kuramoto--Sivashinsky equation and the Lorenz system illustrate these results across the ladder. This unified perspective provides a principled language for understanding the fundamental limitations of ROMs for a given prediction task and for clarifying whether improved predictions require richer observations, greater precision in the input, or additional memory. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.IT). Categorie arXiv: Chaotic Dynamics (nlin.CD) ; Information Theory (cs.IT); Computational Physics (physics.comp-ph). Pagina del lavoro: https://arxiv.org/abs/2609.19424 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T04:21:23.500Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).