
Online matrix factorization for Markovian data and applications to Network Dictionary Learning
Online Matrix Factorization (OMF) is a fundamental tool for dictionary l...
read it

Subspace Clustering using Ensembles of KSubspaces
We present a novel approach to the subspace clustering problem that leve...
read it

Algebraic Variety Models for HighRank Matrix Completion
We consider a generalization of lowrank matrix completion to the case w...
read it

RealTime Energy Disaggregation of a Distribution Feeder's Demand Using Online Learning
Though distribution system operators have been adding more sensors to th...
read it

Towards a Theoretical Analysis of PCA for Heteroscedastic Data
Principal Component Analysis (PCA) is a method for estimating a subspace...
read it

Convergence of a Grassmannian Gradient Descent Algorithm for Subspace Estimation From Undersampled Data
Subspace learning and matrix factorization problems have a great many ap...
read it

Deep Unsupervised Clustering Using Mixture of Autoencoders
Unsupervised clustering is one of the most fundamental challenges in mac...
read it

On Learning High Dimensional Structured Single Index Models
Single Index Models (SIMs) are simple yet flexible semiparametric model...
read it

Matrix Completion Under Monotonic Single Index Models
Most recent results in matrix completion assume that the matrix under co...
read it

DistancePenalized Active Learning Using Quantile Search
Adaptive sampling theory has shown that, with proper assumptions on the ...
read it

Leveraging Union of Subspace Structure to Improve Constrained Clustering
Many clustering problems in computer vision and other contexts are also ...
read it

Global Convergence of a Grassmannian Gradient Descent Algorithm for Subspace Estimation
It has been observed in a variety of contexts that gradient descent meth...
read it

On GROUSE and Incremental SVD
GROUSE (Grassmannian RankOne Update Subspace Estimation) is an incremen...
read it

HighRank Matrix Completion and Subspace Clustering with Missing Data
This paper considers the problem of completing a matrix with many missin...
read it

Rank Minimization over Finite Fields: Fundamental Limits and CodingTheoretic Interpretations
This paper establishes informationtheoretic limits in estimating a fini...
read it

Online Algorithms for FactorizationBased Structure from Motion
We present a family of online algorithms for realtime factorizationbas...
read it

Iterative Grassmannian Optimization for Robust Image Alignment
Robust highdimensional data processing has witnessed an exciting develo...
read it

Online Robust Subspace Tracking from Partial Information
This paper presents GRASTA (Grassmannian Robust Adaptive Subspace Tracki...
read it

Tensor Methods for Nonlinear Matrix Completion
In the low rank matrix completion (LRMC) problem, the low rank assumptio...
read it

Streaming PCA and Subspace Tracking: The Missing Data Case
For many modern applications in science and engineering, data are collec...
read it

Optimally Weighted PCA for HighDimensional Heteroscedastic Data
Modern applications increasingly involve highdimensional and heterogene...
read it

Grassmannian Optimization for Online Tensor Completion and Tracking in the tSVD Algebra
We propose a new streaming algorithm, called TOUCAN, for the tensor comp...
read it
Laura Balzano
is this you? claim profile
Assistant Professor in Electrical Engineering and Computer Science at the University of Michigan