paper-with-me

Papers

Affine Invariant Covariance Estimation for Heavy-Tailed Distributions

2019-02-08 · Dmitrii Ostrovskii, Alessandro Rudi

In this work we provide an estimator for the covariance matrix of a heavy-tailed multivariate distributionWe prove that the proposed estimator $\widehat{\mathbf{S}}$ admits an \textit{affine-invariant} bound of the form \[(1-\varepsilon) \mathbf{S} \preccurlyeq \widehat{\mathbf{S}} \preccurlyeq (1+\varepsilon) \mathbf{S}\]in high probability, where $\mathbf{S}$ is the unknown covariance matrix, and $\preccurlyeq$ is the positive semidefinite order on symmetric matrices. The result only requires the existence of fourth-order moments, and allows for $\varepsilon = O(\sqrt{\kappa^4 d\log(d/\delta)/n})$ where $\kappa^4$ is a measure of kurtosis of the distribution, $d$ is the dimensionality of the space, $n$ is the sample size, and $1-\delta$ is the desired confidence level. More generally, we can allow for regularization with level $\lambda$, then $d$ gets replaced with the degrees of freedom number. Denoting $\text{cond}(\mathbf{S})$ the condition number of $\mathbf{S}$, the computational cost of the novel estimator is $O(d^2 n + d^3\log(\text{cond}(\mathbf{S})))$, which is comparable to the cost of the sample covariance estimator in the statistically interesing regime $n \ge d$. We consider applications of our estimator to eigenvalue estimation with relative error, and to ridge regression with heavy-tailed random design.

📄 PDF Abstract BibTeX arXiv:1902.03086

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

The Decision Geometry of Covariance Estimation for the Global Minimum-Variance Portfolio under Heavy Tails

2026-06-25 · Xavier Fonseca arxiv

The global minimum-variance portfolio (GMVP) is the canonical decision built from an estimated covariance matrix, yet covariance estimators are universally evaluated by matrix-norm loss, which is not the object the decis…

Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery

2022-12-30 · Junren Chen, Michael K. Ng, Di Wang

This paper studies the quantization of heavy-tailed data in some fundamental statistical estimation problems, where the underlying distributions have bounded moments of some order. We propose to truncate and properly dit…

compressed sensingMatrix CompletionQuantization

Intrinsic Bayesian Cramér-Rao Bound with an Application to Covariance Matrix Estimation

2023-11-08 · Florent Bouchard, Alexandre Renaux, Guillaume Ginolhac, Arnaud Breloy

This paper presents a new performance bound for estimation problems where the parameter to estimate lies in a Riemannian manifold (a smooth manifold endowed with a Riemannian metric) and follows a given prior distributio…

Heavy-tailed Contamination is Easier than Adversarial Contamination

2024-11-22 · Yeshwanth Cherapanamjeri, Daniel Lee

A large body of work in the statistics and computer science communities dating back to Huber (Huber, 1960) has led to statistically and computationally efficient outlier-robust estimators. Two particular outlier models h…

Better and Simpler Lower Bounds for Differentially Private Statistical Estimation

2023-10-10 · Shyam Narayanan

We provide optimal lower bounds for two well-known parameter estimation (also known as statistical estimation) tasks in high dimensions with approximate differential privacy. First, we prove that for any $\alpha \le O(1)…

parameter estimation