32 citations · 70 across the 12 of their papers we have counts for
3 papers · 1 filter
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…
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…
Sample Amplification: Increasing Dataset Size even when Learning is Impossible
Brian Axelrod, Shivam Garg, Vatsal Sharan +1
Given data drawn from an unknown distribution, , to what extent is it possible to ``amplify'' this dataset and output an even larger set of samples that appear to have been draw…