A Schatten-q low-rank matrix perturbation analysis via perturbation projection error bound
نویسندگان
چکیده
This paper studies the Schatten-q error of low-rank matrix estimation by singular value decomposition under perturbation. We specifically establish a perturbation bound on via projection bound. Then, we lower bounds to justify tightness upper error. further develop user-friendly sin? for subspace based Finally, demonstrate advantage our results over ones in literature simulation.
منابع مشابه
Low-Rank Matrix Recovery via Efficient Schatten p-Norm Minimization
As an emerging machine learning and information retrieval technique, the matrix completion has been successfully applied to solve many scientific applications, such as collaborative prediction in information retrieval, video completion in computer vision, etc. The matrix completion is to recover a low-rank matrix with a fraction of its entries arbitrarily corrupted. Instead of solving the popul...
متن کاملA Perturbation Inequality for the Schatten-$p$ Quasi-Norm and Its Applications to Low-Rank Matrix Recovery
In this paper, we establish the following perturbation result concerning the singular values of a matrix: Let A,B ∈ R be given matrices, and let f : R+ → R+ be a concave function satisfying f(0) = 0. Then, we have min{m,n}
متن کاملConvergence and Error Bound for Perturbation ofLinear
In various penalty/smoothing approaches to solving a linear program, one regularizes the problem by adding to the linear cost function a separable nonlinear function multiplied by a small positive parameter. Popular choices of this nonlinearfunction include the quadraticfunction, the logarithm function, and the x ln(x)-entropy function. Furthermore, the solutions generated by such approaches ma...
متن کاملLow Rank Perturbation of Jordan Structure
Let A be a matrix and λ0 be one of its eigenvalues having g elementary Jordan blocks in the Jordan canonical form of A. We show that for most matrices B satisfying rank (B) ≤ g, the Jordan blocks of A+B with eigenvalue λ0 are just the g− rank (B) smallest Jordan blocks of A with eigenvalue λ0. The set of matrices for which this behavior does not happen is explicitly characterized through a scal...
متن کاملLow-Complexity Cloud Image Privacy Protection via Matrix Perturbation
Cloud-assisted image services are widely used for various applications. Due to the high computational complexity of existing image encryption technology, it is extremely challenging to provide privacy preserving image services for resourceconstrained smart device. In this paper, we propose a novel encrypressive cloud-assisted image service scheme, called eCIS. The key idea of eCIS is to shift t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2021
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2021.08.005