An empirical study of the complexity and randomness of prediction error sequences

DOI10.1016/J.CNSNS.2010.10.015MaRDI QIDQ718610zbMATH OpenOpenAlexFDO

Authors Joel Ratsaby

Publication date 23 September 2011

Published in Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cnsns.2010.10.015

zbMATH Keywords

predictionstatistical learninginformation theorybinary sequenceschaotic scatteringalgorithmic complexitydescription complexity

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Complexity and performance of numerical algorithms (65Y20) Computational learning theory (68Q32)

Recommendations

• Algorithmic complexity bounds on future prediction errors
• A simple randomized algorithm for sequential prediction of ergodic time series
• Predictability, complexity, and learning
• Most sequences are stochastic
• Algorithmic Learning Theory

Cites work

• scientific article; zbMATH DE number 4071998 (Why is no real title available?)
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)
• scientific article; zbMATH DE number 893887 (Why is no real title available?)
• A New Interpretation of the von Mises' Concept of Random Sequence
• A universal algorithm for sequential data compression
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• Can an individual sequence of zeros and ones be random?
• Computing and Combinatorics
• Elements of Information Theory
• Interaction of a self vibrating beam with chaotic external forces
• Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
• Kolmogorov-Loveland stochasticity for finite strings
• Model selection and error estimation
• Neural Network Learning
• On tables of random numbers
• On the algorithmic complexity of static structures
• Some Properties of Kolmogorov $\Delta$-Random Finite Sequences
• The definition of random sequences

Cited in

(5)

• Universal prediction of random binary sequences in a noisy environment
• On the algorithmic complexity of static structures
• Recurrence quantity analysis based on singular value decomposition
• Predictability, complexity, and learning
• ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS

This page was built for publication: An empirical study of the complexity and randomness of prediction error sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q718610)