Matrix denoising beyond rotational invariance

Denoising a large matrix modeled as a product of two factors is a hard problem, both algorithmically, and from the viewpoint of theoretical analysis, especially if its rank is proportional to its dimension. Its applications range from signal processing, to representation learning, sparse coding, community detection, video processing, recommender systems  and many more.

One can formulate the problem as an inference task, where a Statistician is given the set of observations Y, that is the result of the product of two N x M matrices X, identical to each other in our case, with some additional blurring noise Z.