Name
Title | ||
|---|---|---|
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning. |
Abstract | ||
|---|---|---|
We investigate contextual online learning with nonparametric (Lipschitz) comparison classes under different assumptions on losses and feedback information. For full information feedback and Lipschitz losses, we design the first explicit algorithm achieving the minimax regret rate (up to log factors). In a partial feedback model motivated by second-price auctions, we obtain algorithms for Lipschitz and semi-Lipschitz losses with regret bounds improving on the known bounds for standard bandit feedback. Our analysis combines novel results for contextual second-price auctions with a novel algorithmic approach based on chaining. When the context space is Euclidean, our chaining approach is efficient and delivers an even better regret bound. |
Year | Venue | Field |
|---|---|---|
2017 | COLT | Computer science,Theoretical computer science,Common value auction,Information feedback,Lipschitz continuity,Artificial intelligence,Euclidean geometry,Online learning,Mathematical optimization,Chaining,Regret,Nonparametric statistics,Machine learning |
DocType | Citations | PageRank |
Conference | 2 | 0.37 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolò Cesa-Bianchi | 1 | 4609 | 590.83 |
| Pierre Gaillard | 2 | 79 | 10.89 |
| Claudio Gentile | 3 | 1166 | 107.46 |
| Sébastien Gerchinovitz | 4 | 10 | 2.90 |