5 citations · 5 across the 3 of their papers we have counts for
3 papers
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…
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov +2
We study the problem of finding a minimum-distortion embedding of the shortest path metric of an unweighted graph into a "simpler" metric . Computing such an embedding (exactly…
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos
The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undir…