| Publication | Date of Publication | Type |
|---|
| Learning polynomial transformations via generalized tensor decompositions | 2024-05-08 | Paper |
Clustering mixture models in almost-linear time via list-decodable mean estimation
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Clustering mixtures with almost optimal separation in polynomial time
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Quantum advantage in learning from experiments
Science | 2023-11-24 | Paper |
| Finding an Approximate Mode of a Kernel Density Estimate. | 2023-09-20 | Paper |
Challenges of real-world reinforcement learning: definitions, benchmarks and analysis
Machine Learning | 2022-01-28 | Paper |
Exact model counting of query expressions. Limitations of propositional methods
ACM Transactions on Database Systems | 2021-11-25 | Paper |
| The Price of Tolerance in Distribution Testing | 2021-06-24 | Paper |
Sample Efficient Toeplitz Covariance Estimation
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Efficiently learning structured distributions from untrusted batches
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Learning mixtures of linear regressions in subexponential time via Fourier moments
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Positive semidefinite programming: mixed, parallel, and width-independent
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Positive Semidefinite Programming: Mixed, Parallel, and Width-Independent
(available as arXiv preprint) | 2020-02-12 | Paper |
Mixture models, robustness, and sum of squares proofs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Robust estimators in high-dimensions without the computational intractability
SIAM Journal on Computing | 2019-05-07 | Paper |
Sample-optimal density estimation in nearly-linear time
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Robustly learning a Gaussian: getting optimal error, efficiently | 2018-03-15 | Paper |
Robustly learning a Gaussian: getting optimal error, efficiently
(available as arXiv preprint) | 2018-03-15 | Paper |
The power of choice in priority scheduling
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
Replacing mark bits with randomness in Fibonacci heaps
Automata, Languages, and Programming | 2015-10-27 | Paper |
Black-Box $k$-to-$1$-PCA Reductions: Theory and Applications
(available as arXiv preprint) | N/A | Paper |
