Fetching the paper…
Reading the bibliography…
In this paper, we address tracking of a time-varying parameter with unknown dynamics.
R. E. Kalman, “A new approach to linear filtering and prediction problems,” Journal of Fluids Engineering , vol. 82, no. 1, pp. 35–45, 1960
1960
Earlier work this paper cites.
A. S. Nemirovski and D. B. Yudin, Problem complexity and method efficiency in optimization . Wiley (Chichester and New York), 1983
1983
Earlier work this paper cites.
Y. Freund and R. E. Schapire, “A decision-theoretic generalization of on-line learning and an application to boosting,” Journal of computer and system sciences , vol. 55, no. 1, pp. 119–139, 1997
1997
Earlier work this paper cites.
M. Herbster and M. K. Warmuth, “Tracking the best expert,” Machine Learning , vol. 32, no. 2, pp. 151–178, 1998
1998
Earlier work this paper cites.
A. Beck and M. Teboulle, “Mirror descent and nonlinear projected subgradient methods for convex optimization,” Operations Research Letters , vol. 31, no. 3, pp. 167–175, 2003
2003
Earlier work this paper cites.
M. Zinkevich, “Online convex programming and generalized infinitesimal gradient ascent,” in International Conference on Machine Learning , 2003
2003
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2004
2004
Earlier work this paper cites.
N. Cesa-Bianchi and G. Lugosi, Prediction, learning, and games . Cambridge University Press, 2006
2006
Cited alongside, same era.
E. Hazan, A. Agarwal, and S. Kale, “Logarithmic regret algorithms for online convex optimization,” Machine Learning , vol. 69, no. 2-3, pp. 169–192, 2007
2007
Cited alongside, same era.
E. Hazan and C. Seshadhri, “Adaptive algorithms for online decision problems,” in Electronic Colloquium on Computational Complexity (ECCC) , vol. 14, no. 088, 2007
2007
Cited alongside, same era.
S. Shalev-Shwartz, “Online learning and online convex optimization,” Foundations and Trends in Machine Learning , vol. 4, no. 2, pp. 107–194, 2011
2011
Cited alongside, same era.
2012
S. Rakhlin and K. Sridharan, “Optimization, learning, and games with predictable sequences,” in Advances in Neural Information Processing Systems , 2013, pp. 3066–3074
2013
Later among the works it cites.
O. Besbes, Y. Gur, and A. Zeevi, “Non-stationary stochastic optimization,” Operations Research , vol. 63, no. 5, pp. 1227–1244, 2015
2015
Later among the works it cites.
E. Hall and R. Willett, “Online convex optimization in dynamic environments,” IEEE Journal of Selected Topics in Signal Processing , vol. 9, no. 4, pp. 647–662, June 2015
2015
Later among the works it cites.
A. Jadbabaie, A. Rakhlin, S. Shahrampour, and K. Sridharan, “Online optimization: Competing with dynamic comparators,” in Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics , 2015, pp. 398–406
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin, and S. Zhu, “Online optimization with gradual variations.” in Conference on Learning Theory , 2012
2012
Cited alongside, same era.
A. Rakhlin and K. Sridharan, “Online learning with predictable sequences,” in Conference on Learning Theory , 2013, pp. 993–1019
2013
Cited alongside, same era.
A. Daniely, A. Gonen, and S. Shalev-shwartz, “Strongly adaptive online learning,” in Proceedings of the 32nd International Conference on Machine Learning (ICML-15) , 2015, pp. 1405–1411
2015
Later among the works it cites.
H. Luo and R. E. Schapire, “Achieving all with no parameters: Adanormalhedge,” in Proceedings of The 28th Conference on Learning Theory , 2015, pp. 1286–1304
2015
Later among the works it cites.