Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension

Journal of Machine Learning Research

Volumn 9, Issue , 2008, Pages 2287-2320

  Warmuth, Manfred K ^a   Kuzmin, Dima ^a  

^a University of California Santa Cruz   (United States)

Author keywords

Density matrix; Expert setting; Online learning; Principal component analysis; Quantum Bayes rule

Indexed keywords

A DENSITIES; BATCH ALGORITHMS; DENSITY MATRIX; EIGENVALUES; EXPERT SETTING; LOW DIMENSIONAL; ON-LINE LEARNINGS; ONLINE ALGORITHMS; ONLINE LEARNING; PCA ALGORITHMS; PRINCIPAL COMPONENTS; QUANTUM BAYES RULE; RUNNING TIMES; SUB SPACES;

ALGORITHMS; DATA COMPRESSION; E-LEARNING; INTERNET; LEARNING ALGORITHMS; QUANTUM THEORY;

PRINCIPAL COMPONENT ANALYSIS;

EID: 56349165656     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (38)

1. K. Azoury and M. K. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. Journal of Machine Learning, 43(3):211-246, June 2001. Special issue on Theoretical Advances in On-line Learning, Game Theory and Boosting, edited by Yoram Singer.
2. R. Bhatia. Matrix Analysis. Springer, Berlin, 1997.
3. O. Bousquet and M. K. Warmuth. Tracking a small set of experts by mixing past posteriors. Journal of Machine Learning Research, 3:363-396, 2002.
4. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
5. L. M. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Physics, 7:200-217, 1967.
6. Y. Censor and A. Lent. An iterative row-action method for interval convex programming. Journal of Optimization Theory and Applications, 34(3):321-353, July 1981.
7. N. Cesa-Bianchi and C. Gentile. Improved risk tail bounds for on-line algorithms. In NIPS, 2005.
8. N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth. How to use expert advice. Journal of the ACM, 44(3):427-485, May 1997.
9. N. Cesa-Bianchiand and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
10. K. Crammer. Online tracking of linear subspaces. In Proceedings of the 19th Annual Conference on Learning Theory (COLT 06), Pittsburg, June 2006. Springer.
11. 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, 55(1):119-139, August 1997.
12. M. Gu and S. Eisenstat. A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM Journal on Matrix Analysis and Applications, 15(4): 1266-1276, October 1994.
13. D. Helmbold and M. K. Warmuth. Learning permutations with exponential weights. In Proceedings of the 20th Annual Conference on Learning Theory (COLT07). Springer, 2007.
14. D. Helmbold and M. K. Warmuth. Learning permutations with exponential weights. Submitted journal version, August 2008.
15. D. P. Helmbold, J. Kivinen, and M. K. Warmuth. Relative loss bounds for single neurons. IEEE Transactions on Neural Networks, 10(6): 1291-1304, November 1999.
16. M. Herbster and M. K. Warmuth. Tracking the best expert. Machine Learning, 32(2): 151-178, 1998. Earlier version in 12th ICML, 1995.
17. M. Herbster and M. K. Warmuth. Tracking the best linear predictor. Journal of Machine Learning Research, 1:281-309, 2001.
18. A. Kalai. Simulating weighted majority with FPL. Private communication, 2005.
19. A. Kalai and S. Vempala. Efficient algorithms for online decision problems. J. Comput. Syst. Sci., 71(3):291-307, 2005. Special issue Learning Theory 2003.
20. J. Kivinen and M. K. Warmuth. Averaging expert predictions. In Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings, volume 1572 of Lecture Notes in Artificial Intelligence, pages 153-167. Springer, 1999.
21. J. Kivinen and M. K. Warmuth. Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132(1): 1-64, January 1997.
22. J. Kivinen and M. K. Warmuth. Relative loss bounds for multidimensional regression problems. Machine Learning, 45(3):301-329, 2001.
23. J. Kivinen, M. K. Warmuth, and B. Hassibi. The p-norm generalization of the LMS algorithm for adaptive filtering. Journal of IEEE Transactions on Signal Processing (to appear), 54(5): 1782-1793, May 2005.
24. D. Kuzmin and M. K. Warmuth. Optimum follow the leader algorithm. In Proceedings of the 18th Annual Conference on Learning Theory (COLT 05), pages 684-686. Springer, June 2005. Open problem.
25. D. Kuzmin and M. K. Warmuth. Online Kernel PCA with entropic matrix updates. In ICML '07: Proceedings of the 24th International Conference on Machine Learning. ACM Press, June 2007.
26. J. Liao. Totally Corrective Boosting Algorithms that Maximize the Margin. PhD thesis, University of California at Santa Cruz, June 2007.
27. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Inform. Comput., 108(2): 212-261, 1994. Preliminary version in in FOCS 89.
28. A. W. Marshall and I. Olkin. Inequalities: Theory of Majorization and its Applications. Academic Press, 1979.
29. R. Rockafellar. Convex Analysis. Princeton University Press, 1970.
30. T. D. Sanger. Optimal unsupervised learning in a single-layer linear feedforward neural network. Neural Networks, 2:459-473, 1989.
31. J. Shawe-Taylor, C. K. I. Williams, N. Cristianini, and J. S. Kandola. On the eigenspectrum of the gram matrix and the generalization error of kernel-PCA. IEEE Transactions on Information Theory, 51(7):2510-2522, 2005. URL http://dx.doi.org/10.1109/TIT.2005.850052.
32. E. Takimoto and M. K. Warmuth. Path kernels and multiplicative updates. Journal of Machine Learning Research, 4:773-818, 2003.
33. K. Tsuda, G. Ratsch, and M. K. Warmuth. Matrix exponentiated gradient updates for on-line learning and Bregman projections. Journal of Machine Learning Research, 6:995-1018, June 2005.
34. M. K. Warmuth. The blessing and the curse of the multiplicative updates. Work in progress, unpublished manuscript., 2007a.
35. M. K. Warmuth. When is there a free matrix lunch. In Proc. of the 20th Annual Conference on Learning Theory (COLT 07). Springer, June 2007b. Open problem.
36. M. K. Warmuth and D. Kuzmin. Online variance minimization. In Proceedings of the 19th Annual Conference on Learning Theory (COLT 06), Pittsburg, June 2006a. Springer.
37. M. K. Warmuth and D. Kuzmin. Randomized PCA algorithms with regret bounds that are logarithmic in the dimension. In Advances in Neural Information Processing Systems 19 (NIPS 06). MIT Press, December 2006b.
38. M. K. Warmuth, J. Liao, and G. Ratsch. Totally corrective boosting algorithms that maximize the margin. In ICML '06: Proceedings of the 23rd International Conference on Machine Learning, pages 1001-1008, New York, NY, USA, 2006. ACM Press.