research
∙
06/21/2023
Geometric Algorithms for k-NN Poisoning
We propose a label poisoning attack on geometric data sets against k-nea...
share
research
∙
08/03/2022
Mass Exit Attacks on the Lightning Network
The Lightning Network (LN) has enjoyed rapid growth over recent years, a...
research
∙
11/15/2021
Embeddings of Planar Quasimetrics into Directed ℓ_1and Polylogarithmic Approximation for Directed Sparsest-Cut
The multi-commodity flow-cut gap is a fundamental parameter that affects...
research
∙
07/16/2020
Maximizing coverage while ensuring fairness: a tale of conflicting objective
Ensuring fairness in computational problems has emerged as a key topic d...
research
∙
04/27/2020
Learning Lines with Ordinal Constraints
We study the problem of finding a mapping f from a set of points into th...
research
∙
02/24/2020
Computing Bi-Lipschitz Outlier Embeddings into the Line
The problem of computing a bi-Lipschitz embedding of a graphical metric ...
research
∙
07/18/2019
A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families
We consider the problem of computing the maximum likelihood multivariate...
research
∙
05/24/2019
Learning Mahalanobis Metric Spaces via Geometric Approximation Algorithms
Learning Mahalanobis metric spaces is an important problem that has foun...
research
∙
12/13/2018
A Polynomial Time Algorithm for Maximum Likelihood Estimation of Multivariate Log-concave Densities
We study the problem of computing the maximum likelihood estimator (MLE)...
research
∙
10/01/2018
Chasing Similarity: Distribution-aware Aggregation Scheduling (Extended Version)
Parallel aggregation is a ubiquitous operation in data analytics that is...
research
∙
07/13/2018
Algorithms for metric learning via contrastive embeddings
We study the problem of supervised learning a metric space under discrim...
research
∙
04/27/2018
Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes?
Partisan gerrymandering is a major cause for voter disenfranchisement in...
research
∙
02/28/2018
Near-Optimal Sample Complexity Bounds for Maximum Likelihood Estimation of Multivariate Log-concave Densities
We study the problem of learning multivariate log-concave densities with...
research
∙
01/02/2018
Sketching and Clustering Metric Measure Spaces
Two important optimization problems in the analysis of geometric data se...
research
∙
12/19/2017
Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces
We study the problem of finding a minimum-distortion embedding of the sh...
research
∙
12/13/2017
Fractal dimension and lower bounds for geometric problems
We study the complexity of geometric problems on spaces of low fractal d...
research
∙
11/06/2017
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
The problem of routing in graphs using node-disjoint paths has received ...
research
∙
11/04/2017
On constant multi-commodity flow-cut gaps for directed minor-free graphs
The multi-commodity flow-cut gap is a fundamental parameter that affects...
research
∙
07/31/2017
