Optimality and sub-optimality of PCA I: Spiked random matrix models A Perry, AS Wein, AS Bandeira, A Moitra The Annals of Statistics 46 (5), 2416-2451, 2018 | 141* | 2018 |

How robust are reconstruction thresholds for community detection? A Moitra, W Perry, AS Wein Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 79 | 2016 |

Notes on computational hardness of hypothesis testing: Predictions using the low-degree likelihood ratio D Kunisky, AS Wein, AS Bandeira ISAAC Congress (International Society for Analysis, its Applications and …, 2022 | 72 | 2022 |

Statistical limits of spiked tensor models A Perry, AS Wein, AS Bandeira Annales de l'Institut Henri Poincaré, Probabilités et Statistiques 56 (1 …, 2020 | 70* | 2020 |

Message‐Passing Algorithms for Synchronization Problems over Compact Groups A Perry, AS Wein, AS Bandeira, A Moitra Communications on Pure and Applied Mathematics 71 (11), 2275-2322, 2018 | 70 | 2018 |

Estimation under group actions: recovering orbits from invariants AS Bandeira, B Blum-Smith, J Kileel, A Perry, J Weed, AS Wein arXiv preprint arXiv:1712.10163, 2017 | 57 | 2017 |

A semidefinite program for unbalanced multisection in the stochastic block model A Perry, AS Wein 2017 International Conference on Sampling Theory and Applications (SampTA …, 2017 | 52 | 2017 |

Notes on computational-to-statistical gaps: predictions using statistical physics AS Bandeira, A Perry, AS Wein Portugaliae Mathematica 75 (2), 159-186, 2018 | 46 | 2018 |

The Kikuchi hierarchy and tensor PCA AS Wein, A El Alaoui, C Moore 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 40 | 2019 |

Computational Hardness of Certifying Bounds on Constrained PCA Problems AS Bandeira, D Kunisky, AS Wein arXiv preprint arXiv:1902.07324, 2019 | 39 | 2019 |

Low-degree hardness of random optimization problems D Gamarnik, A Jagannath, AS Wein 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 36 | 2020 |

Subexponential-Time Algorithms for Sparse PCA Y Ding, D Kunisky, AS Wein, AS Bandeira arXiv preprint arXiv:1907.11635, 2019 | 34 | 2019 |

Spectral planting and the hardness of refuting cuts, colorability, and communities in random graphs AS Bandeira, J Banks, D Kunisky, C Moore, A Wein Conference on Learning Theory, 410-473, 2021 | 22 | 2021 |

Optimal low-degree hardness of maximum independent set AS Wein Mathematical Statistics and Learning, 2022 | 21 | 2022 |

Free Energy Wells and Overlap Gap Property in Sparse PCA GB Arous, AS Wein, I Zadik Conference on Learning Theory, 479-482, 2020 | 21 | 2020 |

Computational barriers to estimation from low-degree polynomials T Schramm, AS Wein The Annals of Statistics 50 (3), 1833-1858, 2022 | 16 | 2022 |

Overcomplete independent component analysis via SDP A Podosinnikova, A Perry, AS Wein, F Bach, A d’Aspremont, D Sontag The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 15 | 2019 |

Spectral methods from tensor networks A Moitra, AS Wein Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 13 | 2019 |

The average-case time complexity of certifying the restricted isometry property Y Ding, D Kunisky, AS Wein, AS Bandeira IEEE Transactions on Information Theory, 2021 | 12 | 2021 |

Counterexamples to the Low-Degree Conjecture J Holmgren, AS Wein arXiv preprint arXiv:2004.08454, 2020 | 12 | 2020 |