Higher Lower Bounds for Sparse Oblivious Subspace Embeddings.
Yi LiMingmou LiuPublished in: CoRR (2022)
Keyphrases
- lower bound
- low dimensional
- high dimensional
- high dimensional data
- dimensionality reduction
- upper bound
- sparse data
- manifold learning
- branch and bound algorithm
- sparse representation
- subspace learning
- subspace clustering
- worst case
- branch and bound
- objective function
- low rank representation
- regularized regression
- data points
- feature space
- vector space
- lower and upper bounds
- basis vectors
- rank minimization
- principal component analysis
- lower dimensional
- optimal solution
- linear subspace
- hilbert space
- data sets
- np hard
- learning algorithm