Predictive complexity and information

DOI10.1016/j.jcss.2004.10.005zbMath1101.68617OpenAlexW1551234435MaRDI QIDQ1780450

Vladimir V. V'yugin, Michael V. Vyugin

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)

Related Items (1)

Predictive Complexity for Games with Finite Outcome Spaces

Cites Work

• A game of prediction with expert advice
• Does snooping help?
• On complexity of easy predictable sequences
• How to use expert advice
• Complexity Approximation Principle
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Predictive complexity and information