← Authors

Alessandro Epasto

17 papers · 2020–2025 · 3 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge πŸƒ Academic Marathon (5) 🐝 Cross-Pollinator (11) 🌈 Renaissance Researcher (8) πŸ—ΊοΈ Taxonomy Completionist (19) 🧭 Keyword Pioneer 🌍 Conference Polyglot (3) πŸ† Keyword Champion (4) πŸ’Ž Century Club (17) πŸ—ƒοΈ Keyword Collector (51) ⚑ Prolific Year (6)

Conferences

NIPS (8) ICML (6) AISTATS (3)

Top co-authors

Vahab Mirrokni (9) Peilin Zhong (7) Mohammad Mahdian (6) Vincent Cohen-Addad (6) Sara Ahmadian (3) Jieming Mao (3) Shyam Narayanan (2) Jacob Imola (2) Ravi Kumar (2) Morteza Zadimoghaddam (2)

Research topics

Differential Privacy (4)

Keywords

differential privacy (7) approximation algorithm (5) k-means clustering (4) k-median clustering (4) hierarchical clustering (3) clustering algorithm (2) stochastic block model (2) graph learning (1) graph embedding (1) submodular optimization (1) empirical risk minimization (1) linear regression (1) correlation clustering (1) pairwise similarity (1) online algorithm (1) mechanism design (1) exponential mechanism (1) mean estimation (1) combinatorial optimization (1) distance-based privacy (1)

Papers

Retraining with Predicted Hard Labels Provably Increases Model Accuracy ICML 2025
Maximum Coverage in Turnstile Streams with Applications to Fingerprinting Measures ICML 2025
Scalable Private Partition Selection via Adaptive Weighting ICML 2025
Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model ICML 2025
A Scalable Algorithm for Individually Fair k-Means Clustering AISTATS 2024
Perturb-and-Project: Differentially Private Similarities and Marginals ICML 2024
$k$-Means Clustering with Distance-Based Privacy NIPS 2023
Private estimation algorithms for stochastic block models and mixture models NIPS 2023
Differentially Private Hierarchical Clustering with Provable Approximation Guarantees ICML 2023
Near-Optimal Private and Scalable $k$-Clustering NIPS 2022
Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank NIPS 2022
Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection AISTATS 2020
Sliding Window Algorithms for k-Clustering Problems NIPS 2020
Smoothly Bounding User Contributions in Differential Privacy NIPS 2020
Fair Hierarchical Clustering NIPS 2020
Optimal Approximation - Smoothness Tradeoffs for Soft-Max Functions NIPS 2020
Fair Correlation Clustering AISTATS 2020