| 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 | 199* | 2018 |
| 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 | 173 | 2022 |
| 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 | 105 | 2016 |
| 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 | 102* | 2020 |
| Estimation under group actions: recovering orbits from invariants AS Bandeira, B Blum-Smith, J Kileel, J Niles-Weed, A Perry, AS Wein Applied and Computational Harmonic Analysis 66, 236-319, 2023 | 99 | 2023 |
| 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 | 93 | 2018 |
| Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics D Gamarnik, A Jagannath, AS Wein SIAM Journal on Computing 53 (1), 1-46, 2024 | 89* | 2024 |
| Computational barriers to estimation from low-degree polynomials T Schramm, AS Wein The Annals of Statistics 50 (3), 1833-1858, 2022 | 83 | 2022 |
| Subexponential-time algorithms for sparse PCA Y Ding, D Kunisky, AS Wein, AS Bandeira Foundations of Computational Mathematics 24 (3), 865-914, 2024 | 77 | 2024 |
| 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 | 76 | 2019 |
| Notes on computational-to-statistical gaps: predictions using statistical physics AS Bandeira, A Perry, AS Wein Portugaliae Mathematica 75 (2), 159-186, 2018 | 76 | 2018 |
| Computational hardness of certifying bounds on constrained PCA problems AS Bandeira, D Kunisky, AS Wein 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) 151, 78, 2020 | 74 | 2020 |
| 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 | 58 | 2017 |
| Optimal low-degree hardness of maximum independent set AS Wein Mathematical Statistics and Learning, 2022 | 56 | 2022 |
| Lattice-based methods surpass sum-of-squares in clustering I Zadik, MJ Song, AS Wein, J Bruna Conference on Learning Theory, 1247-1248, 2022 | 46 | 2022 |
| Free Energy Wells and Overlap Gap Property in Sparse PCA GB Arous, AS Wein, I Zadik Communications on Pure and Applied Mathematics 76 (10), 2410-2473, 2023 | 43 | 2023 |
| The Franz-Parisi criterion and computational trade-offs in high dimensional statistics AS Bandeira, A El Alaoui, S Hopkins, T Schramm, AS Wein, I Zadik Advances in Neural Information Processing Systems 35, 33831-33844, 2022 | 43 | 2022 |
| Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation A Montanari, AS Wein Probability Theory and Related Fields, 1-53, 2024 | 38 | 2024 |
| 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 | 37 | 2021 |
| 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 | 28 | 2019 |
