pith. sign in

Ankur Moitra

Identifiers

  • name variant Ankur Moitra 0.60 · backfill

Papers (44)

  1. The tractability landscape of diffusion alignment: regularization, rewards, and computational primitives cs.LG · 2026 · author #1
  2. Learning $\mathsf{AC}^0$ Under Graphical Models cs.LG · 2026 · author #3
  3. Structure learning of Hamiltonians from real-time evolution quant-ph · 2024 · author #3
  4. Learning quantum Hamiltonians at any temperature in polynomial time quant-ph · 2023 · author #3
  5. Spectral Methods from Tensor Networks cs.DS · 2018 · author #1
  6. Improved Bounds for Randomly Sampling Colorings via Linear Programming cs.DS · 2018 · author #3
  7. The Paulsen Problem Made Simple math.FA · 2018 · author #2
  8. Efficiently Learning Mixtures of Mallows Models cs.DS · 2018 · author #2
  9. Optimality and Sub-optimality of PCA I: Spiked Random Matrix Models math.ST · 2018 · author #4
  10. Learning Restricted Boltzmann Machines via Influence Maximization cs.LG · 2018 · author #3
  11. Linear Programming Bounds for Randomly Sampling Colorings cs.DS · 2018 · author #2
  12. Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their Applications cs.LG · 2018 · author #2
  13. Rates of estimation for determinantal point processes math.ST · 2017 · author #2
  14. Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications cs.LG · 2017 · author #3
  15. Robustly Learning a Gaussian: Getting Optimal Error, Efficiently cs.DS · 2017 · author #5
  16. Being Robust (in High Dimensions) Can Be Practical cs.LG · 2017 · author #5
  17. Learning Determinantal Point Processes with Moments and Cycles math.ST · 2017 · author #3
  18. Maximum likelihood estimation of determinantal point processes math.ST · 2017 · author #2
  19. Message-passing algorithms for synchronization problems over compact groups cs.IT · 2016 · author #4
  20. Approximate Counting, the Lovasz Local Lemma and Inference in Graphical Models cs.DS · 2016 · author #1
  21. Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization math.ST · 2016 · author #4
  22. Provable Algorithms for Inference in Topic Models cs.LG · 2016 · author #5
  23. Robust Estimators in High Dimensions without the Computational Intractability cs.DS · 2016 · author #5
  24. A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem cs.CC · 2016 · author #5
  25. How Robust are Reconstruction Thresholds for Community Detection? cs.DS · 2015 · author #1
  26. Beating the random assignment on constraint satisfaction problems of bounded degree cs.CC · 2015 · author #2
  27. Simple, Efficient, and Neural Algorithms for Sparse Coding cs.LG · 2015 · author #4
  28. Noisy Tensor Completion via the Sum-of-Squares Hierarchy cs.LG · 2015 · author #2
  29. Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices cs.IT · 2014 · author #1
  30. Smoothed Analysis of Tensor Decompositions cs.DS · 2013 · author #3
  31. New Algorithms for Learning Incoherent and Overcomplete Dictionaries cs.DS · 2013 · author #3
  32. A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage cs.DS · 2013 · author #4
  33. A Polynomial Time Algorithm for Lossy Population Recovery cs.DS · 2013 · author #1
  34. A Practical Algorithm for Topic Modeling with Provable Guarantees cs.LG · 2012 · author #5
  35. Algorithms and Hardness for Robust Subspace Recovery cs.CC · 2012 · author #2
  36. Provable ICA with Unknown Gaussian Noise, and Implications for Gaussian Mixtures and Autoencoders cs.LG · 2012 · author #3
  37. A Singly-Exponential Time Algorithm for Computing Nonnegative Rank cs.DS · 2012 · author #1
  38. Learning Topic Models - Going beyond SVD cs.LG · 2012 · author #3
  39. Computing a Nonnegative Matrix Factorization -- Provably cs.DS · 2011 · author #4
  40. Nearly Complete Graphs Decomposable into Large Induced Matchings and their Applications math.CO · 2011 · author #2
  41. Dueling Algorithms cs.GT · 2011 · author #4
  42. Pareto Optimal Solutions for Smoothed Analysts cs.DS · 2010 · author #1
  43. Vertex Sparsifiers and Abstract Rounding Algorithms cs.DS · 2010 · author #4
  44. Settling the Polynomial Learnability of Mixtures of Gaussians cs.LG · 2010 · author #1

Mentions

  • 1511.01473 #1 · backfill · confidence 0.70 Ankur Moitra
  • 1505.03424 #2 · backfill · confidence 0.70 Ankur Moitra
  • 1503.00778 #4 · backfill · confidence 0.70 Ankur Moitra
  • 1501.06521 #2 · backfill · confidence 0.70 Ankur Moitra
  • 1408.1681 #1 · backfill · confidence 0.70 Ankur Moitra
  • 1311.3651 #3 · backfill · confidence 0.70 Ankur Moitra
  • 1308.6273 #3 · backfill · confidence 0.70 Ankur Moitra
  • 1307.3621 #4 · backfill · confidence 0.70 Ankur Moitra
  • 1302.1515 #1 · backfill · confidence 0.70 Ankur Moitra
  • 1212.4777 #5 · backfill · confidence 0.70 Ankur Moitra
  • 1211.1041 #2 · backfill · confidence 0.70 Ankur Moitra
  • 1206.5349 #3 · backfill · confidence 0.70 Ankur Moitra
  • 1205.0044 #1 · backfill · confidence 0.70 Ankur Moitra
  • 1204.1956 #3 · backfill · confidence 0.70 Ankur Moitra
  • 1111.0952 #4 · backfill · confidence 0.70 Ankur Moitra
  • 1111.0253 #2 · backfill · confidence 0.70 Ankur Moitra
  • 1101.2883 #4 · backfill · confidence 0.70 Ankur Moitra
  • 1011.2249 #1 · backfill · confidence 0.70 Ankur Moitra
  • 1006.4536 #4 · backfill · confidence 0.70 Ankur Moitra
  • 1004.4223 #1 · backfill · confidence 0.70 Ankur Moitra

Frequent Coauthors