Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices

From MaRDI portal



Abstract: We study minimax rates for denoising simultaneously sparse and low rank matrices in high dimensions. We show that an iterative thresholding algorithm achieves (near) optimal rates adaptively under mild conditions for a large class of loss functions. Numerical experiments on synthetic datasets also demonstrate the competitive performance of the proposed method.





Cited in
(20)








This page was built for publication: Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices

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