117 citations · 704 across the 174 of their papers we have counts for
16 papers · 1 filter
Optimal Fully Dynamic -Centers Clustering
MohammadHossein Bateni, Hossein Esfandiari, Rajesh Jayaram +1
We present the first algorithm for fully dynamic -centers clustering in an arbitrary metric space that maintains an optimal approximation in $O(k \cdot \operatorname{polyl…
From Quantum Codes to Gravity: A Journey of Gravitizing Quantum Mechanics
ChunJun Cao
In this note, I review a recent approach to quantum gravity that "gravitizes" quantum mechanics by emerging geometry and gravity from complex quantum states. Drawing further insigh…
Robust Auction Design in the Auto-bidding World
Santiago Balseiro, Yuan Deng, Jieming Mao +2
In classic auction theory, reserve prices are known to be effective for improving revenue for the auctioneer against quasi-linear utility maximizing bidders. The introduction of re…
Improved Sliding Window Algorithms for Clustering and Coverage via Bucketing-Based Sketches
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni +1
Streaming computation plays an important role in large-scale data analysis. The sliding window model is a model of streaming computation which also captures the recency of the data…
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…
Tight and Robust Private Mean Estimation with Few Users
Hossein Esfandiari, Vahab Mirrokni, Shyam Narayanan
In this work, we study high-dimensional mean estimation under user-level differential privacy, and design an -differentially private mechanism using as few users a…