Scaling law for recovering the sparsest element in a subspace

DOI10.1093/IMAIAI/IAU007MaRDI QIDQ4603698zbMATH OpenOpenAlexFDO

Authors Laurent Demanet, Paul E. Hand

Publication date 19 February 2018

Published in Information and Inference: A Journal of the IMA (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.1654, http://hdl.handle.net/1721.1/115483

zbMATH Keywords

dictionary learninglinear programmingsignal recoverysparse principle component analysissparsity

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Improved bounds for sparse recovery from subsampled random convolutions
• On exact recovery of sparse vectors from linear measurements
• Computing and analyzing recoverable supports for sparse reconstruction
• Iteratively reweighted least squares minimization for sparse recovery
• Simple bounds for recovering low-complexity models

Cited in

(7)

• Approximate global minimizers to pairwise interaction problems via convex relaxation
• Finding a low-rank basis in a matrix subspace
• Scaling Law for Recovering the Sparsest Element in a Subspace
• Discrete uncertainty principles and sparse signal processing
• Minimizing quotient regularization model
• Optimal spectral recovery of a planted vector in a subspace
• SQ lower bounds for random sparse planted vector problem

This page was built for publication: Scaling law for recovering the sparsest element in a subspace

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4603698)