English
Related papers

Related papers: The Sample Complexity of Robust Covariance Testing

200 papers

The goal of this paper is to show that a single robust estimator of the mean of a multivariate Gaussian distribution can enjoy five desirable properties. First, it is computationally tractable in the sense that it can be computed in a time…

Statistics Theory · Mathematics 2022-10-28 Arnak S. Dalalyan , Arshak Minasyan

In this work we solve the problem of robustly learning a high-dimensional Gaussian mixture model with $k$ components from $\epsilon$-corrupted samples up to accuracy $\widetilde{O}(\epsilon)$ in total variation distance for any constant $k$…

Machine Learning · Computer Science 2021-11-16 Allen Liu , Ankur Moitra

This paper studies the problem of estimating the covariance of a collection of vectors using only highly compressed measurements of each vector. An estimator based on back-projections of these compressive samples is proposed and analyzed. A…

Machine Learning · Statistics 2019-01-16 Martin Azizyan , Akshay Krishnamurthy , Aarti Singh

Sparse linear regression with ill-conditioned Gaussian random designs is widely believed to exhibit a statistical/computational gap, but there is surprisingly little formal evidence for this belief, even in the form of examples that are…

Data Structures and Algorithms · Computer Science 2022-03-08 Jonathan A. Kelner , Frederic Koehler , Raghu Meka , Dhruv Rohatgi

In classical statistics and distribution testing, it is often assumed that elements can be sampled from some distribution $P$, and that when an element $x$ is sampled, the probability $P$ of sampling $x$ is also known. Recent work in…

Data Structures and Algorithms · Computer Science 2022-08-03 Talya Eden , Jakob Bæk Tejs Houen , Shyam Narayanan , Will Rosenbaum , Jakub Tětek

Robust mean estimation is the problem of estimating the mean $\mu \in \mathbb{R}^d$ of a $d$-dimensional distribution $D$ from a list of independent samples, an $\epsilon$-fraction of which have been arbitrarily corrupted by a malicious…

Computational Complexity · Computer Science 2019-06-05 Samuel B. Hopkins , Jerry Li

We study the fundamental problems of (i) uniformity testing of a discrete distribution, and (ii) closeness testing between two discrete distributions with bounded $\ell_2$-norm. These problems have been extensively studied in distribution…

Data Structures and Algorithms · Computer Science 2016-11-14 Ilias Diakonikolas , Themis Gouleakis , John Peebles , Eric Price

Multivariate Gaussian is often used as a first approximation to the distribution of high-dimensional data. Determining the parameters of this distribution under various constraints is a widely studied problem in statistics, and is often…

Statistics Theory · Mathematics 2016-02-09 Samuel Balmand , Arnak Dalalyan

We study the problem of outlier robust high-dimensional mean estimation under a finite covariance assumption, and more broadly under finite low-degree moment assumptions. We consider a standard stability condition from the recent robust…

Statistics Theory · Mathematics 2021-03-17 Ilias Diakonikolas , Daniel M. Kane , Ankit Pensia

We propose a new one-sample test for normality in a Reproducing Kernel Hilbert Space (RKHS). Namely, we test the null-hypothesis of belonging to a given family of Gaussian distributions. Hence our procedure may be applied either to test…

Statistics Theory · Mathematics 2015-07-13 Jérémie Kellner , Alain Celisse

We consider the classification problem of a high-dimensional mixture of two Gaussians with general covariance matrices. Using the replica method from statistical physics, we investigate the asymptotic behavior of a general class of…

Machine Learning · Statistics 2024-10-29 Hanwen Huang , Peng Zeng

In this paper we prove, under mild conditions, that the positive definiteness of the circulant matrix appearing in the circulant embedding method is always guaranteed, provided the enclosing cube is sufficiently large. We examine in detail…

Numerical Analysis · Mathematics 2018-03-21 Ivan G. Graham , Frances Y. Kuo , Dirk Nuyens , Rob Scheichl , Ian H. Sloan

We provide several new results on the sample complexity of vector-valued linear predictors (parameterized by a matrix), and more generally neural networks. Focusing on size-independent bounds, where only the Frobenius norm distance of the…

Machine Learning · Computer Science 2023-10-26 Roey Magen , Ohad Shamir

Verifying uniform conditions over continuous spaces through random sampling is fundamental in machine learning and control theory, yet classical coverage analyses often yield conservative bounds, particularly at small failure probabilities.…

Machine Learning · Computer Science 2025-12-15 Lyu Yuhuan

We analyze the statistical consistency of robust estimators for precision matrices in high dimensions. We focus on a contamination mechanism acting cellwise on the data matrix. The estimators we analyze are formed by plugging appropriately…

Statistics Theory · Mathematics 2015-09-25 Po-Ling Loh , Xin Lu Tan

One strategy for adversarially training a robust model is to maximize its certified radius -- the neighborhood around a given training sample for which the model's prediction remains unchanged. The scheme typically involves analyzing a…

Machine Learning · Computer Science 2021-04-14 Xingjian Zhen , Rudrasis Chakraborty , Vikas Singh

A/B testing refers to the task of determining the best option among two alternatives that yield random outcomes. We provide distribution-dependent lower bounds for the performance of A/B testing that improve over the results currently…

Statistics Theory · Mathematics 2015-02-25 Emilie Kaufmann , Olivier Cappé , Aurélien Garivier

Estimation of the mean vector and covariance matrix is of central importance in the analysis of multivariate data. In the framework of generalized linear models, usually the variances are certain functions of the means with the normal…

Methodology · Statistics 2023-01-25 Anupam Kundu , Mohsen Pourahmadi

We prove lower bounds on the number of samples needed to privately estimate the covariance matrix of a Gaussian distribution. Our bounds match existing upper bounds in the widest known setting of parameters. Our analysis relies on the…

Data Structures and Algorithms · Computer Science 2024-04-30 Victor S. Portella , Nick Harvey

We study distribution testing without direct access to a source of relevant data, but rather to one where only a tiny fraction is relevant. To enable this, we introduce the following verification query model. The goal is to perform a…

Data Structures and Algorithms · Computer Science 2025-09-23 Hadley Black , Christopher Ye
‹ Prev 1 4 5 6 7 8 10 Next ›