← Search

Giannis Iakovidis

3 accepted papers

2026

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination

ICML 2026poster

We study the basic task of mean estimation in the presence of mean-shift contamination. In the mean-shift contamination model, an adversary is allowed to replace a small constant fraction of the clean samples by samples drawn from arbitrarily shifted versions of the base distribution. Prior work cha…

Cited by 0SourceScholar
2025

Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-Index Models

NeurIPS 2025spotlight

We study the complexity of learning real-valued Multi-Index Models (MIMs) under the Gaussian distribution. A $K$-MIM is a function $f:\mathbb{R}^d\to \mathbb{R}$ that depends only on the projection of its input onto a $K$-dimensional subspace. We give a general algorithm for PAC learning a broad c…

Cited by 0SourceScholar
2025

Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination

ICML 2025poster

We study the algorithmic problem of robust mean estimation of an identity covariance Gaussian in the presence of mean-shift contamination. In this contamination model, we are given a set of points in $\mathbb{R}^d$ generated i.i.d. via the following process. For a parameter $\alpha<1/2$, the $i$-th…

Cited by 0SourcePDFScholar