Alert button
Picture for Alessandro Epasto

Alessandro Epasto

Alert button

A Scalable Algorithm for Individually Fair K-means Clustering

Feb 09, 2024
MohammadHossein Bateni, Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi

Viaarxiv icon

Differentially Private Clustering in Data Streams

Jul 14, 2023
Alessandro Epasto, Tamalika Mukherjee, Peilin Zhong

Viaarxiv icon

Measuring Re-identification Risk

Apr 12, 2023
CJ Carey, Travis Dick, Alessandro Epasto, Adel Javanmard, Josh Karlin, Shankar Kumar, Andres Munoz Medina, Vahab Mirrokni, Gabriel Henrique Nunes, Sergei Vassilvitskii, Peilin Zhong

Figure 1 for Measuring Re-identification Risk
Figure 2 for Measuring Re-identification Risk
Figure 3 for Measuring Re-identification Risk
Figure 4 for Measuring Re-identification Risk
Viaarxiv icon

Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees

Jan 31, 2023
Jacob Imola, Alessandro Epasto, Mohammad Mahdian, Vincent Cohen-Addad, Vahab Mirrokni

Figure 1 for Differentially-Private Hierarchical Clustering with Provable Approximation Guarantees
Viaarxiv icon

Private estimation algorithms for stochastic block models and mixture models

Jan 11, 2023
Hongjie Chen, Vincent Cohen-Addad, Tommaso d'Orsi, Alessandro Epasto, Jacob Imola, David Steurer, Stefan Tiegel

Viaarxiv icon

Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank

Jul 14, 2022
Alessandro Epasto, Vahab Mirrokni, Bryan Perozzi, Anton Tsitsulin, Peilin Zhong

Figure 1 for Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank
Figure 2 for Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank
Figure 3 for Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank
Figure 4 for Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank
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

Scalable Differentially Private Clustering via Hierarchically Separated Trees

Jun 17, 2022
Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Andres Munoz, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii

Figure 1 for Scalable Differentially Private Clustering via Hierarchically Separated Trees
Figure 2 for Scalable Differentially Private Clustering via Hierarchically Separated Trees
Figure 3 for Scalable Differentially Private Clustering via Hierarchically Separated Trees
Viaarxiv icon

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions

Oct 22, 2020
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni, Manolis Zampetakis

Figure 1 for Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
Figure 2 for Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
Figure 3 for Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions
Viaarxiv icon

Fair Hierarchical Clustering

Jun 19, 2020
Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang

Figure 1 for Fair Hierarchical Clustering
Figure 2 for Fair Hierarchical Clustering
Figure 3 for Fair Hierarchical Clustering
Figure 4 for Fair Hierarchical Clustering
Viaarxiv icon