Alexander S. Wein

From MaRDI portal
(Redirected from Alexander S. Wein)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Tensor cumulants for statistical inference on invariant distributions
(available as arXiv preprint)
N/APaper
Time lower bounds for the Metropolis process and simulated annealing2026-09-11Paper
Is it easier to count communities than find them?
Random Structures & Algorithms
2026-07-20Paper
Tensor cumulants for statistical inference on invariant distributions2026-06-23Paper
Counterexamples to the low-degree conjecture2026-04-15Paper
Sharp Low-Degree Thresholds for Planted-vs-Planted Testing
(available as arXiv preprint)
2026-01-01Paper
The Kikuchi hierarchy and tensor PCA
Journal of the ACM
2025-11-27Paper
Low-degree hardness of random optimization problems2025-08-12Paper
The Kikuchi hierarchy and tensor PCA2025-08-12Paper
Precise error rates for computationally efficient testing
The Annals of Statistics
2025-06-06Paper
Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation
Probability Theory and Related Fields
2025-02-27Paper
Information-theoretic thresholds for planted dense cycles
IEEE Transactions on Information Theory
2025-02-27Paper
Optimal spectral recovery of a planted vector in a subspace
Bernoulli
2025-02-25Paper
Detection of dense subhypergraphs by low-degree polynomials
Random Structures & Algorithms
2025-02-14Paper
Spectral methods from tensor networks
SIAM Journal on Computing
2025-01-28Paper
Sharp Phase Transitions in Estimation with Low-Degree Polynomials
(available as arXiv preprint)
2025-01-01Paper
Stochastic block models with many communities and the Kesten--Stigum bound
(available as arXiv preprint)
2025-01-01Paper
Is it easier to count communities than find them?2024-09-25Paper
Circuit lower bounds for the p-spin optimization problem
Markov Processes and Related Fields
2024-09-12Paper
Subexponential-time algorithms for sparse PCA
Foundations of Computational Mathematics
2024-07-03Paper
Average-case complexity of tensor decomposition for low-degree polynomials2024-05-08Paper
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
SIAM Journal on Computing
2024-02-28Paper
Statistical inference of a ranked community in a directed graph
(available as arXiv preprint)
2024-01-01Paper
Free Energy Wells and Overlap Gap Property in Sparse PCA
Communications on Pure and Applied Mathematics
2023-10-12Paper
Estimation under group actions: recovering orbits from invariants
Applied and Computational Harmonic Analysis
2023-07-19Paper
Computationally efficient sparse clustering
Information and Inference: A Journal of the IMA
2023-02-20Paper
scientific article; zbMATH DE number 7650426 (Why is no real title available?)
(available as arXiv preprint)
2023-02-03Paper
Is it easier to count communities than find them?2022-12-21Paper
Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio
(available as arXiv preprint)
2022-12-13Paper
Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation2022-12-13Paper
Computational barriers to estimation from low-degree polynomials
The Annals of Statistics
2022-06-24Paper
Optimal low-degree hardness of maximum independent set
Mathematical Statistics and Learning
2022-03-11Paper
The Average-Case Time Complexity of Certifying the Restricted Isometry Property
IEEE Transactions on Information Theory
2022-02-17Paper
Circuit Lower Bounds for the p-Spin Optimization Problem2021-09-03Paper
Optimal Low-Degree Hardness of Maximum Independent Set
(available as arXiv preprint)
2020-10-13Paper
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs2020-08-27Paper
Computational Barriers to Estimation from Low-Degree Polynomials
(available as arXiv preprint)
2020-08-05Paper
Statistical limits of spiked tensor models
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques
2020-05-12Paper
Statistical limits of spiked tensor models
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques
2020-05-12Paper
Spectral methods from tensor networks
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
2020-01-30Paper
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs
(available as arXiv preprint)
2020-01-01Paper
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio
(available as arXiv preprint)
2019-07-26Paper
Notes on computational-to-statistical gaps: predictions using statistical physics
Portugaliae Mathematica. Nova Série
2019-02-28Paper
Computational Hardness of Certifying Bounds on Constrained PCA Problems
(available as arXiv preprint)
2019-02-19Paper
Message-passing algorithms for synchronization problems over compact groups
Communications on Pure and Applied Mathematics
2018-11-02Paper
Optimality and sub-optimality of PCA. I: Spiked random matrix models
The Annals of Statistics
2018-10-24Paper
Optimality and sub-optimality of PCA. I: Spiked random matrix models
The Annals of Statistics
2018-10-24Paper
Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization2016-09-18Paper
A semidefinite program for unbalanced multisection in the stochastic block model2015-07-20Paper
A semidefinite program for unbalanced multisection in the stochastic block model
(available as arXiv preprint)
2015-01-01Paper


Research outcomes over time


This page was built for person: Alexander S. Wein