Ankur Moitra
35 papers · 2012–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+12 more ↓ Show less ↑
π§ Keyword Pioneer π£ Hot Topic Early Bird πΊοΈ Taxonomy Completionist (12) π Interdisciplinary Bridge π Conference Polyglot (4)
π
Cross-Pollinator
(13)
π
Renaissance Researcher
(10)
πΊοΈ
Taxonomy Completionist
(12)
π
Triple Crown
π
Keyword Champion
ποΈ
Keyword Collector
(154)
β‘
Prolific Year
(7)
π
Conference Pioneer
π
Trend Setter
π
Century Club
(35)
π₯
Unstoppable
(6)
β
The Questioner
(3)
Conferences
COLT (15)
NIPS (12)
ICML (6)
ICLR (2)
Top co-authors
Research topics
Keywords
robust estimation
(4)
sparse recovery
(3)
sample complexity
(3)
incoherent dictionary
(2)
gaussian mixture model
(2)
provable guarantee
(2)
tensor completion
(2)
unsupervised learning
(2)
dictionary learning
(2)
determinantal point process
(2)
matrix factorization
(2)
topic model
(2)
provable algorithm
(2)
semidefinite programming
(2)
alternating minimization
(2)
latent variable model
(2)
sparse coding
(2)
structure learning
(2)
probabilistic modeling
(1)
learning theory
(1)
Papers
Conference on Learning Theory 2025: Preface
COLT 2025
Towards characterizing the value of edge embeddings in Graph Neural Networks
ICML 2025
Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions
COLT 2024
Edit Distance Robust Watermarks via Indexing Pseudorandom Codes
NIPS 2024
The power of an adversary in Glauber dynamics
COLT 2024
Distilling Model Failures as Directions in Latent Space
ICLR 2023
Tensor Decompositions Meet Control Theory: Learning General Mixtures of Linear Dynamical Systems
ICML 2023
Provable benefits of score matching
NIPS 2023
Provably Auditing Ordinary Least Squares in Low Dimensions
ICLR 2023
Learning GMMs with Nearly Optimal Robustness Guarantees
COLT 2022
Learning in Observable POMDPs, without Computationally Intractable Oracles
NIPS 2022
Robust Model Selection and Nearly-Proper Learning for GMMs
NIPS 2022
Polynomial time guarantees for the Burer-Monteiro method
NIPS 2022
Can Q-learning be Improved with Advice?
COLT 2022
Learning to Sample from Censored Markov Random Fields
COLT 2021
A No-go Theorem for Robust Acceleration in the Hyperbolic Plane
NIPS 2021
Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Evolvability
NIPS 2020
Learning Structured Distributions From Untrusted Batches: Faster and Simpler
NIPS 2020
Tensor Completion Made Practical
NIPS 2020
Better Algorithms for Estimating Non-Parametric Models in Crowd-Sourcing and Rank Aggregation
COLT 2020
Parallels Between Phase Transitions and Circuit Complexity?
COLT 2020
Rigorous Guarantees for Tylerβs M-Estimator via Quantum Expansion
COLT 2020
Learning Some Popular Gaussian Graphical Models without Condition Number Bounds
NIPS 2020
Rates of estimation for determinantal point processes
COLT 2017
Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications
NIPS 2017
Being Robust (in High Dimensions) Can Be Practical
ICML 2017
Learning Determinantal Point Processes with Moments and Cycles
ICML 2017
Provable Algorithms for Inference in Topic Models
ICML 2016
Noisy Tensor Completion via the Sum-of-Squares Hierarchy
COLT 2016
Simple, Efficient, and Neural Algorithms for Sparse Coding
COLT 2015
Open Problem: Tensor Decompositions: Algorithms up to the Uniqueness Threshold?
COLT 2014
New Algorithms for Learning Incoherent and Overcomplete Dictionaries
COLT 2014
A Practical Algorithm for Topic Modeling with Provable Guarantees
ICML 2013
Algorithms and Hardness for Robust Subspace Recovery
COLT 2013
Provable ICA with Unknown Gaussian Noise, with Implications for Gaussian Mixtures and Autoencoders
NIPS 2012