6 papers
Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment
Tait Weicht, Alexander S. Wein
Multireference alignment (MRA) is the task of recovering a hidden "signal" vector, given many noisy copies that have been cyclically shifted by unknown offsets. This task belongs t…
The Kikuchi Hierarchy and Tensor PCA
Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore
For the tensor PCA (principal component analysis) problem, we propose a new hierarchy of increasingly powerful algorithms with increasing runtime. Our hierarchy is analogous to the…
Is it easier to count communities than find them?
Cynthia Rush, Fiona Skerman, Alexander S. Wein +1
Random graph models with community structure have been studied extensively in the literature. For both the problems of detecting and recovering community structure, an interesting…
Precise Error Rates for Computationally Efficient Testing
Ankur Moitra, Alexander S. Wein
We revisit the fundamental question of simple-versus-simple hypothesis testing with an eye towards computational complexity, as the statistically optimal likelihood ratio test is o…
Statistical inference of a ranked community in a directed graph
Dmitriy Kunisky, Daniel A. Spielman, Alexander S. Wein +1
We study the problem of detecting or recovering a planted ranked subgraph from a directed graph, an analog for directed graphs of the well-studied planted dense subgraph model. We…
Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation
Andrea Montanari, Alexander S. Wein
We consider the problem of estimating an unknown parameter vector , given noisy observations ${\boldsymbol Y} = {\boldsymbol θ}{\boldsymbol θ}^{…