Online tracking of linear subspaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4005 LNAI, Issue , 2006, Pages 438-452

  Crammer, Koby ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL MODELS; ONLINE SYSTEMS; OPTIMIZATION;

LINEAR SUBSPACES; ONLINE TRACKING; REGULARIZATION SCHEMAS;

PROBLEM SOLVING;

EID: 33746044179     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_33     Document Type: Conference Paper

References (15)

1. J.P. Delmas and J.F. Cardoso. Performance analysis of an adaptive algorithm for tracking dominant subspaces. IEEE Transactions on Signal Processing, 46:3054-3057, 1998.
2. R. Kumaresanand D.W.Tufts. Estimating the angles of arrival of multiple plane waves. IEEE Transactions on Aerospace and Electronic Systems, 19:134-139, 1983.
3. A. M. Haimovich and Y. Bar-Ness. An eigenanalysis interference canceler. IEEE Transactions on Signal Processing, 39:76-84, 1991.
4. J. Kivinen, M. K. Warmuth, and B. Hassibi. The p-norm generalization of the lms algorithm for adaptive filtering. In Proc. 13th IFAC Symposium on System Identification, 2003.
5. A.H. Sayed. Fundementals of Adaptive Filtering. Wiley-Interscience, 2003.
6. D.M.J. Tax. One-class classification; Concept-learning in the absence of counter-examples. PhD thesis, Delft University of Technology, 2001.
7. H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis, 2004.
8. K. Q. Weinberger, John C. Blitzer, and L. K. Saul. Distance metric learning for large margin nearest neighbor classification. In NIPS 18, 2005.
9. S. Shalev-Shwartz, Y. Singer, and A. Y. Ng. Online and batch learning of pseudo-metrics. In Proc. of the 21st international conf. on Machine learning, page 94. ACM Press, 2004.
10. k. Tsuda, G. Ratsch, and M.K. Warmuth. Matrix exponentiated gradient updates for on-line learning and bregman projection. Jornal of Machine Learning Research, 6:995-1018, 2005.
11. G.H. Golub and C.F. Van Loan. Matrix computations. John Hopkins University Press, 1989.
12. J. Kivinen, D.P Helmbold, and M. Warmuth. Relative loss bounds for single neurons. IEEE Transactions on Neural Networks, 10(6):1291-1304, 1999.
13. K. Crammer, O. Dekel, S. Shalev-Shwartz, and Y. Singer. Online passive aggressive algorithms. In Advances in Neural Information Processing Systems 16, 2003.
14. Y. Censor and S.A. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, New York, NY, USA, 1997.
15. K. Crammer and Y. Singer. On the learnability and design of output codes for multiclass problems. Machine Learning, 47, 2002.