The following pages link to Afonso S. Bandeira (Q295813):
Displaying 50 items.
- Derandomizing restricted isometries via the Legendre symbol (Q295815) (← links)
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries (Q317469) (← links)
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- The road to deterministic matrices with the restricted isometry property (Q485193) (← links)
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization (Q526833) (← links)
- Landau's necessary density conditions for the Hankel transform (Q665500) (← links)
- Discrete uncertainty principles and sparse signal processing (Q667658) (← links)
- A note on probably certifiably correct algorithms (Q1695210) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Random Laplacian matrices and convex relaxations (Q1750385) (← links)
- Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
- The spectral norm of random lifts of matrices (Q2064811) (← links)
- Dual bounds for the positive definite functions approach to mutually unbiased bases (Q2098296) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- Community detection with a subsampled semidefinite program (Q2143169) (← links)
- Optimal rates of estimation for multi-reference alignment (Q2176073) (← links)
- Statistical limits of spiked tensor models (Q2179237) (← links)
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian (Q2235162) (← links)
- Saving phase: injectivity and stability for phase retrieval (Q2252507) (← links)
- Marčenko-Pastur law for Kendall's tau (Q2362533) (← links)
- A remark on Kashin's discrepancy argument and partial coloring in the Komlós conjecture (Q2694631) (← links)
- Phase retrieval with polarization (Q2876797) (← links)
- Convergence of Trust-Region Methods Based on Probabilistic Models (Q2934477) (← links)
- Linear Boolean Classification, Coding and the Critical Problem (Q2976887) (← links)
- Exact Recovery in the Stochastic Block Model (Q2977080) (← links)
- Multireference alignment using semidefinite programming (Q2988900) (← links)
- Relax, No Need to Round (Q2989030) (← links)
- Certifying the Restricted Isometry Property is Hard (Q2989185) (← links)
- A Conditional Construction of Restricted Isometries (Q4611870) (← links)
- Message‐Passing Algorithms for Synchronization Problems over Compact Groups (Q4962468) (← links)
- Non-unique games over compact groups and orientation estimation in cryo-EM (Q5000617) (← links)
- The Sample Complexity of Multireference Alignment (Q5025787) (← links)
- The Average-Case Time Complexity of Certifying the Restricted Isometry Property (Q5032580) (← links)
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs (Q5114191) (← links)
- Phase retrieval from power spectra of masked signals (Q5177864) (← links)
- Spurious Valleys in Two-layer Neural Network Optimization Landscapes (Q5214225) (← links)
- On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization (Q5231691) (← links)
- A Cheeger Inequality for the Graph Connection Laplacian (Q5413664) (← links)
- (Q5875785) (← links)
- Computationally efficient sparse clustering (Q5878241) (← links)
- Resilience for the Littlewood-Offord problem (Q5915806) (← links)
- Resilience for the Littlewood-Offord problem (Q5920087) (← links)
- Likelihood Maximization and Moment Matching in Low <scp>SNR</scp> Gaussian Mixture Models (Q6049738) (← links)
- Matrix concentration inequalities and free probability (Q6072325) (← links)
- Estimation under group actions: recovering orbits from invariants (Q6172176) (← links)
- Guarantees for Spontaneous Synchronization on Random Geometric Graphs (Q6196197) (← links)
- The non-convex Burer-Monteiro approach works on smooth semidefinite programs (Q6274668) (← links)
- Computational Hardness of Certifying Bounds on Constrained PCA Problems (Q6314315) (← links)
- Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio (Q6322739) (← links)
- Dual bounds for the positive definite functions approach to mutually unbiased bases (Q6392247) (← links)
