Perturbation bounds in connection with singular value decomposition
From MaRDI portal
Publication:5650816
DOI10.1007/BF01932678zbMath0239.15015OpenAlexW2046164006MaRDI QIDQ5650816
Publication date: 1972
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01932678
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60)
Related Items
Generative modeling via tensor train sketching, Neural network approximation of continuous functions in high dimensions with applications to inverse problems, Robust Recovery of Low-Rank Matrices and Low-Tubal-Rank Tensors from Noisy Sketches, Perturbation upper bounds for singular subspaces with a kind of heteroskedastic noise and its application in clustering, Hierarchical model reduction driven by machine learning for parametric advection-diffusion-reaction problems in the presence of noisy data, A Newton’s iteration converges quadratically to nonisolated solutions too, Two-step Newton's method for deflation-one singular zeros of analytic systems, Admissible subspaces and the subspace iteration method, A fast randomized algorithm for computing an approximate null space, Euclidean Representation of Low-Rank Matrices and Its Geometric Properties, Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method, Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals, The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations, Acceleration of iterative refinement for singular value decomposition, Double precision is not necessary for LSQR for solving discrete linear ill-posed problems, Rejoinder, Statistical Inference for High-Dimensional Matrix-Variate Factor Models, Updating the singular value decomposition, Hyperspheres and hyperplanes fitted seamlessly by algebraic constrained total least-squares, A note on multiplicative perturbation bounds for the Moore–Penrose inverse, Conditioning of Leverage Scores and Computation by QR Decomposition, Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition, Heteroskedastic PCA: algorithm, optimality, and applications, Backward perturbation analysis of certain characteristic subspaces, Consistent fundamental matrix estimation in a quadratic measurement error model arising in motion analysis, A Schatten-\(q\) low-rank matrix perturbation analysis via perturbation projection error bound, Streaming Principal Component Analysis From Incomplete Data, A block QR algorithm and the singular value decomposition, Conditions for the consistency of the total least squares estimator in an errors-in-variables linear regression model, Lower bounds on Anderson-localised eigenfunctions on a strip, History and generality of the CS decomposition, Generalization error of random feature and kernel methods: hypercontractivity and kernel matrix concentration, Non-asymptotic properties of spectral decomposition of large Gram-type matrices and applications, The Discrete Empirical Interpolation Method: Canonical Structure and Formulation in Weighted Inner Product Spaces, A numerical elimination method for polynomial computations, The truncated SVD as a method for regularization, The optimal perturbation bounds of the Moore-Penrose inverse under the Frobenius norm, Smoothed analysis for tensor methods in unsupervised learning, Optimization landscape of Tucker decomposition, GMRES methods for tomographic reconstruction with an unmatched back projector, On perturbation bounds for orthogonal projections, Perturbation of the SVD in the presence of small singular values, Unnamed Item, Perturbation bounds for the least squares problem, Algebraic connections between the least squares and total least squares problems, Sparse principal component analysis and iterative thresholding, Statistically optimal and computationally efficient low rank tensor completion from noisy entries, Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices, Stable super-resolution limit and smallest singular value of restricted Fourier matrices, Verified inclusions for a nearest matrix of specified rank deficiency via a generalization of Wedin's \(\sin (\theta)\) theorem, Reconstruction of a low-rank matrix in the presence of Gaussian noise, Minimax estimation in sparse canonical correlation analysis, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Random perturbation of low rank matrices: improving classical bounds, Accuracy of singular vectors obtained by projection-based SVD methods, Unnamed Item, Unnamed Item, Singular quadratic eigenvalue problems: linearization and weak condition numbers, Entrywise eigenvector analysis of random matrices with low expected rank, Matrix completion with sparse measurement errors, Computational methods of linear algebra, A Simple SVD Algorithm for Finding Hidden Partitions, Numerical Rank Deficiency in Matrix Products, Learning functions of few arbitrary linear parameters in high dimensions, CGLS-GCV: A hybrid algorithm for low-rank-deficient problems., Matrices with Hierarchical Low-Rank Structures, On the accuracy of total least squares and least squares techniques in the presence of errors on all data, Sparse PCA: optimal rates and adaptive estimation, Residual bounds for some or all singular values, Multiplicative perturbation bounds for spectral and singular value decompositions, Detection, reconstruction, and characterization algorithms from noisy data in multistatic wave imaging, Uniform Bounds for Invariant Subspace Perturbations, Weyl-type relative perturbation bounds for eigensystems of Hermitian matrices, Normal approximation and confidence region of singular subspaces, Robust multifrequency imaging with MUSIC, Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics, Finding a low-rank basis in a matrix subspace, Consistent estimation in an implicit quadratic measurement error model, Submatrix localization via message passing, An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation, Regularization and Matrix Computation in Numerical Polynomial Algebra, New multiplicative perturbation bounds of the Moore–Penrose inverse, On the almost rank deficient case of the least squares problem, Unnamed Item, Subspace perspective on canonical correlation analysis: dimension reduction and minimax rates, Self-Calibration and Bilinear Inverse Problems via Linear Least Squares, A locally optimal rank revealing product decomposition, ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions, The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising, Angle-based joint and individual variation explained, Perturbation analysis for circles, spheres, and generalized hyperspheres fitted to data by geometric total least-squares, Robust high-dimensional factor models with applications to statistical machine learning, Multi-kernel unmixing and super-resolution using the modified matrix pencil method, Perturbation expansions and error bounds for the truncated singular value decomposition, On perturbations of some constrained subspaces, Learning non-parametric basis independent models from point queries via low-rank methods, Sensor calibration for off-the-grid spectral estimation, Perturbation theory for the Eckart-Young-Mirsky theorem and the constrained total least squares problem, Convex combination of data matrices: PCA perturbation bounds for multi-objective optimal design of mechanical metafilters, On a second-order expansion of the truncated singular subspace decomposition, On the Sensitivity of Singular and Ill-Conditioned Linear Systems, Relative perturbation theory. IV: \(\sin 2\theta\) theorems, Parallel Prony's Method with Multivariate Matrix Pencil Approach and Its Numerical Aspects, Fitting conics of specific types to data, Tensor Decompositions for Learning Latent Variable Models (A Survey for ALT), The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics, Structured Latent Factor Analysis for Large-scale Data: Identifiability, Estimability, and Their Implications, A new relative perturbation theorem for singular subspaces, Low-Rank Matrix Approximations Do Not Need a Singular Value Gap, Stable als approximation in the TT-format for rank-adaptive tensor completion, Singular Vector Perturbation Under Gaussian Noise, An \({\ell_p}\) theory of PCA and spectral clustering, A perturbation analysis of the intrinsic conditioning of an approximate null vector computed with a SVD, Unnamed Item, Perturbation analysis of the canonical subspaces, Stable recovery of entangled weights: towards robust identification of deep neural networks from minimal samples, An SVD analysis of linear algebraic equations derived from first kind integral equations, Unnamed Item, On a Problem of Weighted Low-Rank Approximation of Matrices, Robust and resource-efficient identification of two hidden layer neural networks, On two continuum armed bandit problems in high dimensions, On accurate error estimates for the quaternion least squares and weighted least squares problems
Cites Work
