Predictive complexity and information

DOI10.1016/J.JCSS.2004.10.005MaRDI QIDQ1780450zbMATH OpenOpenAlexFDO

Authors Michael V. Vyugin, Vladimir V. V'yugin

Publication date 13 June 2005

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2004.10.005

zbMATH Keywords

Kolmogorov complexityMachine learningPredictive complexityLoss functionsAlgorithmic predictionExpanding propertyPredictive information

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 2089356
• On complexity of easy predictable sequences
• How many strings are easy to predict?
• scientific article; zbMATH DE number 2080658
• General linear relations between different types of predictive complexity

Cites work

• scientific article; zbMATH DE number 2089356 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A game of prediction with expert advice
• Complexity Approximation Principle
• Does snooping help?
• How to use expert advice
• On complexity of easy predictable sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS

Cited in

(19)

• Generalised Entropy and Asymptotic Complexities of Languages
• Simulation complexity
• General linear relations between different types of predictive complexity
• Predictive complexity and generalized entropy rate of stationary ergodic processes
• scientific article; zbMATH DE number 1834031 (Why is no real title available?)
• Predictability: An Information-Theoretic Perspective
• Predictive information and explorative behavior of autonomous robots
• Prediction, retrodiction, and the amount of information stored in the present
• scientific article; zbMATH DE number 2089356 (Why is no real title available?)
• Predictive Complexity for Games with Finite Outcome Spaces
• How many strings are easy to predict?
• Quantifying predictability through information theory: small sample estimation in a non-Gaussian framework
• How many strings are easy to predict?
• On complexity of easy predictable sequences
• Suboptimal measures of predictive complexity for absolute loss function
• Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
• scientific article; zbMATH DE number 2080658 (Why is no real title available?)
• Predictability, complexity, and learning
• A measure of statistical complexity based on predictive information with application to finite spin systems

This page was built for publication: Predictive complexity and information

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