Follow
Alistair Stewart
Alistair Stewart
Web3 foundation
Verified email at web3.foundation - Homepage
Title
Cited by
Cited by
Year
Robust estimators in high-dimensions without the computational intractability
I Diakonikolas, G Kamath, D Kane, J Li, A Moitra, A Stewart
SIAM Journal on Computing 48 (2), 742-864, 2019
3292019
Sever: A robust meta-algorithm for stochastic optimization
I Diakonikolas, G Kamath, D Kane, J Li, J Steinhardt, A Stewart
International Conference on Machine Learning, 1596-1606, 2019
1972019
Being robust (in high dimensions) can be practical
I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart
International Conference on Machine Learning, 999-1008, 2017
1772017
Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures
I Diakonikolas, DM Kane, A Stewart
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 73-84, 2017
1432017
Efficient algorithms and lower bounds for robust linear regression
I Diakonikolas, W Kong, A Stewart
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
1032019
Robustly learning a gaussian: Getting optimal error, efficiently
I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
1032018
List-decodable robust mean estimation and learning mixtures of spherical gaussians
I Diakonikolas, DM Kane, A Stewart
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
992018
Testing bayesian networks
CL Canonne, I Diakonikolas, DM Kane, A Stewart
Conference on Learning Theory, 370-448, 2017
562017
Learning geometric concepts with nasty noise
I Diakonikolas, DM Kane, A Stewart
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
522018
Robust learning of fixed-structure Bayesian networks
Y Cheng, I Diakonikolas, D Kane, A Stewart
Advances in Neural Information Processing Systems 31, 2018
48*2018
The fourier transform of poisson multinomial distributions and its algorithmic applications
I Diakonikolas, DM Kane, A Stewart
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
382016
Optimal learning via the fourier transform for sums of independent integer random variables
I Diakonikolas, DM Kane, A Stewart
Conference on Learning Theory, 831-849, 2016
342016
Testing conditional independence of discrete distributions
CL Canonne, I Diakonikolas, DM Kane, A Stewart
2018 Information Theory and Applications Workshop (ITA), 1-57, 2018
312018
Overview of polkadot and its design considerations
J Burdges, A Cevallos, P Czaban, R Habermeier, S Hosseini, F Lama, ...
arXiv preprint arXiv:2005.13456, 2020
292020
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars
K Etessami, A Stewart, M Yannakakis
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
272012
Efficient robust proper learning of log-concave distributions
I Diakonikolas, DM Kane, A Stewart
arXiv preprint arXiv:1606.03077, 2016
252016
Properly learning poisson binomial distributions in almost polynomial time
I Diakonikolas, DM Kane, A Stewart
Conference on Learning Theory, 850-878, 2016
252016
Learning multivariate log-concave distributions
I Diakonikolas, DM Kane, A Stewart
Conference on Learning Theory, 711-727, 2017
242017
Polynomial time algorithms for branching Markov decision processes and probabilistic min (max) polynomial Bellman equations
K Etessami, A Stewart, M Yannakakis
International Colloquium on Automata, Languages, and Programming, 314-326, 2012
23*2012
Near-optimal sample complexity bounds for maximum likelihood estimation of multivariate log-concave densities
T Carpenter, I Diakonikolas, A Sidiropoulos, A Stewart
Conference On Learning Theory, 1234-1262, 2018
192018
The system can't perform the operation now. Try again later.
Articles 1–20