Showing cs.ITShow all
2 papers · 1 filter
cs.IT2026
The Preisach Extremum Stack is a Shannon-Minimal Sufficient Statistic for Rate-Independent Functionals
Piotr Frydrych
Let R denote the class of all computable, causal functionals that are rate-independent in the classical sense (invariant under monotone time reparametrizations), and let Pi_n be th…
cs.IT2026
The Extremum Stack is a Minimal Sufficient Statistic for Rate-Independent Functionals: A Kolmogorov Complexity Characterisation
Piotr Frydrych
We prove that the extremum stack of a discrete sequence is a minimal sufficient statistic for the class of all computable, causal, rate-independent functionals, in the sense of Kol…