Statistical Limits in Random Tensors with Multiple Correlated Spikes
We use tools from random matrix theory to study the multi-spiked tensor model, i.e., a rank-$r$ deformation of a symmetric random Gaussian tensor. In particular, thanks to the nature of local optimization methods used to find the maximum likelihood estimator of this model, we propose to study the phase transition phenomenon for finding critical points of the corresponding optimization problem, i.e., those points defined by the Karush-Kuhn-Tucker (KKT) conditions. Moreover, we characterize the limiting alignments between the estimated signals corresponding to a critical point of the likelihood and the ground truth signals. With the help of these results, we propose a new estimator of the rank-$r$ tensor weights by solving a system of polynomial equations, which is asymptotically unbiased contrary the maximum likelihood estimator.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On Spectral Learning for Odeco Tensors: Perturbation, Initialization, and Algorithms
We study spectral learning for orthogonally decomposable (odeco) tensors, emphasizing the interplay between statistical limits, optimization geometry, and initialization. Unlike matrices, recovery for odeco tensors does …
Random Alloy Codes and the Fundamental Limits of Coded Distributed Tensors
Tensors are a fundamental operation in distributed computing, \emph{e.g.,} machine learning, that are commonly distributed into multiple parallel tasks for large datasets. Stragglers and other failures can severely impac…
Distributed ComputingStatistical and computational rates in high rank tensor estimation
Higher-order tensor datasets arise commonly in recommendation systems, neuroimaging, and social networks. Here we develop probable methods for estimating a possibly high rank signal tensor from noisy observations. We con…
Recommendation SystemsVocal Bursts Intensity PredictionTensor cumulants for statistical inference on invariant distributions
Many problems in high-dimensional statistics appear to have a statistical-computational gap: a range of values of the signal-to-noise ratio where inference is information-theoretically possible, but (conjecturally) compu…
Tensor NetworksFast and Guaranteed Tensor Decomposition via Sketching
Tensor CANDECOMP/PARAFAC (CP) decomposition has wide applications in statistical learning of latent variable models and in data mining. In this paper, we propose fast and randomized tensor CP decomposition algorithms bas…
Tensor Decomposition