Alistair Stewart

发表

Being Robust (in High Dimensions) Can Be Practical pdf

Jerry Li, Daniel M. Kane, Ankur Moitra, 2017, ICML.

Robustly Learning a Gaussian: Getting Optimal Error, Efficiently pdf

Jerry Li, Daniel M. Kane, Ankur Moitra, 2017, SODA.

List-decodable robust mean estimation and learning mixtures of spherical gaussians

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2017, STOC.

Robust Estimators in High Dimensions without the Computational Intractability

Daniel M. Kane, Ankur Moitra, Ilias Diakonikolas, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

Efficient Algorithms and Lower Bounds for Robust Linear Regression

Ilias Diakonikolas, Alistair Stewart, Weihao Kong, 2018, SODA.

Statistical Query Lower Bounds for Robust Estimation of High-Dimensional Gaussians and Gaussian Mixtures

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Learning geometric concepts with nasty noise

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2017, STOC.

Robust Estimators in High Dimensions without the Computational Intractability

Daniel M. Kane, Ankur Moitra, Ilias Diakonikolas, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes

M. Yannakakis, Alistair Stewart, K. Etessami, 2017, SIAM J. Comput..

Efficient algorithms for infinite-state recursive stochastic models and Newton's method

Alistair Stewart, 2015 .

Sever: A Robust Meta-Algorithm for Stochastic Optimization

Jerry Li, Daniel M. Kane, Ilias Diakonikolas, 2018, ICML.

Efficient Robust Proper Learning of Log-concave Distributions pdf

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2016, ArXiv.

Efficient Approximation Algorithms for the Inverse Semivalue Problem

Ilias Diakonikolas, Alistair Stewart, Chrystalla Pavlou, 2022, AAMAS.

Playing Anonymous Games using Simple Strategies

Ilias Diakonikolas, Alistair Stewart, Yu Cheng, 2016, SODA.

Edinburgh Research Explorer Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes

Alistair Stewart, K. Etessami, 2016 .

Explorer Greatest Fixed Points of Probabilistic Min / Max Polynomial Equations , and Reachability for Branching Markov Decision Processes ?

M. Yannakakis, Alistair Stewart, K. Etessami, 2016 .

Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2013, J. ACM.

A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2013, TOCT.

Outlier-Robust High-Dimensional Sparse Estimation via Iterative Filtering

Ilias Diakonikolas, Alistair Stewart, Eric Price, 2019, NeurIPS.

Robustness meets algorithms

Daniel M. Kane, Ankur Moitra, Ilias Diakonikolas, 2021, Commun. ACM.

Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2012, STOC '12.

Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2012, ArXiv.

Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2018, Inf. Comput..

Reachability for Branching Concurrent Stochastic Games pdf

Kousha Etessami, Mihalis Yannakakis, Alistair Stewart, 2018, ICALP.

The fourier transform of poisson multinomial distributions and its algorithmic applications

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2015, STOC.

Testing Bayesian Networks

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2016, IEEE Transactions on Information Theory.

A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families

Ilias Diakonikolas, Alistair Stewart, Gregory Valiant, 2019, NeurIPS.

Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities pdf

Ilias Diakonikolas, Alistair Stewart, Anastasios Sidiropoulos, 2018, COLT.

Robust Learning of Fixed-Structure Bayesian Networks

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2016, NeurIPS.

Statistical Query Lower Bounds for List-Decodable Linear Regression pdf

Ankit Pensia, Daniel M. Kane, Ilias Diakonikolas, 2021, NeurIPS.

A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities pdf

Ilias Diakonikolas, Alistair Stewart, Anastasios Sidiropoulos, 2018, ArXiv.

Learning Multivariate Log-concave Distributions

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2016, COLT.

Properly Learning Poisson Binomial Distributions in Almost Polynomial Time

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2015, COLT.

Optimal Learning via the Fourier Transform for Sums of Independent Integer Random Variables

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2015, COLT.

Nearly Optimal Learning and Sparse Covers for Sums of Independent Integer Random Variables pdf

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2015, ArXiv.

Outlier-Robust Learning of Ising Models Under Dobrushin's Condition

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2021, COLT.

Fourier-Based Testing for Families of Distributions pdf

Ilias Diakonikolas, Alistair Stewart, Clément L. Canonne, 2017, Electron. Colloquium Comput. Complex..

Testing for Families of Distributions via the Fourier Transform

Ilias Diakonikolas, Alistair Stewart, Clément L. Canonne, 2018, NeurIPS.

Testing Conditional Independence of Discrete Distributions

Daniel M. Kane, Ilias Diakonikolas, Alistair Stewart, 2017, 2018 Information Theory and Applications Workshop (ITA).