activity
20102025
most citedOnline Robust Subspace Tracking from Partial Information

101 citations · 615 across the 44 of their papers we have counts for

collaborators
Showing cs.LGShow all

6 papers · 1 filter

cs.LG2025★ 1 cited

Truncated Matrix Completion - An Empirical Study

Rishhabh Naik, Nisarg Trivedi, Davoud Ataee Tarzanagh +1

Low-rank Matrix Completion (LRMC) describes the problem where we wish to recover missing entries of partially observed low-rank matrix. Most existing matrix completion work deals w…

cs.LG2022★ 4 cited

Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold

Can Yaras, Peng Wang, Zhihui Zhu +2

When training overparameterized deep networks for classification tasks, it has been widely observed that the learned features exhibit a so-called "neural collapse" phenomenon. More…

cs.LG2021

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds

Yahya Sattar, Zhe Du, Davoud Ataee Tarzanagh +3

Learning how to effectively control unknown dynamical systems is crucial for intelligent autonomous systems. This task becomes a significant challenge when the underlying dynamics…

cs.LG2019★ 11 cited

Online matrix factorization for Markovian data and applications to Network Dictionary Learning

Hanbaek Lyu, Deanna Needell, Laura Balzano

Online Matrix Factorization (OMF) is a fundamental tool for dictionary learning problems, giving an approximate representation of complex data sets in terms of a reduced number of…

cs.LG2017★ 37 cited

Deep Unsupervised Clustering Using Mixture of Autoencoders

Dejiao Zhang, Yifan Sun, Brian Eriksson +1

Unsupervised clustering is one of the most fundamental challenges in machine learning. A popular hypothesis is that data are generated from a union of low-dimensional nonlinear man…

cs.LG2016

Leveraging Union of Subspace Structure to Improve Constrained Clustering

John Lipor, Laura Balzano

Many clustering problems in computer vision and other contexts are also classification problems, where each cluster shares a meaningful label. Subspace clustering algorithms in par…