11 citations · 20 across the 11 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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.LG2019
Robust Mahalanobis Metric Learning via Geometric Approximation Algorithms
Diego Ihara, Neshat Mohammadi, Francesco Sgherzi +1
Learning Mahalanobis metric spaces is an important problem that has found numerous applications. Several algorithms have been designed for this problem, including Information Theor…