The following pages link to Ankur Moitra (Q363227):
Displaying 41 items.
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- Some results on greedy embeddings in metric spaces (Q603850) (← links)
- Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
- The Paulsen problem made simple (Q2130546) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders (Q2345948) (← links)
- How many subpopulations is too many? Exponential lower bounds for inferring population histories (Q2415258) (← links)
- Computing a Nonnegative Matrix Factorization---Provably (Q2817794) (← links)
- Extensions and limits to vertex sparsification (Q2875131) (← links)
- Efficiently learning mixtures of two Gaussians (Q2875182) (← links)
- Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices (Q2941579) (← links)
- Efficient Coding for Interactive Communication (Q2986511) (← links)
- Algorithmic Aspects of Machine Learning (Q3177480) (← links)
- Robustly Learning a Gaussian: Getting Optimal Error, Efficiently (Q4608066) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Robust Estimators in High-Dimensions Without the Computational Intractability (Q4634036) (← links)
- Pareto Optimal Solutions for Smoothed Analysts (Q4907582) (← links)
- Message‐Passing Algorithms for Synchronization Problems over Compact Groups (Q4962468) (← links)
- Approximate counting, the Lovasz local lemma, and inference in graphical models (Q4977985) (← links)
- Semirandom Stochastic Block Models (Q5027276) (← links)
- Topic Models and Nonnegative Matrix Factorization (Q5027286) (← links)
- (Q5090418) (← links)
- Efficiently learning structured distributions from untrusted batches (Q5144981) (← links)
- Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size (Q5171158) (← links)
- Learning restricted Boltzmann machines via influence maximization (Q5212822) (← links)
- Beyond the low-degree algorithm: mixtures of subcubes and their applications (Q5212827) (← links)
- Spectral methods from tensor networks (Q5212833) (← links)
- Improved Bounds for Randomly Sampling Colorings via Linear Programming (Q5236321) (← links)
- Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models (Q5244383) (← links)
- Smoothed analysis of tensor decompositions (Q5259595) (← links)
- (Q5365095) (← links)
- A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage (Q5384009) (← links)
- Vertex Sparsification and Oblivious Reductions (Q5408771) (← links)
- Computing a nonnegative matrix factorization -- provably (Q5415472) (← links)
- Nearly complete graphs decomposable into large induced matchings and their applications (Q5415536) (← links)
- Dueling algorithms (Q5419091) (← links)
- Efficient and Explicit Coding for Interactive Communication (Q5495041) (← links)
- An information complexity approach to extended formulations (Q5495786) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5741813) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
- The Paulsen Problem Made Simple (Q6306654) (← links)