Articles avec mandats d'accès public - Alistair StewartEn savoir plus
Disponibles quelque part : 20
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
Exigences : US National Science Foundation, US Department of Defense, UK Engineering and …
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
Exigences : US National Science Foundation, US Department of Defense
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
Exigences : US National Science Foundation, US Department of Defense
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
Exigences : US National Science Foundation
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
Exigences : US National Science Foundation, US Department of Defense
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
Exigences : US National Science Foundation
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
Exigences : US National Science Foundation, US Department of Defense
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
Exigences : US National Science Foundation
Robust learning of fixed-structure Bayesian networks
Y Cheng, I Diakonikolas, D Kane, A Stewart
Advances in Neural Information Processing Systems 31, 2018
Exigences : US National Science Foundation
Testing conditional independence of discrete distributions
CL Canonne, I Diakonikolas, DM Kane, A Stewart
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
Exigences : US National Science Foundation
Outlier-robust high-dimensional sparse estimation via iterative filtering
I Diakonikolas, D Kane, S Karmalkar, E Price, A Stewart
Advances in Neural Information Processing Systems 32, 2019
Exigences : US National Science Foundation
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
Exigences : UK Engineering and Physical Sciences Research Council
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
Exigences : US National Science Foundation, UK Engineering and Physical Sciences …
Properly learning poisson binomial distributions in almost polynomial time
I Diakonikolas, DM Kane, A Stewart
Conference on Learning Theory, 850-878, 2016
Exigences : US National Science Foundation, UK Engineering and Physical Sciences …
Statistical query lower bounds for list-decodable linear regression
I Diakonikolas, D Kane, A Pensia, T Pittas, A Stewart
Advances in Neural Information Processing Systems 34, 3191-3204, 2021
Exigences : US National Science Foundation, US Department of Defense
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes
K Etessami, A Stewart, M Yannakakis
Information and Computation 261, 355-382, 2018
Exigences : US National Science Foundation, Royal Society UK
Robustness Meets Algorithms
I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart
Communications of the ACM 64 (5), 107-115, 2021
Exigences : US National Science Foundation, US Department of Defense
A polynomial time algorithm for log-concave maximum likelihood via locally exponential families
B Axelrod, I Diakonikolas, A Stewart, A Sidiropoulos, G Valiant
Advances in Neural Information Processing Systems 32, 2019
Exigences : US National Science Foundation, US Department of Defense
A polynomial time algorithm for computing extinction probabilities of multitype branching processes
K Etessami, A Stewart, M Yannakakis
SIAM Journal on Computing 46 (5), 1515-1553, 2017
Exigences : US National Science Foundation
Nearly optimal learning and sparse covers for sums of independent integer random variables
I Diakonikolas, DM Kane, A Stewart
ArXiV, abs/1505.00662, May, 2015
Exigences : UK Engineering and Physical Sciences Research Council
Les informations concernant la publication et le financement sont déterminées automatiquement par un programme informatique