default search action
Alexander S. Wein
Person information
- affiliation: University of California, Davis, Department of Mathematics, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
Subexponential-Time Algorithms for Sparse PCA. Found. Comput. Math. 24(3): 865-914 (2024) - [j2]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): 1-46 (2024) - [c20]Jay Mardia, Kabir Aladin Verchand, Alexander S. Wein:
Low-degree phase transitions for detecting a planted clique in sublinear time. COLT 2024: 3798-3822 - [c19]Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Tensor Cumulants for Statistical Inference on Invariant Distributions. FOCS 2024: 1007-1026 - [i37]Cheng Mao, Alexander S. Wein, Shenduo Zhang:
Information-Theoretic Thresholds for Planted Dense Cycles. CoRR abs/2402.00305 (2024) - [i36]Jay Mardia, Kabir Aladin Verchand, Alexander S. Wein:
Low-degree phase transitions for detecting a planted clique in sublinear time. CoRR abs/2402.05451 (2024) - [i35]Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Tensor cumulants for statistical inference on invariant distributions. CoRR abs/2404.18735 (2024) - 2023
- [c18]Cheng Mao, Alexander S. Wein, Shenduo Zhang:
Detection-Recovery Gap for Planted Dense Cycles. COLT 2023: 2440-2481 - [c17]Aaron Potechin, Paxton M. Turner, Prayaag Venkat, Alexander S. Wein:
Near-optimal fitting of ellipsoids to random points. COLT 2023: 4235-4295 - [c16]Pravesh Kothari, Santosh S. Vempala, Alexander S. Wein, Jeff Xu:
Is Planted Coloring Easier than Planted Clique? COLT 2023: 5343-5372 - [c15]Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang:
Is It Easier to Count Communities Than Find Them? ITCS 2023: 94:1-94:23 - [c14]Alexander S. Wein:
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials. STOC 2023: 1685-1698 - [i34]Cheng Mao, Alexander S. Wein, Shenduo Zhang:
Detection-Recovery Gap for Planted Dense Cycles. CoRR abs/2302.06737 (2023) - [i33]Pravesh K. Kothari, Santosh S. Vempala, Alexander S. Wein, Jeff Xu:
Is Planted Coloring Easier than Planted Clique? CoRR abs/2303.00252 (2023) - [i32]Abhishek Dhawan, Cheng Mao, Alexander S. Wein:
Detection of Dense Subhypergraphs by Low-Degree Polynomials. CoRR abs/2304.08135 (2023) - [i31]Zongchen Chen, Dan Mikulincer, Daniel Reichman, Alexander S. Wein:
Time Lower Bounds for the Metropolis Process and Simulated Annealing. CoRR abs/2312.13554 (2023) - 2022
- [c13]Ilias Zadik, Min Jae Song, Alexander S. Wein, Joan Bruna:
Lattice-Based Methods Surpass Sum-of-Squares in Clustering. COLT 2022: 1247-1248 - [c12]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth
, Alexander S. Wein, Ilias Zadik:
Statistical and Computational Phase Transitions in Group Testing. COLT 2022: 4764-4781 - [c11]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 - [i30]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 abs/2205.09727 (2022) - [i29]Amin Coja-Oghlan, Oliver Gebhard, Max Hahn-Klimroth, Alexander S. Wein, Ilias Zadik:
Statistical and Computational Phase Transitions in Group Testing. CoRR abs/2206.07640 (2022) - [i28]Alexander S. Wein:
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials. CoRR abs/2211.05274 (2022) - [i27]Cynthia Rush, Fiona Skerman, Alexander S. Wein, Dana Yang:
Is it easier to count communities than find them? CoRR abs/2212.10872 (2022) - 2021
- [j1]Yunzi Ding
The Average-Case Time Complexity of Certifying the Restricted Isometry Property. IEEE Trans. Inf. Theory 67(11): 7355-7361 (2021) - [c10]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: 410-473 - [c9]Justin Holmgren
Counterexamples to the Low-Degree Conjecture. ITCS 2021: 75:1-75:9 - [c8]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Average-Case Integrality Gap for Non-Negative Principal Component Analysis. MSML 2021: 153-171 - [i26]Cheng Mao, Alexander S. Wein:
Optimal Spectral Recovery of a Planted Vector in a Subspace. CoRR abs/2105.15081 (2021) - [i25]David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Circuit Lower Bounds for the p-Spin Optimization Problem. CoRR abs/2109.01342 (2021) - [i24]Ilias Zadik, Min Jae Song, Alexander S. Wein, Joan Bruna:
Lattice-Based Methods Surpass Sum-of-Squares in Clustering. CoRR abs/2112.03898 (2021) - 2020
- [c7]Gérard Ben Arous, Alexander S. Wein, Ilias Zadik:
Free Energy Wells and Overlap Gap Property in Sparse PCA. COLT 2020: 479-482 - [c6]David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Low-Degree Hardness of Random Optimization Problems. FOCS 2020: 131-140 - [c5]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Computational Hardness of Certifying Bounds on Constrained PCA Problems. ITCS 2020: 78:1-78:29 - [i23]Justin Holmgren, Alexander S. Wein:
Counterexamples to the Low-Degree Conjecture. CoRR abs/2004.08454 (2020) - [i22]David Gamarnik, Aukosh Jagannath, Alexander S. Wein:
Low-Degree Hardness of Random Optimization Problems. CoRR abs/2004.12063 (2020) - [i21]Matthias Löffler
Computationally efficient sparse clustering. CoRR abs/2005.10817 (2020) - [i20]Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
The Average-Case Time Complexity of Certifying the Restricted Isometry Property. CoRR abs/2005.11270 (2020) - [i19]Gérard Ben Arous, Alexander S. Wein, Ilias Zadik:
Free Energy Wells and Overlap Gap Property in Sparse PCA. CoRR abs/2006.10689 (2020) - [i18]Tselil Schramm, Alexander S. Wein:
Computational Barriers to Estimation from Low-Degree Polynomials. CoRR abs/2008.02269 (2020) - [i17]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 abs/2008.12237 (2020) - [i16]Alexander S. Wein:
Optimal Low-Degree Hardness of Maximum Independent Set. CoRR abs/2010.06563 (2020) - [i15]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Average-Case Integrality Gap for Non-Negative Principal Component Analysis. CoRR abs/2012.02243 (2020)
2010 – 2019
- 2019
- [c4]Anastasia Podosinnikova, Amelia Perry, Alexander S. Wein, Francis R. Bach, Alexandre d'Aspremont, David A. Sontag:
Overcomplete Independent Component Analysis via SDP. AISTATS 2019: 2583-2592 - [c3]Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore
The Kikuchi Hierarchy and Tensor PCA. FOCS 2019: 1446-1468 - [c2]Ankur Moitra, Alexander S. Wein:
Spectral methods from tensor networks. STOC 2019: 926-937 - [i14]Anastasia Podosinnikova, Amelia Perry, Alexander S. Wein, Francis R. Bach, Alexandre d'Aspremont, David A. Sontag:
Overcomplete Independent Component Analysis via SDP. CoRR abs/1901.08334 (2019) - [i13]Afonso S. Bandeira, Dmitriy Kunisky, Alexander S. Wein:
Computational Hardness of Certifying Bounds on Constrained PCA Problems. CoRR abs/1902.07324 (2019) - [i12]Alexander S. Wein, Ahmed El Alaoui, Cristopher Moore:
The Kikuchi Hierarchy and Tensor PCA. CoRR abs/1904.03858 (2019) - [i11]Yunzi Ding, Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
Subexponential-Time Algorithms for Sparse PCA. CoRR abs/1907.11635 (2019) - [i10]Dmitriy Kunisky, Alexander S. Wein, Afonso S. Bandeira:
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio. CoRR abs/1907.11636 (2019) - 2018
- [i9]Afonso S. Bandeira, Amelia Perry, Alexander S. Wein:
Notes on computational-to-statistical gaps: predictions using statistical physics. CoRR abs/1803.11132 (2018) - [i8]Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra:
Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models. CoRR abs/1807.00891 (2018) - [i7]Ankur Moitra, Alexander S. Wein:
Spectral Methods from Tensor Networks. CoRR abs/1811.00944 (2018) - 2017
- [i6]Afonso S. Bandeira, Ben Blum-Smith, Amelia Perry, Jonathan Weed, Alexander S. Wein:
Estimation under group actions: recovering orbits from invariants. CoRR abs/1712.10163 (2017) - 2016
- [c1]Ankur Moitra, William Perry, Alexander S. Wein:
How robust are reconstruction thresholds for community detection? STOC 2016: 828-841 - [i5]Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra:
Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization. CoRR abs/1609.05573 (2016) - [i4]Amelia Perry, Alexander S. Wein, Afonso S. Bandeira, Ankur Moitra:
Message-passing algorithms for synchronization problems over compact groups. CoRR abs/1610.04583 (2016) - [i3]Amelia Perry, Alexander S. Wein, Afonso S. Bandeira:
Statistical limits of spiked tensor models. CoRR abs/1612.07728 (2016) - 2015
- [i2]William Perry, Alexander S. Wein:
A semidefinite program for unbalanced multisection in the stochastic block model. CoRR abs/1507.05605 (2015) - [i1]Ankur Moitra, William Perry, Alexander S. Wein:
How Robust are Reconstruction Thresholds for Community Detection? CoRR abs/1511.01473 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: