Name
Abstract | ||
|---|---|---|
We consider a linear regression game in which the covariates are known in advance: at each round, the learner predicts a real-value, the adversary reveals a label, and the learner incurs a squared error loss. The aim is to minimize the regret with respect to linear predictions. For a variety of constraints on the adversary’s labels, we show that the minimax optimal strategy is linear, with a parameter choice that is reminiscent of ordinary least squares (and as easy to compute). The predictions depend on all covariates, past and future, with a particular weighting assigned to future covariates corresponding to the role that they play in the minimax regret. We study two families of label sequences: box constraints (under a covariate compatibility condition), and a weighted 2-norm constraint that emerges naturally from the analysis. The strategy is adaptive in the sense that it requires no knowledge of the constraint set. We obtain an explicit expression for the minimax regret for these games. For the case of uniform box constraints, we show that, with worst case covariate sequences, the regret is O(d\log T), with no dependence on the scaling of the covariates. |
Year | Venue | Field |
|---|---|---|
2015 | COLT | Mathematical optimization,Minimax,Weighting,Covariate,Regret,Ordinary least squares,Mean squared error,Artificial intelligence,Scaling,Mathematics,Machine learning,Linear regression |
DocType | Citations | PageRank |
Conference | 2 | 0.40 |
References | Authors | |
4 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter L. Bartlett | 1 | 5482 | 1039.97 |
| Wouter M. Koolen | 2 | 87 | 17.35 |
| Alan Malek | 3 | 5 | 2.29 |
| Eiji Takimoto | 4 | 252 | 49.44 |
| Manfred K. Warmuth | 5 | 6105 | 1975.48 |