The Broader Landscape of Robustness in Algorithmic Statistics
IEEE BITS the Information Theory Magazine · 2024-09 · 4 (3) · 3-21
DOI: 10.1109/mbits.2025.3606831 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE BITS the Information Theory Magazine, 2024-09. Verfasst von Gautam Kamath. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 65 Literaturangaben. Gefördert von: Canada CIFAR AI Chair, Natural Sciences and Engineering Research Council of Canada, Google.
Abstract (Originalsprache)
The last decade has seen a number of advances in computationally efficient algorithms for statistical methods subject to robustness constraints. An estimator may be robust in a number of different ways: to contamination of the dataset, to heavy-tailed data, or in the sense that it preserves the privacy of the dataset. We survey recent results in these areas with a focus on the problem of mean estimation, drawing technical and conceptual connections between the various forms of robustness, showing that the same underlying algorithmic ideas lead to computationally efficient estimators in all these settings.
Förderung
- Canada CIFAR AI Chair
- Natural Sciences and Engineering Research Council of Canada
Zitieren
APA
Kamath, G. (2024). The Broader Landscape of Robustness in Algorithmic Statistics. IEEE BITS the Information Theory Magazine, 4(3), 3-21. https://doi.org/10.1109/mbits.2025.3606831
Vancouver
Kamath G. The Broader Landscape of Robustness in Algorithmic Statistics. IEEE BITS the Information Theory Magazine. 2024;4(3):3-21. doi:10.1109/mbits.2025.3606831
BibTeX
@article{Kamath2024,
author = {Kamath, Gautam},
title = {The Broader Landscape of Robustness in Algorithmic Statistics},
journal = {IEEE BITS the Information Theory Magazine},
year = {2024},
volume = {4},
number = {3},
pages = {3--21},
doi = {10.1109/mbits.2025.3606831}
}
EUVIMED