32 citations · 70 across the 12 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019
Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
Brian Axelrod, Yang P. Liu, Aaron Sidford
In this paper we provide improved running times and oracle complexities for approximately minimizing a submodular function. Our main result is a randomized algorithm, which given a…
cs.DS2019★ 1 cited
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families
Brian Axelrod, Ilias Diakonikolas, Anastasios Sidiropoulos +2
We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given points…
cs.DS2018★ 3 cited
An Efficient Algorithm for High-Dimensional Log-Concave Maximum Likelihood
Brian Axelrod, Gregory Valiant
The log-concave maximum likelihood estimator (MLE) problem answers: for a set of points , which log-concave density maximizes their likelihood? We prese…