Scaling law for recovering the sparsest element in a subspace
We address the problem of recovering a sparse n-vector within a given subspace. This problem is a subtask of some approaches to dictionary learning and sparse principal component analysis. Hence, if we can prove scaling laws for recovery of sparse vectors, it will be easier to derive and prove recov...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
Oxford University Press (OUP)
2018
|
| Online Access: | http://hdl.handle.net/1721.1/115483 https://orcid.org/0000-0001-7052-5097 |