Dynamical models and tracking regret in online convex programming

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 579-587

  Hall, Eric C ^a   Willett, Rebecca M ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; LEARNING SYSTEMS;

DESCENT METHOD; DYNAMIC SCENES; DYNAMIC SOCIAL NETWORKS; DYNAMICAL MODEL; FORMING PREDICTIONS; ONLINE CONVEX OPTIMIZATIONS; ONLINE OPTIMIZATION; SMALL VARIATIONS;

COMPARATORS (OPTICAL);

EID: 84897553108     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Angelosante, D., Giannakis, G. B., and Grossi, E. Compressed sensing of time-varying signals. In Intl Conf. on Dig. Sig. Proc., 2009.
2. Bain, A. and Crisan, D. Fundamentals of Stochastic Filtering. Springer, 2009.
3. Banerjee, O., El Ghaoui, L., and d'Aspremont, A. Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data. J. Mach. Learn. Res., 9:485-516, 2008. (Pubitemid 351469014)
4. Beck, A. and Teboulle, M. Mirror descent and nonlinear projected subgradient methods for convex programming. Operations Research Letters, 31:167-175, 2003.
5. Belkin, M. and Niyogi, P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput., 15(6):1373-1396, June 2003. (Pubitemid 37049796)
6. Candes, E., Romberg, J., and Tao, T. Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics, 59(8):1207-1223, 2006. (Pubitemid 43988295)
7. Cesa-Bianchi, N. and Lugosi, G. Prediction, Learning and Games. Cambridge University Press, New York, 2006.
8. Cesa-Bianchi, N., Gaillard, P., Lugosi, G., and Stoltz, G. A new look at shifting regret. arXiv:1202.3323, 2012.
9. Duarte, M. F., Davenport, M. A., Takhar, D., Laska, J. N., Sun, T., Kelly, K. F., and Baraniuk, R. G. Single pixel imaging via compressive sampling. IEEE Sig. Proc. Mag., 25(2):83-91, 2008.
10. Duchi, J., Shalev-Shwartz, S., Singer, Y., and Tewari, A. Composite objective mirror descent. In Conf. on Learning Theory (COLT), 2010.
11. Gyorgy, A., Linder, T., and Lugosi, G. Efficient tracking of large classes of experts. IEEE Transaction on Information Theory, 58:6709-6725, November 2012.
12. Hazan, E. and Seshadhri, C. Efficient learning algorithms for changing environments. In Proc. Int. Conf on Machine Learning (ICML), pp. 393-400, 2009.
13. Herbster, M. and Warmuth, M. K. Tracking the best linear predictor. Journal of Machine Learning Research, 35(3):281-309, 2001. (Pubitemid 33687205)
14. Kolar, M., Song, L., Ahmed, A., and Xing, E. P. Estimating time-varying networks. Annals of Applied Statistics, 4(1):94-123, 2010.
15. Langford, J., Li, L., and Zhang, T. Sparse online learning via truncated gradient. J. Mach. Learn. Res., 10: 777-801, 2009.
16. Littlestone, N. and Warmuth, M. K. The weighted majority algorithm. Inf. Comput., 108(2):212-261, 1994.
17. McMahan, B. A unified view of regularized dual averaging and mirror descent with implicit updates. arXiv:1009.3240v2, 2011.
18. Merhav, N. and Feder, M. Universal prediction. IEEE Trans. Info. Th., 44(6):2124-2147, October 1998. (Pubitemid 128741886)
19. Nemirovsky, A. S. and Yudin, D. B. Problem complexity and method efficiency in optimization. John Wiley & Sons, New York, 1983.
20. Rakhlin, A. and Sridharan, K. Online learning with predictable sequences. arXiv: 1208.3728, 2012.
21. 1-regularized logistic regression. Annals of Statistics, 38:1287-1319, 2010.
22. Snijders, T. A. B. The statistical evaluation of social network dynamics. Sociological Methodology, 31(1): 361-395, 2001. (Pubitemid 33584803)
23. Theodor, Y. and Shaked, U. Robust discrete-time minimum-variance filtering. IEEE Trans. Sig. Proc., 44(2):181-189, 1996. (Pubitemid 126776424)
24. Vaswani, N. and Lu, W. Modified-CS: Modifying compressive sensing for problems with partially known support. IEEE Trans. Sig. Proc., 58:4595-4607, 2010.
25. Xiao, L. Dual averaging methods for regularized stochastic learning and online optimization. J. Mach. Learn. Res., 11:2543-2596, 2010.
26. Xie, L., Soh, Y. C., and de Souza, C. E. Robust Kalman filtering for uncertain discrete-time systems. IEEE Trans. Autom. Control, 39:1310-1314, 1994.
27. Zinkevich, M. Online convex programming and generalized infinitesimal gradient descent. In Proc. Int. Conf. on Machine Learning (ICML), pp. 928-936, 2003.