Alert button
Picture for Hossein Esfandiari

Hossein Esfandiari

Alert button

Robust and differentially private stochastic linear bandits

Apr 23, 2023
Vasileios Charisopoulos, Hossein Esfandiari, Vahab Mirrokni

Viaarxiv icon

Replicable Clustering

Feb 20, 2023
Hossein Esfandiari, Amin Karbasi, Vahab Mirrokni, Grigoris Velegkas, Felix Zhou

Figure 1 for Replicable Clustering
Viaarxiv icon

Reproducible Bandits

Oct 04, 2022
Hossein Esfandiari, Alkis Kalavasis, Amin Karbasi, Andreas Krause, Vahab Mirrokni, Grigoris Velegkas

Figure 1 for Reproducible Bandits
Viaarxiv icon

Smooth Anonymity for Sparse Binary Matrices

Jul 13, 2022
Hossein Esfandiari, Alessandro Epasto, Vahab Mirrokni, Andres Munoz Medina, Sergei Vassilvitskii

Figure 1 for Smooth Anonymity for Sparse Binary Matrices
Figure 2 for Smooth Anonymity for Sparse Binary Matrices
Figure 3 for Smooth Anonymity for Sparse Binary Matrices
Figure 4 for Smooth Anonymity for Sparse Binary Matrices
Viaarxiv icon

Tackling Provably Hard Representative Selection via Graph Neural Networks

May 20, 2022
Seyed Mehran Kazemi, Anton Tsitsulin, Hossein Esfandiari, MohammadHossein Bateni, Deepak Ramachandran, Bryan Perozzi, Vahab Mirrokni

Figure 1 for Tackling Provably Hard Representative Selection via Graph Neural Networks
Figure 2 for Tackling Provably Hard Representative Selection via Graph Neural Networks
Figure 3 for Tackling Provably Hard Representative Selection via Graph Neural Networks
Figure 4 for Tackling Provably Hard Representative Selection via Graph Neural Networks
Viaarxiv icon

Improved Approximations for Euclidean $k$-means and $k$-median, via Nested Quasi-Independent Sets

Apr 12, 2022
Vincent Cohen-Addad, Hossein Esfandiari, Vahab Mirrokni, Shyam Narayanan

Figure 1 for Improved Approximations for Euclidean $k$-means and $k$-median, via Nested Quasi-Independent Sets
Viaarxiv icon

Tight and Robust Private Mean Estimation with Few Users

Oct 22, 2021
Hossein Esfandiari, Vahab Mirrokni, Shyam Narayanan

Figure 1 for Tight and Robust Private Mean Estimation with Few Users
Figure 2 for Tight and Robust Private Mean Estimation with Few Users
Figure 3 for Tight and Robust Private Mean Estimation with Few Users
Viaarxiv icon

Label differential privacy via clustering

Oct 05, 2021
Hossein Esfandiari, Vahab Mirrokni, Umar Syed, Sergei Vassilvitskii

Figure 1 for Label differential privacy via clustering
Figure 2 for Label differential privacy via clustering
Viaarxiv icon

Almost Tight Approximation Algorithms for Explainable Clustering

Jul 15, 2021
Hossein Esfandiari, Vahab Mirrokni, Shyam Narayanan

Figure 1 for Almost Tight Approximation Algorithms for Explainable Clustering
Figure 2 for Almost Tight Approximation Algorithms for Explainable Clustering
Figure 3 for Almost Tight Approximation Algorithms for Explainable Clustering
Figure 4 for Almost Tight Approximation Algorithms for Explainable Clustering
Viaarxiv icon

Feature Cross Search via Submodular Optimization

Jul 05, 2021
Lin Chen, Hossein Esfandiari, Gang Fu, Vahab S. Mirrokni, Qian Yu

Viaarxiv icon