English
Related papers

Related papers: Analysis of singular subspaces under random pertur…

200 papers

The Davis-Kahan-Wedin $\sin \Theta$ theorem describes how the singular subspaces of a matrix change when subjected to a small perturbation. This classic result is sharp in the worst case scenario. In this paper, we prove a stochastic…

Machine Learning · Statistics 2024-01-01 Sean O'Rourke , Van Vu , Ke Wang

We perform a non-asymptotic analysis on the singular vector distribution under Gaussian noise. In particular, we provide sufficient conditions on a matrix for its first few singular vectors to have near normal distribution. Our result can…

Numerical Analysis · Mathematics 2014-12-12 Rongrong Wang

In statistics and machine learning, people are often interested in the eigenvectors (or singular vectors) of certain matrices (e.g. covariance matrices, data matrices, etc). However, those matrices are usually perturbed by noises or…

Statistics Theory · Mathematics 2017-06-05 Jianqing Fan , Weichen Wang , Yiqiao Zhong

Perturbation theory is developed to analyze the impact of noise on data and has been an essential part of numerical analysis. Recently, it has played an important role in designing and analyzing matrix algorithms. One of the most useful…

Probability · Mathematics 2023-11-21 Abhinav Bhardwaj , Van Vu

We propose an estimator for the singular vectors of high-dimensional low-rank matrices corrupted by additive subgaussian noise, where the noise matrix is allowed to have dependence within rows and heteroskedasticity between them. We prove…

Statistics Theory · Mathematics 2022-09-15 Joshua Agterberg , Zachary Lubberts , Carey Priebe

Computing the first few singular vectors of a large matrix is a problem that frequently comes up in statistics and numerical analysis. Given the presence of noise, exact calculation is hard to achieve, and the following problem is of…

Numerical Analysis · Mathematics 2010-04-13 Van Vu

Given a matrix $A \in \mathbb{R}^{m\times d}$ with singular values $\sigma_1\geq \cdots \geq \sigma_d$, and a random matrix $G \in \mathbb{R}^{m\times d}$ with iid $N(0,T)$ entries for some $T>0$, we derive new bounds on the Frobenius…

Statistics Theory · Mathematics 2024-06-05 Peiyao Lai , Oren Mangoubi

Estimating eigenvectors and low-dimensional subspaces is of central importance for numerous problems in statistics, computer science, and applied mathematics. This paper characterizes the behavior of perturbed eigenvectors for a range of…

Statistics Theory · Mathematics 2018-09-14 Joshua Cape , Minh Tang , Carey E. Priebe

In this paper, we study the matrix denosing model $Y=S+X$, where $S$ is a low-rank deterministic signal matrix and $X$ is a random noise matrix, and both are $M\times n$. In the scenario that $M$ and $n$ are comparably large and the signals…

Statistics Theory · Mathematics 2020-07-08 Zhigang Bao , Xiucai Ding , Ke Wang

Let $A\in\mathbb{R}^{m\times n}$ be a matrix of rank $r$ with singular value decomposition (SVD) $A=\sum_{k=1}^r\sigma_k (u_k\otimes v_k),$ where $\{\sigma_k, k=1,\ldots,r\}$ are singular values of $A$ (arranged in a non-increasing order)…

Probability · Mathematics 2015-06-10 Vladimir Koltchinskii , Dong Xia

The singular subspaces perturbation theory is of fundamental importance in probability and statistics. It has various applications across different fields. We consider two arbitrary matrices where one is a leave-one-column-out submatrix of…

Statistics Theory · Mathematics 2024-01-17 Anderson Y. Zhang , Harrison H. Zhou

We provide upper bounds on the perturbation of invariant subspaces of normal matrices measured using a metric on the space of vector subspaces of $\mathbb{C}^n$ in terms of the spectrum of both the unperturbed \& perturbed matrices, as well…

Spectral Theory · Mathematics 2021-06-22 Subhrajit Bhattacharya

Matrix perturbation bounds (such as Weyl and Davis-Kahan) are used abundantly in many areas of mathematics and data science. Many bounds (such as the above two) involve the spectral norm of the noise matrix and are sharp in worst case…

Spectral Theory · Mathematics 2026-01-27 Phuc Tran , Van Vu

In this paper, we establish a useful set of formulae for the $\sin\Theta$ distance between the original and the perturbed singular subspaces. These formulae explicitly show that how the perturbation of the original matrix propagates into…

Statistics Theory · Mathematics 2023-10-10 He Lyu , Rongrong Wang

The variation of spectral subspaces for linear self-adjoint operators under an additive bounded semidefinite perturbation is considered. A variant of the Davis-Kahan $ \sin2\Theta $ theorem from [SIAM J. Numer. Anal. 7 (1970), 1--46]…

Spectral Theory · Mathematics 2019-10-24 Albrecht Seelmann

This paper is to study a signal-plus-noise model in high dimensional settings when the dimension and the sample size are comparable. Specifically, we assume that the noise has a general covariance matrix that allows for heteroskedasticity,…

Statistics Theory · Mathematics 2025-05-13 Xiaoyu Liu , Yiming Liu , Guangming Pan , Lingyue Zhang , Zhixiang Zhang

This paper studies fine-grained singular subspace estimation in the matrix denoising model where a deterministic low-rank signal matrix is additively perturbed by a stochastic matrix of Gaussian noise. We establish that the maximum…

Statistics Theory · Mathematics 2025-11-27 Junhyung Chang , Joshua Cape

We develop deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors, in a spirit similar to classical results for matrices such as those due to Weyl, Davis, Kahan and Wedin. Our bounds…

Numerical Analysis · Mathematics 2022-01-24 Arnab Auddy , Ming Yuan

Modern applications in statistics, computer science and network science have seen tremendous values of finer matrix spectral perturbation theory. In this paper, we derive a generic $\ell_{2\rightarrow\infty}$ eigenspace perturbation bound…

Probability · Mathematics 2020-04-28 Lihua Lei

Classical matrix perturbation results, such as Weyl's theorem for eigenvalues and the Davis-Kahan theorem for eigenvectors, are general purpose. These classical bounds are tight in the worst case, but in many settings sub-optimal in the…

Machine Learning · Statistics 2017-06-21 Justin Eldridge , Mikhail Belkin , Yusu Wang
‹ Prev 1 2 3 10 Next ›