The following pages link to Praneeth Netrapalli (Q2953638):
Displaying 14 items.
- (Q2953639) (← links)
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries (Q2979124) (← links)
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization (Q3179269) (← links)
- (Q4558562) (← links)
- Phase Retrieval Using Alternating Minimization (Q4580795) (← links)
- Making the Last Iterate of SGD Information Theoretically Optimal (Q4987277) (← links)
- Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness (Q4993271) (← links)
- On Nonconvex Optimization for Machine Learning (Q5056442) (← links)
- A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares) (Q5136291) (← links)
- Low-rank matrix completion using alternating minimization (Q5495837) (← links)
- Non-Reconstructability in the Stochastic Block Model (Q6250993) (← links)
- Fast Exact Matrix Completion with Finite Samples (Q6256129) (← links)
- Information-theoretic thresholds for community detection in sparse networks (Q6275317) (← links)
- A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm (Q6313892) (← links)