## Abstract

We introduce the study a general, abstract game played between two players called the drifter and the adversary. The game is played in a series of rounds using a finite set of 'chips' which are moved about in R^{n}. On each round, the drifter assigns a desired direction of movement and an importance weight to each of the chips. The adversary then moves the chips in any way that need only be weakly correlated with the desired directions assigned by the drifter. The drifter's goal is to cause the chips to be moved to low-loss positions, where the loss of each chip at its final position is measured by a given loss function. We present a drifter algorithm for this game and prove an upper bound on its performance. We also prove a lower bound showing that the algorithm is essentially optimal for a large number of chips. We discuss computational methods for efficiently implementing our algorithm. We show that our general drifting-game algorithm subsumes some well studied boosting and on-line learning algorithms whose analyses follow as easy corollaries of our general result.

Original language | English (US) |
---|---|

Pages | 114-124 |

Number of pages | 11 |

State | Published - Dec 1 1999 |

Externally published | Yes |

Event | Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99) - Santa Cruz, CA, USA Duration: Jul 6 1999 → Jul 9 1999 |

### Conference

Conference | Proceedings of the 1999 12th Annual Conference on Computational Learning Theory (COLT'99) |
---|---|

City | Santa Cruz, CA, USA |

Period | 7/6/99 → 7/9/99 |

## All Science Journal Classification (ASJC) codes

- Computational Mathematics