## Abstract

Given a finite random sample from a Markov chain environment, we select a predictor that minimizes a criterion function and refer to it as being calibrated to its environment. If its prediction error is not bounded by its criterion value, we say that the criterion fails. We define the predictor’s complexity to be the amount of uncertainty in detecting that the criterion fails given that it fails. We define a predictor’s stability to be the discrepancy between the average number of prediction errors that it makes on two random samples. We show that complexity is inversely proportional to the level of adaptivity of the calibrated predictor to its random environment. The calibrated predictor becomes less stable as its complexity increases or as its level of adaptivity decreases.

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

Pages | 161-167 |

Number of pages | 7 |

State | Published - 1 Jan 2018 |

Externally published | Yes |

Event | 21st International Conference on Artificial Intelligence and Statistics, AISTATS 2018 - Playa Blanca, Lanzarote, Canary Islands, Spain Duration: 9 Apr 2018 → 11 Apr 2018 |

### Conference

Conference | 21st International Conference on Artificial Intelligence and Statistics, AISTATS 2018 |
---|---|

Country/Territory | Spain |

City | Playa Blanca, Lanzarote, Canary Islands |

Period | 9/04/18 → 11/04/18 |