Name
Abstract | ||
|---|---|---|
The framework of online learning with memory naturally captures learning problems with temporal effects, and was previously studied for the experts setting. In this work we extend the notion of learning with memory to the general Online Convex Optimization (OCO) framework, and present two algorithms that attain low regret. The first algorithm applies to Lipschitz continuous loss functions, obtaining optimal regret bounds for both convex and strongly convex losses. The second algorithm attains the optimal regret bounds and applies more broadly to convex losses without requiring Lipschitz continuity, yet is more complicated to implement. We complement the theoretical results with two applications: statistical arbitrage in finance, and multi-step ahead prediction in statistics. |
Year | Venue | DocType |
|---|---|---|
2015 | Annual Conference on Neural Information Processing Systems | Conference |
Volume | ISSN | Citations |
28 | 1049-5258 | 2 |
PageRank | References | Authors |
0.40 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oren Anava | 1 | 70 | 4.86 |
| Elad Hazan | 2 | 1619 | 111.90 |
| Shie Mannor | 3 | 3340 | 285.45 |