Online identification and tracking of subspaces from highly incomplete information

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 704-711

  Balzano, Laura ^a   Nowak, Robert ^a   Recht, Benjamin ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRASSMANNIAN; INCOMPLETE INFORMATION; INCOMPLETE OBSERVATION; INCREMENTAL ALGORITHM; INCREMENTAL GRADIENT DESCENT; LINEAR TIME; LINEAR-ALGEBRAIC; LOW-RANK MATRICES; MATRIX COMPLETION; MATRIX COMPLETION PROBLEMS; ON-LINE ALGORITHMS; ON-LINE IDENTIFICATION; SUBSPACE ESTIMATION;

ALGORITHMS;

MATRIX ALGEBRA;

EID: 79952389882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5706976     Document Type: Conference Paper

References (18)

1. A. Lakhina, M. Crovella, and C. Diot, "Diagnosing network-wide traffic anomalies," in Proceedings of SIGCOMM, 2004.
2. J. Gupchup, R. Burns, A. Terzis, and A. Szalay, "Model-based event detection in wireless sensor networks," in Proceedings of the Workshop on Data Sharing and Interoperability (DSI), 2007.
3. S. Papadimitriou, J. Sun, and C. Faloutsos, "Streaming pattern discovery in multiple time-series," in Proceedings of VLDB Conference, 2005.
4. G. S. Wagner and T. J. Owens, "Signal detection using multichannel seismic data," Bulletin of the Seismological Society of America, vol. 86, no. 1A, pp. 221-231, February 1996.
5. N. Gershenfeld, S. Samouhos, and B. Nordman, "Intelligent infrastructure for energy efficiency," Science, vol. 327, no. 5969, p. 1086, 2010.
6. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Transactions on Information Theory, 2009, to Appear. Preprint available at http://arxiv.org/abs/0901.3150.
7. W. Dai and O. Milenkovic, "SET: An algorithm for consistent matrix completion," in Proceedings of ICASSP, 2010.
8. A. Edelman, T. A. Arias, and S. T. Smith, "The geometry of algorithms with orthogonality constraints," SIAM Journal on Matrix Analysis and Applications, vol. 20, no. 2, pp. 303-353, 1998.
9. H. J. Kushner and G. G. Yin, Stochastic Approximation and Recursive Algorithms and Applications, 2nd ed. New York: Springer-Verlag, 2003.
10. P. Comon and G. Golub, "Tracking a few extreme singular values and vectors in signal processing," Proceedings of the IEEE, vol. 78, no. 8, August 1990.
11. M. Brand, "Fast low-rank modifications of the thin singular value decomposition," Linear Algebra and its Applications, vol. 415, no. 1, pp. 20-30, 2006.
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, vol. 15, pp. 1266-1276, 1994.
13. L. Balzano, B. Recht, and R. Nowak, "High-dimensional matched subspace detection when data are missing," 2010, submitted for publication. Preprint available at http://arxiv.org/abs/1002.0852.
14. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and Bregman iterative methods for matrix rank minimization," 2008, preprint available at http://www.optimization-online.org/DB-HTML/2008/11/2151.html.
15. J.-F. Cai, E. J. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956-1982, 2008.
16. S. Burer and R. D. C. Monteiro, "Local minima and convergence in low-rank semidefinite programming," Mathematical Programming, vol. 103, no. 3, pp. 427-444, 2005.
17. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization," SIAM Review, 2007, to appear. Preprint Available at http://pages.cs.wisc.edu/~brecht/ publications.html.
18. K.-C. Toh and S. Yun, "An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems," 2009, preprint available at http://www.optimization-online.org/DB-HTML/2009/03/2268.html.