Fetching the paper…
Reading the bibliography…
We design and analyze algorithms for online linear optimization that have optimal regret and at the same time do not need to know any upper or lower bounds on the norm of the loss vectors.
F. Rosenblatt, The Perceptron: A Probabilistic Model for Information Storage and Organization in the Brain, Psychological Review 65 (6) (1958) 386
1958
Earlier work this paper cites.
A. Nemirovski, D. B. Yudin, Problem Complexity and Method Efficiency in Optimization, Wiley, 1983
1983
Earlier work this paper cites.
N. Littlestone, M. K. Warmuth, The Weighted Majority Algorithm, Information and Computation 108 (2) (1994) 212–261
1994
Earlier work this paper cites.
Y. Freund, R. E. Schapire, A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting, Journal of Computer and System Sciences 55 (1) (1997) 119–139
1997
Earlier work this paper cites.
N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, M. K. Warmuth, How to Use Expert Advice, Journal of the ACM 44 (3) (1997) 427–485
1997
Earlier work this paper cites.
J. Kivinen, M. K. Warmuth, Exponentiated Gradient versus Gradient Descent for Linear Predictors, Information and Computation 132 (1) (1997) 1–63
1997
Earlier work this paper cites.
V. Vovk, A Game of Prediction with Expert Advice, Journal of Computer and System Sciences 56 (1998) 153–173
1998
Earlier work this paper cites.
Y. Freund, R. E. Schapire, Large Margin Classification Using the Perceptron Algorithm, Machine Learning 37 (3) (1999) 277–296
1999
Earlier work this paper cites.
P. Auer, N. Cesa-Bianchi, C. Gentile, Adaptive and Self-Confident On-line Learning Algorithms, Journal of Computer and System Sciences 64 (1) (2002) 48–75
2002
Earlier work this paper cites.
M. Zinkevich, Online Convex Programming and Generalized Infinitesimal Gradient Ascent, in: T. Fawcett, N. Mishra (Eds.), Proceedings of 20th International Conference On Machine Learning (ICML 2003), Washington, DC, USA, August 21-24, AAAI Press, 928–936, 2003
2003
Earlier work this paper cites.
A. Beck, M. Teboulle, Mirror Descent and Nonlinear Projected Subgradient Methods for Convex optimization, Operations Research Letters 31 (3) (2003) 167–175
2003
Earlier work this paper cites.
A. Kalai, S. Vempala, Efficient Algorithms for Online Decision Problems, Journal of Computer and System Sciences 71 (3) (2005) 291–307
2005
Earlier work this paper cites.
Y. Nesterov, Primal-dual Subgradient Methods for Convex Problems, Mathematical programming 120 (1) (2009) 221–259, appeared early as CORE discussion paper 2005/67, Catholic University of Louvain, Center for Operations Research and Econometrics
2005
Earlier work this paper cites.
N. Cesa-Bianchi, G. Lugosi, Prediction, Learning, and Games, Cambridge University Press Cambridge, 2006
2006
Earlier work this paper cites.
S. Shalev-Shwartz, Online Learning: Theory, Algorithms, and Applications, Ph.D. thesis, Hebrew University, Jerusalem, 2007
2007
Earlier work this paper cites.
A. Rakhlin, K. Sridharan, Lecture Notes on Online Learning, available from: http://www-stat.wharton.upenn.edu/~rakhlin/courses/stat991/papers/lecture_notes.pdf , 2009
2009
Cited alongside, same era.
D. P. Helmbold, M. K. Warmuth, Learning Permutations with Exponential Weights, Journal of Machine Learing Research 10 (2009) 1705–1736
2009
Cited alongside, same era.
W. M. Koolen, M. K. Warmuth, J. Kivinen, Hedging Structured Concepts, in: Proceedings of the 23rd Annual Conference on Computational Learning Theory (COLT), Haifa, Israel, June 27-29, 2010, 93–105, 2010
2010
Cited alongside, same era.
L. Xiao, Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization, Journal of Machine Learing Research 11 (2010) 2543–2596
2010
Cited alongside, same era.
H. B. McMahan, G. Holt, D. Sculley, M. Young, D. Ebner, J. Grady, L. Nie, T. Phillips, E. Davydov, D. Golovin, S. Chikkerur, D. Liu, M. Wattenberg, A. M. Hrafnkelsson, T. Boulos, J. Kubica, Ad Click Prediction: a View from the Trenches, in: Proceedings of the 19th International Conference on Knowledge Discovery and Data Mining (KDD 2013), August 11-14, Chicago, Illinois, USA, ACM, 1222–1230, 2013
2013
Later among the works it cites.
A. Rakhlin, K. Sridharan, Optimization, Learning, and Games with Predictable Sequences, in: C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, K. Q. Weinberger (Eds.), Advances in Neural Information Processing Systems 26 (NIPS 2013), 3066–3074, 2013
2013
Later among the works it cites.
H. B. McMahan, J. Abernethy, Minimax Optimal Algorithms for Unconstrained Linear Optimization, in: C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, K. Q. Weinberger (Eds.), Advances in Neural Information Processing Systems 26 (NIPS 2013), 2724–2732, 2013
2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
J. Duchi, S. Shalev-Shwartz, Y. Singer, A. Tewari, Composite Objective Mirror Descent, in: A. T. Kalai, M. Mohri (Eds.), Proceedings of the 23rd Annual Conference on Computational Learning Theory (COLT), Haifa, Israel, June 27-29, 2010, 14–26, 2010
2010
Cited alongside, same era.
M. Streeter, H. B. McMahan, Less Regret via Online Conditioning, arXiv:1002.4862, 2010
2010
Cited alongside, same era.
T. Jaksch, R. Ortner, P. Auer, Near-optimal Regret Bounds for Reinforcement Learning, Journal of Machine Learing Research 11 (2010) 1563–1600
2010
Cited alongside, same era.
S. Shalev-Shwartz, Online Learning and Online Convex Optimization, Foundations and Trends in Machine Learning 4 (2) (2011) 107–194
2011
Cited alongside, same era.
J. Duchi, E. Hazan, Y. Singer, Adaptive Subgradient Methods for Online Learning and Stochastic Optimization, Journal of Machine Learing Research 12 (2011) 2121–2159
2011
Cited alongside, same era.
N. Srebro, K. Sridharan, A. Tewari, On the Universality of Online Mirror Descent, in: J. Shawe-Taylor, R. S. Zemel, P. L. Bartlett, F. Pereira, K. Q. Weinberger (Eds.), Advances in Neural Information Processing Systems 24 (NIPS 2011), 2645–2653, 2011
2011
Cited alongside, same era.
S. Bubeck, N. Cesa-Bianchi, Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems, Foundations and Trends in Machine Learning 5 (1) (2012) 1–122
2012
Cited alongside, same era.
F. Orabona, Dimension-Free Exponentiated Gradient, in: C. J. C. Burges, L. Bottou, M. Welling, Z. Ghahramani, K. Q. Weinberger (Eds.), Advances in Neural Information Processing Systems 26 (NIPS 2013), 1806–1814, 2013
2013
Later among the works it cites.
H. B. McMahan, Analysis Techniques for Adaptive Online Learning, arXiv:1403.3465, 2014
2014
Later among the works it cites.
S. de Rooij, T. van Erven, P. D. Grünwald, W. M. Koolen, Follow the Leader If You Can, Hedge If You Must, Journal of Machine Learing Research 15 (2014) 1281–1316
2014
Later among the works it cites.
F. Orabona, K. Crammer, N. Cesa-Bianchi, A Generalized Online Mirror Descent with Applications to Classification and Regression, Machine Learning 99 (2014) 411–435
2014
Later among the works it cites.
2014
Later among the works it cites.
H. B. McMahan, F. Orabona, Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations, in: M. F. Balcan, C. Szepesvári (Eds.), Proceedings of The 27th Conference on Learning Theory (COLT 2014), vol. 35, 1020–1039, 2014
2014
Later among the works it cites.
F. Orabona, Simultaneous Model Selection and Optimization Through Parameter-Free Stochastic Learning, in: Z. Ghahramani, M. Welling, C. Cortes, N. D. Lawrence, K. Q. Weinberger (Eds.), Advances in Neural Information Processing Systems 27 (NIPS 2014), 1116–1124, 2014
2014
Later among the works it cites.
F. Orabona, D. Pál, Scale-Free Algorithms for Online Linear Optimization, in: K. Chaudhuri, C. Gentile, S. Zilles (Eds.), Proceedings of 26th International Conference on Algorithmic Learning Theory, ALT 2015, Banff, AB, Canada, October 4-6, 287–301, 2015
2015
Later among the works it cites.
S. Bubeck, Convex Optimization: Algorithms and Complexity, Foundations and Trends in Machine Learning 8 (3–4) (2015) 231–357
2015
Later among the works it cites.
F. Orabona, D. Pál, Coin Betting and Parameter-Free Online Learning, in: U. von Luxburg, I. Guyon (Eds.), Advances in Neural Information Processing Systems 29 (NIPS 2016), Curran Associates, Inc., to appear, 2016
2016
Closest in time.
A. Cutkosky, K. Boahen, Online Convex Optimization with Unconstrained Domains and Losses, in: U. von Luxburg, I. Guyon (Eds.), Advances in Neural Information Processing Systems 29 (NIPS 2016), Curran Associates, Inc., to appear, 2016
2016
Closest in time.