Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks

by   Jingqiu Ding, et al.

We study symmetric spiked matrix models with respect to a general class of noise distributions. Given a rank-1 deformation of a random noise matrix, whose entries are independently distributed with zero mean and unit variance, the goal is to estimate the rank-1 part. For the case of Gaussian noise, the top eigenvector of the given matrix is a widely-studied estimator known to achieve optimal statistical guarantees, e.g., in the sense of the celebrated BBP phase transition. However, this estimator can fail completely for heavy-tailed noise. In this work, we exhibit an estimator that works for heavy-tailed noise up to the BBP threshold that is optimal even for Gaussian noise. We give a non-asymptotic analysis of our estimator which relies only on the variance of each entry remaining constant as the size of the matrix grows: higher moments may grow arbitrarily fast or even fail to exist. Previously, it was only known how to achieve these guarantees if higher-order moments of the noises are bounded by a constant independent of the size of the matrix. Our estimator can be evaluated in polynomial time by counting self-avoiding walks via a color -coding technique. Moreover, we extend our estimator to spiked tensor models and establish analogous results.



There are no comments yet.


page 1

page 2

page 3

page 4


On Estimating Rank-One Spiked Tensors in the Presence of Heavy Tailed Errors

In this paper, we study the estimation of a rank-one spiked tensor in th...

A Random Matrix Perspective on Random Tensors

Tensor models play an increasingly prominent role in many fields, notabl...

Loss minimization and parameter estimation with heavy tails

This work studies applications and generalizations of a simple estimatio...

Adjusted least squares fitting of algebraic hypersurfaces

We consider the problem of fitting a set of points in Euclidean space by...

Hypothesis testing with low-degree polynomials in the Morris class of exponential families

Analysis of low-degree polynomial algorithms is a powerful, newly-popula...

Heavy-Tailed Analogues of the Covariance Matrix for ICA

Independent Component Analysis (ICA) is the problem of learning a square...

Matroid Regression

We propose an algebraic combinatorial method for solving large sparse li...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.