Suboptimal measures of predictive complexity for absolute loss function

DOI10.1006/inco.2001.3066zbMath1012.68089OpenAlexW1969965307MaRDI QIDQ1854535

Vladimir V. V'yugin

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3066

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items

Constructing perfect steganographic systems ⋮ Most sequences are stochastic

Cites Work

• Unnamed Item
• Unnamed Item
• Stochastic complexity and modeling
• A game of prediction with expert advice
• The weighted majority algorithm
• Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
• 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