2010/06/21 by Laura Balzano, Balzano, Laura, Robert D. Nowak +3 · 5 citations
Computer Science · Engineering · #Advanced Adaptive Filtering Techniques #Blind Source Separation Techniques #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Information Theory (cs.IT) #Machine Learning (stat.ML) #Optimization and Control (math.OC) #Systems and Control (eess.SY) #Target Tracking and Data Fusion in Sensor Networks #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1006.4046
openalex publication_date 2010/06/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This work presents GROUSE (Grassmanian Rank-One Update Subspace Estimation),\nan efficient online algorithm for tracking subspaces from highly incomplete\nobservations. GROUSE requires only basic linear algebraic manipulations at each\niteration, and each subspace update can be performed in linear time in the\ndimension of the subspace. The algorithm is derived by analyzing incremental\ngradient descent on the Grassmannian manifold of subspaces. With a slight\nmodification, GROUSE can also be used as an online incremental algorithm for\nthe matrix completion problem of imputing missing entries of a low-rank matrix.\nGROUSE performs exceptionally well in practice both in tracking subspaces and\nas an online algorithm for matrix completion.\n