Abstract
We study minimax rates for denoising simultaneously sparse and low rank matrices in high dimensions. An algorithm is shown to achieve (near) optimal rates of convergence adaptively under mild conditions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have