OpenResearchAlpha

Entropy · 2 Nov 2026

Retrodicting Chaotic Systems: An Algorithmic Information Theory Approach

Kamal Dingleh-index 11, Boumediene Hamzi, Marcus Hutterh-index 43, Houman Owhadih-index 14

3
Citations
OpenAlex's count; others 0
0
Citations in 2026
so far
43
Leading author's h-index
Marcus Hutter, in QAI's scholar index
59
References
works it cites, from open citation data

Citations by database

Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.

  • OpenAlex3
  • OpenCitations0
  • Crossref0

Citations per year

The current year is still counting.

  • 2026 so far0

Abstract

Making accurate inferences about data is a key task in science and mathematics. Here, we study the problem of retrodiction, inferring past values of a series, in the context of chaotic dynamic systems. Specifically, we are interested in inferring the starting value x0 in the series x0, x1, x2,…, xn given the value of xn and the associated function f, which determines the series as f (xi) = xi+1. Even in the deterministic case, this is a challenging problem due to mixing and the typical exponentially many candidate past values in the preimage of any given value xn (e.g., a current observation). We study this task from the perspective of algorithmic information theory, which motivates searching for the ‘simplest’ value in the set of candidates. Different methods for estimating candidate (conditional) complexity are examined, including to look for values in the lowest-density regions. We test these methods numerically on the logistic map, Tent map, Bernoulli map, and Julia/Mandelbrot map, which are well-studied maps in chaos theory. The methods aid in retrodiction by assigning low ranks to the candidates that are more likely to be the true starting value. Our approach works well in some parameter and map cases, while several other retrodiction techniques perform poorly. Nonetheless, our approach is not effective in all cases, and several open problems remain including computational cost and sensitivity to noise. We also give an explicit description-length-weighted covariance construction supporting a Gaussian-process research direction, without identifying all candidate ranking methods as Gaussian processes.

What the data shows

  • OpenAlex counts 3 citations, the most of the databases. The others count 0.
  • Marcus Hutter has the highest h-index among the authors (43).

Graph

This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.

Citing paper shares an authorAuthor without a profileSize shows citations, or h-index for authors

Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.

Start with

Authors (4)

Each author's standing in QAI's scholar index: the works their ORCID iD is attached to, and for anyone whose ORCID record names a lab OpenResearch follows, their arXiv preprints matched by name and a shared co-author. Names are as printed on the paper.

ProfileMost-cited paper

Cited by 0 papers

Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.

0 shown
No citing papers for this filter.

References (59)

What it cites, from open citation data, with Crossref's record of each.

Sign in to see 39 more references

A free account opens the rest of the citing papers and references on every paper’s page.