Alistair Stewart
Alistair Stewart
Web3 foundation
Email verificata su web3.foundation - Home page
Titolo
Citata da
Citata da
Anno
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
1522019
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
652017
Being robust (in high dimensions) can be practical
I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart
Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017
622017
Sever: A robust meta-algorithm for stochastic optimization
I Diakonikolas, G Kamath, DM Kane, J Li, J Steinhardt, A Stewart
arXiv preprint arXiv:1803.02815, 2018
592018
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
532018
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
452018
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
372019
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
302018
Testing bayesian networks
C Canonne, I Diakonikolas, D Kane, A Stewart
arXiv preprint arXiv:1612.03156, 2016
282016
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
282016
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
282016
Robust learning of fixed-structure bayesian networks
I Diakonikolas, DM Kane, A Stewart
CoRR, abs/1606.07384, 2016
27*2016
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
242012
Efficient robust proper learning of log-concave distributions
I Diakonikolas, DM Kane, A Stewart
arXiv preprint arXiv:1606.03077, 2016
222016
Properly learning poisson binomial distributions in almost polynomial time
I Diakonikolas, DM Kane, A Stewart
Conference on Learning Theory, 850-878, 2016
212016
Learning multivariate log-concave distributions
I Diakonikolas, DM Kane, A Stewart
arXiv preprint arXiv:1605.08188, 2016
202016
Polynomial time algorithms for branching Markov decision processes and probabilistic min (max) polynomial Bellman equations
K Etessami, A Stewart, M Yannakakis
Mathematics of Operations Research 45 (1), 34-62, 2020
162020
Testing conditional independence of discrete distributions
CL Canonne, I Diakonikolas, DM Kane, A Stewart
2018 Information Theory and Applications Workshop (ITA), 1-57, 2018
132018
Upper bounds for Newton’s method on monotone polynomial systems, and P-time model checking of probabilistic one-counter automata
A Stewart, K Etessami, M Yannakakis
Journal of the ACM (JACM) 62 (4), 1-33, 2015
132015
Near-optimal sample complexity bounds for maximum likelihood estimation of multivariate log-concave densities
T Carpenter, I Diakonikolas, A Sidiropoulos, A Stewart
arXiv preprint arXiv:1802.10575, 2018
122018
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20