142 citations · 338 across the 19 of their papers we have counts for
5 papers · 1 filter
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities
Ilias Diakonikolas, Anastasios Sidiropoulos, Alistair Stewart
We study the problem of computing the maximum likelihood estimator (MLE) of multivariate log-concave densities. Our main result is the first computationally efficient algorithm for…
Reachability for Branching Concurrent Stochastic Games
Kousha Etessami, Emanuel Martinov, Alistair Stewart +1
We give polynomial time algorithms for deciding almost-sure and limit-sure reachability in Branching Concurrent Stochastic Games (BCSGs). These are a class of infinite-state imperf…
Efficient Algorithms and Lower Bounds for Robust Linear Regression
Ilias Diakonikolas, Weihao Kong, Alistair Stewart
We study the problem of high-dimensional linear regression in a robust model where an -fraction of the samples can be adversarially corrupted. We focus on the fundamental settin…
Sever: A Robust Meta-Algorithm for Stochastic Optimization
Ilias Diakonikolas, Gautam Kamath, Daniel M. Kane +3
In high dimensions, most machine learning methods are brittle to even a small fraction of structured outliers. To address this, we introduce a new meta-algorithm that can take in a…
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities
Timothy Carpenter, Ilias Diakonikolas, Anastasios Sidiropoulos +1
We study the problem of learning multivariate log-concave densities with respect to a global loss function. We obtain the first upper bound on the sample complexity of the maximum…