English
Related papers

Related papers: On the Sample Complexity of Robust Binary Hypothes…

200 papers

We study the problem of testing the covariance matrix of a high-dimensional Gaussian in a robust setting, where the input distribution has been corrupted in Huber's contamination model. Specifically, we are given i.i.d. samples from a…

Machine Learning · Computer Science 2021-01-01 Ilias Diakonikolas , Daniel M. Kane

Uniformity testing is one of the most well-studied problems in property testing, with many known test statistics, including ones based on counting collisions, singletons, and the empirical TV distance. It is known that the optimal sample…

Machine Learning · Statistics 2022-06-23 Shivam Gupta , Eric Price

We consider the question of Gaussian mean testing, a fundamental task in high-dimensional distribution testing and signal processing, subject to adversarial corruptions of the samples. We focus on the relative power of different…

Data Structures and Algorithms · Computer Science 2023-07-21 Clément L. Canonne , Samuel B. Hopkins , Jerry Li , Allen Liu , Shyam Narayanan

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…

Machine Learning · Computer Science 2026-02-27 Ilias Diakonikolas , Giannis Iakovidis , Daniel M. Kane , Sihan Liu

Today's data pose unprecedented challenges to statisticians. It may be incomplete, corrupted or exposed to some unknown source of contamination. We need new methods and theories to grapple with these challenges. Robust estimation is one of…

Statistics Theory · Mathematics 2017-01-17 Mengjie Chen , Chao Gao , Zhao Ren

The sample complexity of simple binary hypothesis testing is the smallest number of i.i.d.\ samples required to distinguish between two distributions $p$ and $q$ in either: (i) the prior-free setting, with type-I error at most $\alpha$ and…

Statistics Theory · Mathematics 2025-05-27 Ankit Pensia , Varun Jog , Po-Ling Loh

We propose an e-value based framework for testing arbitrary composite nulls against composite alternatives, when an $\epsilon$ fraction of the data can be arbitrarily corrupted. Our tests are inherently sequential, being valid at arbitrary…

Methodology · Statistics 2025-12-25 Aytijhya Saha , Aaditya Ramdas

In this paper, we develop connections between two seemingly disparate, but central, models in robust statistics: Huber's epsilon-contamination model and the heavy-tailed noise model. We provide conditions under which this connection…

Machine Learning · Statistics 2019-07-03 Adarsh Prasad , Sivaraman Balakrishnan , Pradeep Ravikumar

This paper investigates the theoretical underpinnings of two fundamental statistical inference problems, the construction of confidence sets and large-scale simultaneous hypothesis testing, in the presence of heavy-tailed data. With…

Statistics Theory · Mathematics 2019-03-19 Xi Chen , Wen-Xin Zhou

We study robust regression under a contamination model in which covariates are clean while the responses may be corrupted in an adaptive manner. Unlike the classical Huber's contamination model, where both covariates and responses may be…

Statistics Theory · Mathematics 2026-04-07 Ilias Diakonikolas , Chao Gao , Daniel M. Kane , Ankit Pensia , Dong Xie

Heavy-tailed errors impair the accuracy of the least squares estimate, which can be spoiled by a single grossly outlying observation. As argued in the seminal work of Peter Huber in 1973 [{\it Ann. Statist.} {\bf 1} (1973) 799--821], robust…

Statistics Theory · Mathematics 2017-11-16 Wen-Xin Zhou , Koushiki Bose , Jianqing Fan , Han Liu

For Huber contamination on a known finite sample space, the unrestricted contaminating law is a probability vector on the support atoms, and domination over all measurable subsets reduces to atomwise inequalities. Placing a Dirichlet prior…

Methodology · Statistics 2026-05-27 Jaehoan Kim

We consider the problem of robustly testing the norm of a high-dimensional sparse signal vector under two different observation models. In the first model, we are given $n$ i.i.d. samples from the distribution…

Information Theory · Computer Science 2022-11-08 Anand Jerry George , Clément L. Canonne

Many modern datasets are collected automatically and are thus easily contaminated by outliers. This led to a regain of interest in robust estimation, including new notions of robustness such as robustness to adversarial contamination of the…

Statistics Theory · Mathematics 2023-05-05 Pierre Alquier , Mathieu Gerber

In the classical contamination models, such as the gross-error (Huber and Tukey contamination model or Case-wise Contamination), observations are considered as the units to be identified as outliers or not. This model is very useful when…

Statistics Theory · Mathematics 2021-03-11 Giovanni Saraceno , Claudio Agostinelli

We study hypothesis testing under communication constraints, where each sample is quantized before being revealed to a statistician. Without communication constraints, it is well known that the sample complexity of simple binary hypothesis…

Statistics Theory · Mathematics 2023-12-19 Ankit Pensia , Varun Jog , Po-Ling Loh

We introduce one-sided versions of Huber's contamination model, in which corrupted samples tend to take larger values than uncorrupted ones. Two intertwined problems are addressed: estimation of the mean of uncorrupted samples (minimum…

Statistics Theory · Mathematics 2018-09-25 Alexandra Carpentier , Sylvain Delattre , Etienne Roquain , Nicolas Verzelen

We study Gaussian sparse estimation tasks in Huber's contamination model with a focus on mean estimation, PCA, and linear regression. For each of these tasks, we give the first sample and computationally efficient robust estimators with…

Machine Learning · Computer Science 2024-03-18 Ilias Diakonikolas , Daniel M. Kane , Sushrut Karmalkar , Ankit Pensia , Thanasis Pittas

We propose a robust Bayesian formulation of random feature (RF) regression that accounts explicitly for prior and likelihood misspecification via Huber-style contamination sets. Starting from the classical equivalence between…

Machine Learning · Computer Science 2026-02-24 Michele Caprio , Katerina Papagiannouli , Siu Lun Chau , Sayan Mukherjee

We study the problems of identity and closeness testing of $n$-dimensional product distributions. Prior works by Canonne, Diakonikolas, Kane and Stewart (COLT 2017) and Daskalakis and Pan (COLT 2017) have established tight sample complexity…

Data Structures and Algorithms · Computer Science 2021-05-27 Arnab Bhattacharyya , Sutanu Gayen , Saravanan Kandasamy , N. V. Vinodchandran
‹ Prev 1 2 3 10 Next ›