English
Related papers

Related papers: Minimax bounds for sparse PCA with noisy high-dime…

200 papers

Covariance matrix estimation and principal component analysis (PCA) are two cornerstones of multivariate analysis. Classic textbook solutions perform poorly when the dimension of the data is of a magnitude similar to the sample size, or…

Statistics Theory · Mathematics 2014-06-25 Olivier Ledoit , Michael Wolf

Modern data are increasingly both high-dimensional and heteroscedastic. This paper considers the challenge of estimating underlying principal components from high-dimensional data with noise that is heteroscedastic across samples, i.e.,…

Statistics Theory · Mathematics 2022-09-14 David Hong , Fan Yang , Jeffrey A. Fessler , Laura Balzano

This work provides a unified analysis of the properties of the sample covariance matrix $\Sigma_n$ over the class of $p\times p$ population covariance matrices $\Sigma$ of reduced effective rank $r_e(\Sigma)$. This class includes scaled…

Statistics Theory · Mathematics 2015-06-02 Florentina Bunea , Luo Xiao

We consider a high-dimensional linear regression problem. Unlike many papers on the topic, we do not require sparsity of the regression coefficients; instead, our main structural assumption is a decay of eigenvalues of the covariance matrix…

Statistics Theory · Mathematics 2021-10-01 Igor Silin , Jianqing Fan

We consider the observations of an unknown $s$-sparse vector ${\boldsymbol \theta}$ corrupted by Gaussian noise with zero mean and unknown covariance matrix ${\boldsymbol \Sigma}$. We propose minimax optimal methods of estimating the…

Statistics Theory · Mathematics 2026-03-17 Yuhao Wang , Pengkun Yang , Alexandre B. Tsybakov

We study statistical and computational limits of clustering when the means of the centres are sparse and their dimension is possibly much larger than the sample size. Our theoretical analysis focuses on the model $X_i = z_i \theta +…

Statistics Theory · Mathematics 2021-03-23 Matthias Löffler , Alexander S. Wein , Afonso S. Bandeira

We analyze the problem of discrete distribution estimation under $\ell_1$ loss. We provide non-asymptotic upper and lower bounds on the maximum risk of the empirical distribution (the maximum likelihood estimator), and the minimax risk in…

Information Theory · Computer Science 2015-12-31 Yanjun Han , Jiantao Jiao , Tsachy Weissman

In this paper, we study high-dimensional sparse Quadratic Discriminant Analysis (QDA) and aim to establish the optimal convergence rates for the classification error. Minimax lower bounds are established to demonstrate the necessity of…

Methodology · Statistics 2019-12-09 T. Tony Cai , Linjun Zhang

We study estimation and testing in the Poisson regression model with noisy high dimensional covariates, which has wide applications in analyzing noisy big data. Correcting for the estimation bias due to the covariate noise leads to a…

Statistics Theory · Mathematics 2023-01-03 Fei Jiang , Yeqing Zhou , Jianxuan Liu , Yanyuan Ma

Principal component analysis (PCA) is a widely used dimension reduction technique in machine learning and multivariate statistics. To improve the interpretability of PCA, various approaches to obtain sparse principal direction loadings have…

Data Structures and Algorithms · Computer Science 2021-06-07 Agniva Chowdhury , Petros Drineas , David P. Woodruff , Samson Zhou

We study the estimation of a high dimensional approximate factor model in the presence of both cross sectional dependence and heteroskedasticity. The classical method of principal components analysis (PCA) does not efficiently estimate the…

Methodology · Statistics 2012-10-01 Jushan Bai , Yuan Liao

A continuous-time regression model with a jointly strictly sub-Gaussian random noise is considered in the paper. Upper exponential bounds for probabilities of large deviations of the least squares estimator for the regression parameter are…

Probability · Mathematics 2018-06-12 Alexander V. Ivanov , Igor V. Orlovskyi

This paper investigates the detection and estimation of a single change in high-dimensional linear models. We derive minimax lower bounds for the detection boundary and the estimation rate, which uncover a phase transition governed by the…

Statistics Theory · Mathematics 2026-02-11 Haeran Cho , Housen Li

We develop a dimension reduction framework for data consisting of matrices of counts. Our model is based on assuming the existence of a small amount of independent normal latent variables that drive the dependency structure of the observed…

Statistics Theory · Mathematics 2021-10-28 Joni Virta , Andreas Artemiou

Although a majority of the theoretical literature in high-dimensional statistics has focused on settings which involve fully-observed data, settings with missing values and corruptions are common in practice. We consider the problems of…

Machine Learning · Statistics 2017-11-06 Yining Wang , Jialei Wang , Sivaraman Balakrishnan , Aarti Singh

The current paper presents a novel machinery for studying non-asymptotic minimax estimation of high-dimensional matrices, which yields tight minimax rates for a large collection of loss functions in a variety of problems. Based on the…

Statistics Theory · Mathematics 2013-06-18 Zongming Ma , Yihong Wu

In this paper, we study the system identification problem for sparse linear time-invariant systems. We propose a sparsity promoting block-regularized estimator to identify the dynamics of the system with only a limited number of input-state…

Systems and Control · Computer Science 2018-08-28 Salar Fattahi , Somayeh Sojoudi

We consider two problems of estimation in high-dimensional Gaussian models. The first problem is that of estimating a linear functional of the means of $n$ independent $p$-dimensional Gaussian vectors, under the assumption that most of…

Statistics Theory · Mathematics 2018-11-12 Olivier Collier , Arnak S. Dalalyan

We derive tight lower bounds on the smallest eigenvalue of a sample covariance matrix of a centred isotropic random vector under weak or no assumptions on its components.

Probability · Mathematics 2014-12-17 Pavel Yaskov

This paper studies the problem of estimating a large coefficient matrix in a multiple response linear regression model when the coefficient matrix could be both of low rank and sparse in the sense that most nonzero entries concentrate on a…

Methodology · Statistics 2016-03-18 Zhuang Ma , Zongming Ma , Tingni Sun