arXiv · 1405.0338
Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices
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.
Explore related subjects
Keep this discovery
Dan Yang, Zongming Ma, Andreas Buja. 2014-05-02. Rate Optimal Denoising of Simultaneously Sparse and Low Rank Matrices. https://arxiv.org/abs/1405.0338
Cite the original work for its findings. Save a collection to share your selection of sources.