English
Related papers

Related papers: On estimation of the diagonal elements of a sparse…

200 papers

Estimation of a sparse spectral precision matrix, the inverse of a spectral density matrix, is a canonical problem in frequency-domain analysis of high-dimensional time series (HDTS), with applications in neurosciences and environmental…

Methodology · Statistics 2025-11-11 Navonil Deb , Amy Kuceyeski , Sumanta Basu

The sparse inverse covariance estimation problem is commonly solved using an $\ell_{1}$-regularized Gaussian maximum likelihood estimator known as "graphical lasso", but its computational cost becomes prohibitive for large data sets. A…

Machine Learning · Statistics 2018-06-08 Richard Y. Zhang , Salar Fattahi , Somayeh Sojoudi

We consider statistical inference for impulse responses in sparse, structural high-dimensional vector autoregressive (SVAR) systems. We introduce consistent estimators of impulse responses in the high-dimensional setting and suggest valid…

Methodology · Statistics 2021-06-03 Jonas Krampe , Efstathios Paparoditis , Carsten Trenkler

A hierarchical Bayesian approach that permits simultaneous inference for the regression coefficient matrix and the error precision (inverse covariance) matrix in the multivariate linear model is proposed. Assuming a natural ordering of the…

Methodology · Statistics 2024-10-29 Christina Zhao , Ding Xiang , Galin L. Jones , Adam J. Rothman

We consider the problem of learning a sparse graph underlying an undirected Gaussian graphical model, a key problem in statistical machine learning. Given $n$ samples from a multivariate Gaussian distribution with $p$ variables, the goal is…

Machine Learning · Computer Science 2026-04-07 Kayhan Behdin , Wenyu Chen , Rahul Mazumder

This paper studies the inference of the regression coefficient matrix under multivariate response linear regressions in the presence of hidden variables. A novel procedure for constructing confidence intervals of entries of the coefficient…

Methodology · Statistics 2022-01-21 Xin Bing , Wei Cheng , Huijie Feng , Yang Ning

We present randomized algorithms for estimating the trace and deter- minant of Hermitian positive semi-definite matrices. The algorithms are based on subspace iteration, and access the matrix only through matrix vector products. We analyse…

Numerical Analysis · Mathematics 2017-02-17 Arvind K. Saibaba , Alen Alexanderian , Ilse C. F. Ipsen

We introduce a very general method for sparse and large-scale variable selection. The large-scale regression settings is such that both the number of parameters and the number of samples are extremely large. The proposed method is based on…

Statistics Theory · Mathematics 2019-07-31 Jelena Bradic

This paper investigates the effect of the design matrix on the ability (or inability) to estimate a sparse parameter in linear regression. More specifically, we characterize the optimal rate of estimation when the smallest singular value of…

Statistics Theory · Mathematics 2024-02-02 Reese Pathak , Cong Ma

This paper introduces a new data-driven methodology for estimating sparse covariance matrices of the random coefficients in logit mixture models. Researchers typically specify covariance matrices in logit mixture models under one of two…

Methodology · Statistics 2020-01-16 Youssef M Aboutaleb , Mazen Danaf , Yifei Xie , Moshe Ben-Akiva

Missing data occur frequently in a wide range of applications. In this paper, we consider estimation of high-dimensional covariance matrices in the presence of missing observations under a general missing completely at random model in the…

Methodology · Statistics 2016-05-17 T. Tony Cai , Anru Zhang

In this paper, we investigate the recovery of a sparse weight vector (parameters vector) from a set of noisy linear combinations. However, only partial information about the matrix representing the linear combinations is available. Assuming…

Machine Learning · Computer Science 2016-11-18 Ashkan Esmaeili , Arash Amini , Farokh Marvasti

Undirected graphs can be used to describe matrix variate distributions. In this paper, we develop new methods for estimating the graphical structures and underlying parameters, namely, the row and column covariance and inverse covariance…

Machine Learning · Statistics 2014-05-26 Shuheng Zhou

Estimating a high-dimensional sparse covariance matrix from a limited number of samples is a fundamental problem in contemporary data analysis. Most proposals to date, however, are not robust to outliers or heavy tails. Towards bridging…

Statistics Theory · Mathematics 2020-08-04 John Goes , Gilad Lerman , Boaz Nadler

Covariance regression offers an effective way to model the large covariance matrix with the auxiliary similarity matrices. In this work, we propose a sparse covariance regression (SCR) approach to handle the potentially high-dimensional…

Methodology · Statistics 2024-10-17 Yuan Gao , Zhiyuan Zhang , Zhanrui Cai , Xuening Zhu , Tao Zou , Hansheng Wang

This paper establishes optimal convergence rates for estimation of structured covariance operators of Gaussian processes. We study banded operators with kernels that decay rapidly off-the-diagonal and $L^q$-sparse operators with an…

Statistics Theory · Mathematics 2025-07-01 Omar Al-Ghattas , Jiaheng Chen , Daniel Sanz-Alonso , Nathan Waniorek

Stacking regressions is an ensemble technique that forms linear combinations of different regression estimators to enhance predictive accuracy. The conventional approach uses cross-validation data to generate predictions from the…

Machine Learning · Statistics 2024-10-10 Xin Chen , Jason M. Klusowski , Yan Shuo Tan

High-dimensional time series data exist in numerous areas such as finance, genomics, healthcare, and neuroscience. An unavoidable aspect of all such datasets is missing data, and dealing with this issue has been an important focus in…

Machine Learning · Statistics 2018-02-27 Amin Jalali , Rebecca Willett

The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on the mean-squared error, which holds regardless of the…

Information Theory · Computer Science 2013-03-04 Emmanuel J. Candès , Mark A. Davenport

We consider machine learning techniques to develop low-latency approximate solutions to a class of inverse problems. More precisely, we use a probabilistic approach for the problem of recovering sparse stochastic signals that are members of…

Information Theory · Computer Science 2016-09-06 Steffen Limmer , Sławomir Stańczak