Ankur Moitra

Available identifiers

zbMath Open moitra.ankurMaRDI QIDQ363227

List of research outcomes

Publication	Date of Publication	Type
Kalman filtering with adversarial corruptions	2023-12-08	Paper
Algorithmic foundations for the diffraction limit	2023-11-14	Paper
Settling the robust learnability of mixtures of Gaussians	2023-11-14	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
Learning restricted Boltzmann machines via influence maximization	2020-01-30	Paper
Beyond the low-degree algorithm: mixtures of subcubes and their applications	2020-01-30	Paper
Spectral methods from tensor networks	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
A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem	2019-05-07	Paper
Robust Estimators in High-Dimensions Without the Computational Intractability	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
Algorithmic Aspects of Machine Learning	2018-07-26	Paper
Robustly Learning a Gaussian: Getting Optimal Error, Efficiently	2018-03-15	Paper
https://portal.mardi4nfdi.de/entity/Q5365095	2017-09-29	Paper
Approximate counting, the Lovasz local lemma, and inference in graphical models	2017-08-17	Paper
Efficient Coding for Interactive Communication	2017-05-16	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
Extensions and limits to vertex sparsification	2014-08-13	Paper
Efficiently learning mixtures of two Gaussians	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
Pareto Optimal Solutions for Smoothed Analysts	2014-06-05	Paper
Dueling algorithms	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

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Ankur Moitra