Publications

Preprints

I. Diakonikolas, D. Kane, A. Stewart Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures.

I. Diakonikolas, D. Kane, A. Stewart Robust Learning of Fixed-Structure Bayesian Networks.

I. Diakonikolas, D. Kane, A. Stewart Efficient Robust Proper Learning of Log-concave Distributions.

I. Diakonikolas, D. Kane, A. Stewart Learning Multivariate Log-concave Distributions.

Accepted papers

Y. Cheng, I. Diakonikolas, A. Stewart Playing Anonymous Games using Simple Strategies at the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017).

I. Diakonikolas, G. Kamath, D. Kane, J. Li, A. Moitra, A. Stewart Robust Estimators in High Dimensions without the Computational Intractability at the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016).

I. Diakonikolas, D. Kane, A. Stewart Properly Learning Poisson Binomial Distributions in Almost Polynomial Time at the 29th Annual Conference on Learning Theory (COLT 2016).

I. Diakonikolas, D. Kane, A. Stewart Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables at the 29th Annual Conference on Learning Theory (COLT 2016).

I. Diakonikolas, D. Kane, A. Stewart The Fourier Transform of Poisson Multinomial Distributions and its Algorithmic Applications at the 48th Annual ACM Symposium on Theory of Computing (STOC 2016).

K. Etessami, A. Stewart, M. Yannakakis, Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes at 42th Int. Coll. on Automata, Languages and Programming (ICALP'15).

K. Etessami, A. Stewart, M. Yannakakis, Stochastic Context-Free Grammars, Regular Languages, and Newton's Method at 40th Int. Coll. on Automata, Languages and Programming (ICALP'13).

A. Stewart, K. Etessami, M. Yannakakis, Upper bounds for Newton's method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata at 25th International Conference on Computer Aided Verification(CAV'2013).

K. Etessami, A. Stewart, M. Yannakakis, Polynomial-time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations at 39th Int. Coll. on Automata, Languages and Programming (ICALP'12).

K. Etessami, A. Stewart, M. Yannakakis, Polynomial-time Algorithms for Multi-type Branching Processes and Stochastic Context-Free Grammars at ACM Symposium on Theory of Computing (STOC'12).