Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition.
Calvin BeidemanKarthekeyan ChandrasekaranSagnik MukhopadhyayDanupon NanongkaiPublished in: IPCO (2022)
Keyphrases
- low rank
- tensor decomposition
- missing data
- matrix factorization
- convex optimization
- singular value decomposition
- low rank matrix
- linear combination
- rank minimization
- kernel matrix
- matrix completion
- semi supervised
- high dimensional data
- high order
- matrix decomposition
- robust principal component analysis
- minimization problems
- singular values
- low rank representation
- data matrix
- trace norm
- computer vision
- non rigid structure from motion
- dimensionality reduction
- low rank matrices
- high dimensional