The following pages link to Alexander S. Wein (Q1729829):
Displaying 19 items.
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Optimal low-degree hardness of maximum independent set (Q2113266) (← links)
- Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
- Statistical limits of spiked tensor models (Q2179237) (← links)
- Message‐Passing Algorithms for Synchronization Problems over Compact Groups (Q4962468) (← links)
- The Average-Case Time Complexity of Certifying the Restricted Isometry Property (Q5032580) (← links)
- Spectral methods from tensor networks (Q5212833) (← links)
- (Q5875785) (← links)
- Computationally efficient sparse clustering (Q5878241) (← links)
- Free Energy Wells and Overlap Gap Property in Sparse PCA (Q6074556) (← links)
- Estimation under group actions: recovering orbits from invariants (Q6172176) (← links)
- Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics (Q6203476) (← links)
- Computational Hardness of Certifying Bounds on Constrained PCA Problems (Q6314315) (← links)
- Tensor cumulants for statistical inference on invariant distributions (Q6532529) (← links)
- Subexponential-time algorithms for sparse PCA (Q6566150) (← links)
- Circuit lower bounds for the \(p\)-spin optimization problem (Q6604527) (← links)
- Is it easier to count communities than find them? (Q6610367) (← links)
