The Full Rank Condition for Sparse Random Matrices.
Amin Coja-OghlanJane GaoMax Hahn-KlimrothJoon LeeNoëla MüllerMaurice RolvienPublished in: APPROX/RANDOM (2023)
Keyphrases
- low rank approximation
- sparse matrix
- coefficient matrix
- singular values
- singular value decomposition
- high dimensional
- sufficient conditions
- compressed sensing
- sparse data
- binary matrices
- low rank matrices
- compressive sensing
- rank aggregation
- dictionary learning
- singular vectors
- signal recovery
- data sets
- positive definite
- sparse representation
- least squares
- low rank matrix