| Publication | Date of Publication | Type |
|---|
| Fast sampling of satisfying assignments from random \(k\)-SAT with applications to connectivity | 2024-11-05 | Paper |
| Sums of squares in theoretical computer science | 2024-07-16 | Paper |
| From algorithms to connectivity and back: finding a giant component in random \(k\)-SAT | 2024-05-14 | Paper |
| Robust voting rules from algorithmic robust statistics | 2024-05-14 | Paper |
| Planning and learning in partially observable systems via filter stability | 2024-05-08 | Paper |
| Kalman filtering with adversarial corruptions | 2023-12-08 | Paper |
| Settling the robust learnability of mixtures of Gaussians | 2023-11-14 | Paper |
| Algorithmic foundations for the diffraction limit | 2023-11-14 | Paper |
| The Power of an Adversary in Glauber Dynamics | 2023-02-21 | Paper |
| A New Approach to Learning Linear Dynamical Systems | 2023-01-23 | Paper |
| Minimax Rates for Robust Community Detection | 2022-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090418 | 2022-07-18 | Paper |
| Noisy tensor completion via the sum-of-squares hierarchy | 2022-06-14 | Paper |
| The Paulsen problem made simple | 2022-04-25 | Paper |
| Semirandom Stochastic Block Models | 2022-02-04 | Paper |
| Topic Models and Nonnegative Matrix Factorization | 2022-02-04 | Paper |
| Efficiently learning structured distributions from untrusted batches | 2021-01-19 | Paper |
| Fast Convergence for Langevin Diffusion with Manifold Structure | 2020-02-13 | Paper |
| Spectral methods from tensor networks | 2020-01-30 | Paper |
| Beyond the low-degree algorithm: mixtures of subcubes and their applications | 2020-01-30 | Paper |
| Learning restricted Boltzmann machines via influence maximization | 2020-01-30 | Paper |
| Approximate counting, the Lovász local lemma, and inference in graphical models | 2019-11-21 | Paper |
| Improved bounds for randomly sampling colorings via linear programming | 2019-10-15 | Paper |
| A polynomial-time approximation scheme for fault-tolerant distributed storage | 2019-06-20 | Paper |
| How many subpopulations is too many? Exponential lower bounds for inferring population histories | 2019-05-21 | Paper |
| An almost optimal algorithm for computing nonnegative rank | 2019-05-15 | Paper |
| Robust Estimators in High-Dimensions Without the Computational Intractability | 2019-05-07 | Paper |
| A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem | 2019-05-07 | Paper |
| Message-passing algorithms for synchronization problems over compact groups | 2018-11-02 | Paper |
| Optimality and sub-optimality of PCA. I: Spiked random matrix models | 2018-10-24 | Paper |
| The Paulsen Problem Made Simple | 2018-09-12 | Paper |
| Algorithmic aspects of machine learning | 2018-07-26 | Paper |
| Linear Programming Bounds for Randomly Sampling Colorings | 2018-04-09 | Paper |
| Robustly learning a Gaussian: getting optimal error, efficiently | 2018-03-15 | Paper |
| Capacitated metric labeling | 2017-09-29 | Paper |
| Approximate counting, the Lovász local lemma, and inference in graphical models | 2017-08-17 | Paper |
| Rates of estimation for determinantal point processes | 2017-06-03 | Paper |
| Efficient Coding for Interactive Communication | 2017-05-16 | Paper |
| Learning Determinantal Point Processes with Moments and Cycles | 2017-03-01 | Paper |
| Maximum likelihood estimation of determinantal point processes | 2017-01-23 | Paper |
| Optimality and Sub-optimality of PCA for Spiked Random Matrices and Synchronization | 2016-09-18 | Paper |
| Computing a nonnegative matrix factorization -- provably | 2016-09-02 | Paper |
| An almost optimal algorithm for computing nonnegative rank | 2016-02-05 | Paper |
| Super-resolution, extremal functions and the condition number of Vandermonde matrices | 2015-08-21 | Paper |
| Smoothed analysis of tensor decompositions | 2015-06-26 | Paper |
| Provable ICA with unknown Gaussian noise, and implications for Gaussian mixtures and autoencoders | 2015-05-21 | Paper |
| Efficiently learning mixtures of two Gaussians | 2014-08-13 | Paper |
| Extensions and limits to vertex sparsification | 2014-08-13 | Paper |
| An information complexity approach to extended formulations | 2014-08-07 | Paper |
| Efficient and Explicit Coding for Interactive Communication | 2014-07-30 | Paper |
| Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size | 2014-07-25 | Paper |
| Dueling algorithms | 2014-06-05 | Paper |
| Pareto optimal solutions for smoothed analysts | 2014-06-05 | Paper |
| Computing a nonnegative matrix factorization -- provably | 2014-05-13 | Paper |
| Nearly complete graphs decomposable into large induced matchings and their applications | 2014-05-13 | Paper |
| Vertex sparsification and oblivious reductions | 2014-04-11 | Paper |
| Nearly complete graphs decomposable into large induced matchings and their applications | 2013-09-02 | Paper |
| Pareto optimal solutions for smoothed analysts | 2013-02-04 | Paper |
| Some results on greedy embeddings in metric spaces | 2010-11-08 | Paper |
| Strong spatial mixing for colorings on trees and its algorithmic applications | N/A | Paper |
| High-Temperature Gibbs States are Unentangled and Efficiently Preparable | N/A | Paper |
