11 citations · 20 across the 11 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…
Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version)
Feilong Liu, Ario Salmasi, Spyros Blanas +1
Parallel aggregation is a ubiquitous operation in data analytics that is expressed as GROUP BY in SQL, reduce in Hadoop, or segment in TensorFlow. Parallel aggregation starts with…
Algorithms for metric learning via contrastive embeddings
Diego Ihara Centurion, Neshat Mohammadi, Anastasios Sidiropoulos
We study the problem of supervised learning a metric space under discriminative constraints. Given a universe and sets of similar and…
Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
Tanima Chatterjee, Bhaskar DasGupta, Laura Palmieri +2
Partisan gerrymandering is a major cause for voter disenfranchisement in United States. However, convincing US courts to adopt specific measures to quantify gerrymandering has been…
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…