activity
20152026
most citedOptimality and Sub-optimality of PCA I: Spiked Random Matrix Models

78 citations · 436 across the 33 of their papers we have counts for

collaborators
Showing 2022Show all

7 papers · 1 filter

math.ST2022

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…

math.ST2022★ 6 cited

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 θ}^{\to…

cs.CC2022★ 7 cited

Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials

Alexander S. Wein

Suppose we are given an -dimensional order-3 symmetric tensor that is the sum of random rank-1 terms. The problem of recovering the rank-1…

cs.DS2022★ 1 cited

Near-optimal fitting of ellipsoids to random points

Aaron Potechin, Paxton Turner, Prayaag Venkat +1

Given independent standard Gaussian points in dimension , for what values of does there exist with high probability an origin-symmetric ellipsoid tha…

stat.ML2022★ 6 cited

Statistical and Computational Phase Transitions in Group Testing

Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth +2

We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease within a population of size n, based on the outcomes of poo…

math.ST2022★ 11 cited

The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics

Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins +3

Many high-dimensional statistical inference problems are believed to possess inherent computational hardness. Various frameworks have been proposed to give rigorous evidence for su…

cs.LG2022★ 2 cited

Lattice-Based Methods Surpass Sum-of-Squares in Clustering

Ilias Zadik, Min Jae Song, Alexander S. Wein +1

Clustering is a fundamental primitive in unsupervised learning which gives rise to a rich class of computationally-challenging inference tasks. In this work, we focus on the canoni…