61 citations · 114 across the 16 of their papers we have counts for
22 papers
Improved Approximations for Euclidean -means and -median, via Nested Quasi-Independent Sets
Vincent Cohen-Addad, Hossein Esfandiari, Vahab Mirrokni +1
Motivated by data analysis and machine learning applications, we consider the popular high-dimensional Euclidean -median and -means problems. We propose a new primal-dual alg…
Label differential privacy via clustering
Hossein Esfandiari, Vahab Mirrokni, Umar Syed +1
We present new mechanisms for \emph{label differential privacy}, a relaxation of differentially private machine learning that only protects the privacy of the labels in the trainin…
Almost Tight Approximation Algorithms for Explainable Clustering
Hossein Esfandiari, Vahab Mirrokni, Shyam Narayanan
Recently, due to an increasing interest for transparency in artificial intelligence, several methods of explainable machine learning have been developed with the simultaneous goal…
Online Allocation and Display Ads Optimization with Surplus Supply
Melika Abolhassani, Hossein Esfandiari, Yasamin Nazari +3
In this work, we study a scenario where a publisher seeks to maximize its total revenue across two sales channels: guaranteed contracts that promise to deliver a certain number of…
Feature Cross Search via Submodular Optimization
Lin Chen, Hossein Esfandiari, Gang Fu +2
In this paper, we study feature cross search as a fundamental primitive in feature engineering. The importance of feature cross search especially for the linear model has been know…
Parallel Graph Algorithms in Constant Adaptive Rounds: Theory meets Practice
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari +3
We study fundamental graph problems such as graph connectivity, minimum spanning forest (MSF), and approximate maximum (weight) matching in a distributed setting. In particular, we…