Alexander S. Wein

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 57

Top Topics

Statistical Physics

Community Detection

Tensor Decomposition

Top Venues

Publications

Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira
Subexponential-Time Algorithms for Sparse PCA. Found. Comput. Math. 24 (3) (2024)
Jay Mardia, Kabir Aladin Verchand, Alexander S. Wein
Low-degree phase transitions for detecting a planted clique in sublinear time. COLT (2024)
Jay Mardia, Kabir Aladin Verchand, Alexander S. Wein
Low-degree phase transitions for detecting a planted clique in sublinear time. CoRR (2024)
Cheng Mao, Alexander S. Wein, Shenduo Zhang
Information-Theoretic Thresholds for Planted Dense Cycles. CoRR (2024)
David Gamarnik, Aukosh Jagannath, Alexander S. Wein
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics. SIAM J. Comput. 53 (1) (2024)
Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein
Tensor cumulants for statistical inference on invariant distributions. CoRR (2024)
Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang
Is It Easier to Count Communities Than Find Them? ITCS (2023)
Aaron Potechin, Paxton M. Turner, Prayaag Venkat, Alexander S. Wein
Near-optimal fitting of ellipsoids to random points. COLT (2023)
Pravesh Kothari, Santosh S. Vempala, Alexander S. Wein, Jeff Xu
Is Planted Coloring Easier than Planted Clique? COLT (2023)
Zongchen Chen, Dan Mikulincer, Daniel Reichman, Alexander S. Wein
Time Lower Bounds for the Metropolis Process and Simulated Annealing. CoRR (2023)
Cheng Mao, Alexander S. Wein, Shenduo Zhang
Detection-Recovery Gap for Planted Dense Cycles. COLT (2023)
Cheng Mao, Alexander S. Wein, Shenduo Zhang
Detection-Recovery Gap for Planted Dense Cycles. CoRR (2023)
Pravesh K. Kothari, Santosh S. Vempala, Alexander S. Wein, Jeff Xu
Is Planted Coloring Easier than Planted Clique? CoRR (2023)
Abhishek Dhawan, Cheng Mao, Alexander S. Wein
Detection of Dense Subhypergraphs by Low-Degree Polynomials. CoRR (2023)
Alexander S. Wein
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials. STOC (2023)
Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang
Is it easier to count communities than find them? CoRR (2022)
Alexander S. Wein
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials. CoRR (2022)
Ilias Zadik, Min Jae Song, Alexander S. Wein, Joan Bruna
Lattice-Based Methods Surpass Sum-of-Squares in Clustering. COLT (2022)
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik
Statistical and Computational Phase Transitions in Group Testing. COLT (2022)
Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. NeurIPS (2022)
Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik
Statistical and Computational Phase Transitions in Group Testing. CoRR (2022)
Afonso S. Bandeira, Ahmed El Alaoui, Samuel B. Hopkins, Tselil Schramm, Alexander S. Wein, Ilias Zadik
The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics. CoRR (2022)
Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. COLT (2021)
Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein
Average-Case Integrality Gap for Non-Negative Principal Component Analysis. MSML (2021)
Cheng Mao, Alexander S. Wein
Optimal Spectral Recovery of a Planted Vector in a Subspace. CoRR (2021)
Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira
The Average-Case Time Complexity of Certifying the Restricted Isometry Property. IEEE Trans. Inf. Theory 67 (11) (2021)
David Gamarnik, Aukosh Jagannath, Alexander S. Wein
Circuit Lower Bounds for the p-Spin Optimization Problem. CoRR (2021)
Ilias Zadik, Min Jae Song, Alexander S. Wein, Joan Bruna
Lattice-Based Methods Surpass Sum-of-Squares in Clustering. CoRR (2021)
Justin Holmgren, Alexander S. Wein
Counterexamples to the Low-Degree Conjecture. ITCS (2021)
Justin Holmgren, Alexander S. Wein
Counterexamples to the Low-Degree Conjecture. CoRR (2020)
Tselil Schramm, Alexander S. Wein
Computational Barriers to Estimation from Low-Degree Polynomials. CoRR (2020)
Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. CoRR (2020)
Alexander S. Wein
Optimal Low-Degree Hardness of Maximum Independent Set. CoRR (2020)
David Gamarnik, Aukosh Jagannath, Alexander S. Wein
Low-Degree Hardness of Random Optimization Problems. CoRR (2020)
Matthias Löffler, Alexander S. Wein, Afonso S. Bandeira
Computationally efficient sparse clustering. CoRR (2020)
Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein
Average-Case Integrality Gap for Non-Negative Principal Component Analysis. CoRR (2020)
Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein
Computational Hardness of Certifying Bounds on Constrained PCA Problems. ITCS (2020)
Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira
The Average-Case Time Complexity of Certifying the Restricted Isometry Property. CoRR (2020)
Gérard Ben Arous, Alexander S. Wein, Ilias Zadik
Free Energy Wells and Overlap Gap Property in Sparse PCA. COLT (2020)
Gérard Ben Arous, Alexander S. Wein, Ilias Zadik
Free Energy Wells and Overlap Gap Property in Sparse PCA. CoRR (2020)
David Gamarnik, Aukosh Jagannath, Alexander S. Wein
Low-Degree Hardness of Random Optimization Problems. FOCS (2020)
Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore
The Kikuchi Hierarchy and Tensor PCA. FOCS (2019)
Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira
Subexponential-Time Algorithms for Sparse PCA. CoRR (2019)
Ankur Moitra, Alexander S. Wein
Spectral methods from tensor networks. STOC (2019)
Anastasia Podosinnikova, Amelia Perry, Alexander S. Wein, Francis R. Bach, Alexandre d'Aspremont, David A. Sontag
Overcomplete Independent Component Analysis via SDP. AISTATS (2019)
Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein
Computational Hardness of Certifying Bounds on Constrained PCA Problems. CoRR (2019)
Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio. CoRR (2019)
Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore
The Kikuchi Hierarchy and Tensor PCA. CoRR (2019)
Anastasia Podosinnikova, Amelia Perry, Alexander S. Wein, Francis R. Bach, Alexandre d'Aspremont, David A. Sontag
Overcomplete Independent Component Analysis via SDP. CoRR (2019)
Ankur Moitra, Alexander S. Wein
Spectral Methods from Tensor Networks. CoRR (2018)
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra
Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models. CoRR (2018)
Afonso S. Bandeira, Amelia Perry, Alexander S. Wein
Notes on computational-to-statistical gaps: predictions using statistical physics. CoRR (2018)
Afonso S. Bandeira, Ben Blum-Smith, Amelia Perry, Jonathan Weed, Alexander S. Wein
Estimation under group actions: recovering orbits from invariants. CoRR (2017)
Ankur Moitra, William Perry, Alexander S. Wein
How robust are reconstruction thresholds for community detection? STOC (2016)
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra
Message-passing algorithms for synchronization problems over compact groups. CoRR (2016)
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra
Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization. CoRR (2016)
Amelia Perry, Alexander S. Wein, Afonso S. Bandeira
Statistical limits of spiked tensor models. CoRR (2016)
Ankur Moitra, William Perry, Alexander S. Wein
How Robust are Reconstruction Thresholds for Community Detection? CoRR (2015)
William Perry, Alexander S. Wein
A semidefinite program for unbalanced multisection in the stochastic block model. CoRR (2015)