PhD Seminar • Algorithms and Complexity • Robust Statistical Estimators with Bounded Empirical Sensitivity

Wednesday, May 27, 2026 12:00 pm - 1:00 pm EDT (GMT -04:00)

Please note: This PhD seminar will take place in DC 1304 and online.

Argyris Mouzakis, PhD candidate
David R. Cheriton School of Computer Science

Supervisor: Professor Gautam Kamath

We introduce a new measure of robustness for statistical estimators, which we call \emph{empirical sensitivity}. An estimator $\hat \theta$ has bounded empirical sensitivity if, with high probability over a dataset $X = (X_1, \dots, X_n) \sim \mathcal{D}^{\otimes n}$, for any dataset $Y$ obtained by modifying at most $\eta n$ points in $X$, we have that $\hat \theta(Y)$ is close to $\hat \theta(X)$.

We study bounds on this quantity for the prototypical problem of Gaussian mean estimation. We prove new lower bounds, showing that for any estimator $\hat \mu$ which achieves an optimal $\ell_2$-error bound of $O(\sqrt{d/n})$, the empirical sensitivity is at least $\Omega(\eta + \sqrt{\eta d/n})$. The two terms arise due to obstructions on the mean and variance (via an Efron-Stein argument) of such an estimator. We show that this bound is tight up to logarithmic factors, by employing recent results for robust empirical mean estimation.


To attend this PhD seminar in person, please go to DC 1304. You can also attend virtually on Zoom.