Suboptimal measures of predictive complexity for absolute loss function
type: Item
instance of: scholarly article
title: Suboptimal measures of predictive complexity for absolute loss function
zbMATH Open document ID: 1012.68089
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 1853264
author: Vladimir V. V'yugin
MaRDI profile type: Publication
full work available at URL: inco.2001.3066
OpenAlex ID: W1969965307
cites work: Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
cites work: How to use expert advice
cites work: Q4337021
cites work: The weighted majority algorithm
cites work: Stochastic complexity and modeling
cites work: Q5573961
cites work: A game of prediction with expert advice
cites work: Complexity Approximation Principle
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.1006/INCO.2001.3066
description: scientific article; zbMATH DE number 1853264