
-
Homomorphic Sensing of Subspace Arrangements
Homomorphic sensing is a recent algebraic-geometric framework that studi...
read it
-
An exposition to the finiteness of fibers in matrix completion via Plücker coordinates
Matrix completion is a popular paradigm in machine learning and data sci...
read it
-
Linear Regression without Correspondences via Concave Minimization
Linear regression without correspondences concerns the recovery of a sig...
read it
-
Finiteness of fibers in matrix completion via Plücker coordinates
Let Ω⊆{1,...,m}×{1,...,n}. We consider fibers of coordinate projections ...
read it
-
Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications
The problem of finding the sparsest vector (direction) in a low dimensio...
read it
-
Homomorphic Sensing
A recent line of research termed unlabeled sensing and shuffled linear r...
read it
-
Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms
Recent methods for learning a linear subspace from data corrupted by out...
read it
-
Eigenspace conditions for homomorphic sensing
Given two endomorphisms τ_1,τ_2 of C^m with m > 2n and a general n-dimen...
read it
-
An Algebraic-Geometric Approach to Shuffled Linear Regression
Shuffled linear regression is the problem of performing a linear regress...
read it
-
Theoretical Analysis of Sparse Subspace Clustering with Missing Entries
Sparse Subspace Clustering (SSC) is a popular unsupervised machine learn...
read it
-
Hyperplane Clustering Via Dual Principal Component Pursuit
We extend the theoretical analysis of a recently proposed single subspac...
read it
-
Filtrated Spectral Algebraic Subspace Clustering
Algebraic Subspace Clustering (ASC) is a simple and elegant method based...
read it
-
Dual Principal Component Pursuit
We consider the problem of outlier rejection in single subspace learning...
read it
-
Filtrated Algebraic Subspace Clustering
Subspace clustering is the problem of clustering data that lie close to ...
read it