Predictive complexity and information
type: Item
instance of: scholarly article
title: Predictive complexity and information
zbMATH Open document ID: 1101.68617
author: Michael V. Vyugin
author: Vladimir V. V'yugin
published in: Journal of Computer and System Sciences
publication date: 2005-06-13T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 2175391
zbMATH Keywords: Machine learning
zbMATH Keywords: Algorithmic prediction
zbMATH Keywords: Predictive complexity
zbMATH Keywords: Predictive information
zbMATH Keywords: Loss functions
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: Expanding property
MaRDI profile type: Publication
full work available at URL: j.jcss.2004.10.005
OpenAlex ID: W1551234435
cites work: How to use expert advice
cites work: Q3619797
cites work: Q4337021
cites work: Q5573961
cites work: A game of prediction with expert advice
cites work: Complexity Approximation Principle
cites work: Does snooping help?
cites work: On complexity of easy predictable sequences
cites work: Q3046697
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
DOI: 10.1016/J.JCSS.2004.10.005
description: scientific article; zbMATH DE number 2175391