## Abstract

The problem of existence of predictive complexity for the absolute loss game is studied. Predictive complexity is a generalization of Kolmogorov complexity which bounds the ability of any algorithm to predict elements of a sequence of outcomes. For perfectly mixable loss functions (logarithmic and squared difference are among them) predictive complexity is defined like Kolmogorov complexity to within an additive constant. The absolute loss function is not perfectly mixable, and the question of existence of the corresponding predictive complexity, which is defined to within an additive constant, is open. We prove that in the case of the absolute loss game the predictive complexity can be defined to within an additive term O(√n), where n is the length of a sequence of outcomes. We prove also that in some restricted settings this bound cannot be improved.

Original language | English |
---|---|

Pages (from-to) | 146-157 |

Number of pages | 12 |

Journal | Information and Computation |

Volume | 175 |

Issue number | 2 |

DOIs | |

Publication status | Published - 15 Jun 2002 |

Externally published | Yes |