`

Timezone: »

 
Poster
Nonasymptotic Guarantees for Spiked Matrix Recovery with Generative Priors
Jorio Cocola · Paul Hand · Vlad Voroninski

Tue Dec 08 09:00 AM -- 11:00 AM (PST) @ Poster Session 1 #470
in Poster Session 2 »

Many problems in statistics and machine learning require the reconstruction of a rank-one signal matrix from noisy data. Enforcing additional prior information on the rank-one component is often key to guaranteeing good recovery performance. One such prior on the low-rank component is sparsity, giving rise to the sparse principal component analysis problem. Unfortunately, there is strong evidence that this problem suffers from a computational-to-statistical gap, which may be fundamental. In this work, we study an alternative prior where the low-rank component is in the range of a trained generative network. We provide a non-asymptotic analysis with optimal sample complexity, up to logarithmic factors, for rank-one matrix recovery under an expansive-Gaussian network prior. Specifically, we establish a favorable global optimization landscape for a nonlinear least squares objective, provided the number of samples is on the order of the dimensionality of the input to the generative model. This result suggests that generative priors have no computational-to-statistical gap for structured rank-one matrix recovery in the finite data, nonasymptotic regime. We present this analysis in the case of both the Wishart and Wigner spiked matrix models.

Author Information

Jorio Cocola (Northeastern University)
Paul Hand (Northeastern University)
Vlad Voroninski (Helm.ai)

More from the Same Authors