No Internal Regret via Neighborhood Watch

Loading...
Thumbnail Image
Penn collection
Statistics Papers
Degree type
Discipline
Subject
Applied Statistics
Statistics and Probability
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Foster, Dean P
Rakhlin, Alexander
Contributor
Abstract

We present an algorithm which attains O(√T) internal (and thus external) regret for finite games with partial monitoring under the local observability condition. Recently, this condition has been shown by Bartok, Pal, and Szepesvari (2011) to imply the O(√T) rate for partial monitoring games against an i.i.d. opponent, and the authors conjectured that the same holds for non-stochastic adversaries. Our result is in the affirmative, and it completes the characterization of possible rates for finite partial-monitoring games, an open question stated by Cesa-Bianchi, Lugosi, and Stoltz (2006). Our regret guarantees also hold for the more general model of partial monitoring with random signals.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2012-01-01
Journal title
Journal of Machine Learning Research
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection