English
Related papers

Related papers: Adaptive Shrinkage of singular values

200 papers

One of the major challenges in multivariate analysis is the estimation of population covariance matrix from sample covariance matrix (SCM). Most recent covariance matrix estimators use either shrinkage transformations or asymptotic results…

Methodology · Statistics 2019-12-10 Samruddhi Deshmukh , Amartansh Dubey

We propose an improved LASSO estimation technique based on Stein-rule. We shrink classical LASSO estimator using preliminary test, shrinkage, and positive-rule shrinkage principle. Simulation results have been carried out for various…

Statistics Theory · Mathematics 2015-03-18 A. K. Md. Ehsanes Saleh , Enayetur Raheem

We consider recovery of low-rank matrices from noisy data by hard thresholding of singular values, where singular values below a prescribed threshold $\lambda$ are set to 0. We study the asymptotic MSE in a framework where the matrix size…

Methodology · Statistics 2014-06-05 Matan Gavish , David L. Donoho

We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising…

Machine Learning · Statistics 2013-04-02 Franz J. Király , Louis Theran

The Singular Value Decomposition is a matrix decomposition technique widely used in the analysis of multivariate data, such as complex space-time images obtained in both physical and biological systems. In this paper, we examine the…

Statistical Mechanics · Physics 2009-09-25 A. M. Sengupta , P. P. Mitra

Stochastic gradient methods are central to large-scale learning, but they treat mini-batch gradients as unbiased estimators, which classical decision theory shows are inadmissible in high dimensions. We formulate gradient computation as a…

Machine Learning · Computer Science 2026-02-10 M. Arashi , M. Amintoosi

Penalized Least Squares are widely used in signal and image processing. Yet, it suffers from a major limitation since it requires fine-tuning of the regularization parameters. Under assumptions on the noise probability distribution,…

Machine Learning · Statistics 2020-05-13 Barbara Pascal , Samuel Vaiter , Nelly Pustelnik , Patrice Abry

A highly popular regularized (shrinkage) covariance matrix estimator is the shrinkage sample covariance matrix (SCM) which shares the same set of eigenvectors as the SCM but shrinks its eigenvalues toward the grand mean of the eigenvalues…

Methodology · Statistics 2020-10-29 Esa Ollila , Daniel P. Palomar , Frédéric Pascal

Standard Monte Carlo computation is widely known to exhibit a canonical square-root convergence speed in terms of sample size. Two recent techniques, one based on control variate and one on importance sampling, both derived from an…

Computation · Statistics 2023-03-13 Henry Lam , Haofeng Zhang

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

We derive a formula for optimal hard thresholding of the singular value decomposition in the presence of correlated additive noise; although it nominally involves unobservables, we show how to apply it even where the noise covariance…

Statistics Theory · Mathematics 2023-03-28 David L. Donoho , Matan Gavish , Elad Romanov

We propose Stein-type estimators for zero-inflated Bell regression models by incorporating information on model parameters. These estimators combine the advantages of unrestricted and restricted estimators. We derive the asymptotic…

Computation · Statistics 2024-03-04 Solmaz Seifollahi , Hossein Bevrani , Zakariya Yahya Algamal

Truncated singular value decomposition is a reduced version of the singular value decomposition in which only a few largest singular values are retained. This paper presents a novel perturbation analysis for the truncated singular value…

Numerical Analysis · Mathematics 2021-06-01 Trung Vu , Evgenia Chunikhina , Raviv Raich

We address the problem of recovering a sparse signal from clipped or quantized measurements. We show how these two problems can be formulated as minimizing the distance to a convex feasibility set, which provides a convex and differentiable…

Signal Processing · Electrical Eng. & Systems 2018-12-05 Lucas Rencker , Francis Bach , Wenwu Wang , Mark D. Plumbley

Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…

Methodology · Statistics 2016-05-03 Juhee Cho , Donggyu Kim , Karl Rohe

We study a seemingly unexpected and relatively less understood overfitting aspect of a fundamental tool in sparse linear modeling - best subset selection, which minimizes the residual sum of squares subject to a constraint on the number of…

Methodology · Statistics 2022-01-11 Rahul Mazumder , Peter Radchenko , Antoine Dedieu

We seek to improve estimates of the power spectrum covariance matrix from a limited number of simulations by employing a novel statistical technique known as shrinkage estimation. The shrinkage technique optimally combines an empirical…

Astrophysics · Physics 2009-11-13 Adrian C. Pope , István Szapudi

The least absolute shrinkage and selection operator (LASSO) of Tibshirani (1996) is a prominent estimator which selects significant (under some sense) features and kills insignificant ones. Indeed the LASSO shrinks features lager than a…

Methodology · Statistics 2016-12-20 B. Yuzbasi , M. Arashi

Consider estimating the n by p matrix of means of an n by p matrix of independent normally distributed observations with constant variance, where the performance of an estimator is judged using a p by p matrix quadratic error loss function.…

Statistics Theory · Mathematics 2011-01-19 Reman Abu-Shanab , John T. Kent , William E. Strawderman

Compressed Sensing suggests that the required number of samples for reconstructing a signal can be greatly reduced if it is sparse in a known discrete basis, yet many real-world signals are sparse in a continuous dictionary. One example is…

Information Theory · Computer Science 2015-07-24 Yuanxin Li , Yuejie Chi