首页/论文/2001.11874

arXiv 2001.118742020-01-31math.STstat.TH

A Consistency Theorem for Randomized Singular Value Decomposition

Ting-Li Chen, Su-Yun Huang, Weichung Wang

英文摘要：

The singular value decomposition (SVD) and the principal component analysis are fundamental tools and probably the most popular methods for data dimension reduction. The rapid growth in the size of data matrices has lead to a need for developing efficient large-scale SVD algorithms. Randomized SVD was proposed, and its potential was demonstrated for computing a low-rank SVD (Rokhlin et al., 2009). In this article, we provide a consistency theorem for the randomized SVD algorithm and a numerical example to show how the random projections to low dimension affect the consistency.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Shifted Randomized Singular Value Decomposition

Uppsala University（乌普萨拉大学）

We extend the randomized singular value decomposition (SVD) algorithm \citep{Halko2011finding} to estimate the SVD of a shifted data matrix without explicitly constructing the matrix in the memory. With no loss in the accuracy of the original algorithm, the extended algorithm provides for a more efficient way of matrix factorization. The algorithm facilitates the low-rank approximation and principal component analysis (PCA) of off-center data matrices. When applied to different types of data matrices, our experimental results confirm the advantages of the extensions made to the original algori…

2019-11-28cs.LGstat.ML

用于主成分分析与奇异值分解分布式计算的随机算法

Randomized algorithms for distributed computation of principal component analysis and singular value decomposition

本文提出面向高长方矩阵 PCA/SVD 及任意矩阵低秩近似的分布式随机算法，并在 Spark 上证明其优于现成确定性实现且左奇异向量接近机器精度正交归一。

2018-01-01cs.DCcs.NAmath.NA

An implementation of a randomized algorithm for principal component analysis

Recent years have witnessed intense development of randomized methods for low-rank approximation. These methods target principal component analysis (PCA) and the calculation of truncated singular value decompositions (SVD). The present paper presents an essentially black-box, fool-proof implementation for Mathworks' MATLAB, a popular software platform for numerical computation. As illustrated via several tests, the randomized algorithms for low-rank approximation outperform or at least match the classical techniques (such as Lanczos iterations) in basically all respects: accuracy, computationa…

2014-12-11cs.MSstat.CO

Tutorial: Complexity analysis of Singular Value Decomposition and its variants

Institute of Automation, Chinese Academy of Sciences（中国科学院自动化研究所）；University of Chinese Academy of Sciences（中国科学院大学）

We compared the regular Singular Value Decomposition (SVD), truncated SVD, Krylov method and Randomized PCA, in terms of time and space complexity. It is well-known that Krylov method and Randomized PCA only performs well when k << n, i.e. the number of eigenpair needed is far less than that of matrix size. We compared them for calculating all the eigenpairs. We also discussed the relationship between Principal Component Analysis and SVD.

2019-10-14cs.LGcs.NAmath.NA

关于随机化 SVD 的噪声敏感性

On the Noise Sensitivity of the Randomized SVD

本文在尖峰随机矩阵模型下分析随机化 SVD 的噪声敏感性，揭示其奇异值呈现类似 BBP 的相变现象，并证明其在信号检测与估计上优于朴素草图 PCA，同时推导出适用于矩阵去噪的最优奇异值收缩器。

2023-07-06cs.ITcs.NAmath.IT

Faster Matrix Completion Using Randomized SVD

Tsinghua University（清华大学）；Old Dominion University（奥多明尼昂大学）

Matrix completion is a widely used technique for image inpainting and personalized recommender system, etc. In this work, we focus on accelerating the matrix completion using faster randomized singular value decomposition (rSVD). Firstly, two fast randomized algorithms (rSVD-PI and rSVD- BKI) are proposed for handling sparse matrix. They make use of an eigSVD procedure and several accelerating skills. Then, with the rSVD-BKI algorithm and a new subspace recycling technique, we accelerate the singular value thresholding (SVT) method in [1] to realize faster matrix completion. Experiments show t…

2018-10-16cs.LGstat.ML

更多相关论文收起更多论文

随机化奇异值分解的扰动分析及其在统计学中的应用

Perturbation Analysis of Randomized SVD and its Applications to Statistics

本文对随机化奇异值分解（RSVD）进行扰动分析，推导左奇异向量及其投影的误差上界，并应用于子空间估计、社区检测、矩阵补全和缺失数据PCA，获得近乎最优收敛速率与渐近正态性。

2025-05-25cs.NAmath.NAmath.ST

Randomized Matrix Decompositions using R

Matrix decompositions are fundamental tools in the area of applied mathematics, statistical computing, and machine learning. In particular, low-rank matrix decompositions are vital, and widely used for data analysis, dimensionality reduction, and data compression. Massive datasets, however, pose a computational challenge for traditional algorithms, placing significant constraints on both memory and processing power. Recently, the powerful concept of randomness has been introduced as a strategy to ease the computational load. The essential idea of probabilistic algorithms is to employ some amou…

2019-11-26cs.MSstat.COstat.ME

Randomized algorithms for statistical image analysis and site percolation on square lattices

We propose a novel probabilistic method for detection of objects in noisy images. The method uses results from percolation and random graph theories. We present an algorithm that allows to detect objects of unknown shapes in the presence of random noise. The algorithm has linear complexity and exponential accuracy and is appropriate for real-time systems. We prove results on consistency and algorithmic complexity of our procedure.

2011-02-24math.PRmath.STstat.ME

概率不纯度下降条件下随机森林类算法的一致性

Consistency of Random Forest Type Algorithms under a Probabilistic Impurity Decrease Condition

本文提出一个统一定理，通过引入概率充分不纯度下降条件，为极端随机树、交互森林、斜交回归树等更广泛的树基算法建立一致性，并扩展了随机森林一致性所适用的函数类。

2024-02-20math.STstat.TH

通过截断奇异值分解的估计器在存在共线性的误差在变量回归模型中的强一致性

Strong consistency of an estimator by the truncated singular value decomposition for an errors-in-variables regression model with collinearity

本文通过截断奇异值分解证明了在存在共线性的情况下，误差在变量回归模型中估计器的强一致性，扩展了总最小二乘法的理论。

2023-11-29cs.NAmath.NAmath.ST

Consistency of random forests

Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical performance, little is known about the mathematical properties of the procedure. This disparity between theory and practice originates in the difficulty to simultaneously analyze both the randomization process and the highly data-dependent tree structure. In the present paper, we take a step forward in forest exploration by proving a consistency result for Breima…

2015-08-08math.STstat.MLstat.TH

Universality laws for randomized dimension reduction, with applications

Dimension reduction is the process of embedding high-dimensional data into a lower dimensional space to facilitate its analysis. In the Euclidean setting, one fundamental technique for dimension reduction is to apply a random linear map to the data. This dimension reduction procedure succeeds when it preserves certain geometric features of the set. The question is how large the embedding dimension must be to ensure that randomized dimension reduction succeeds with high probability. This paper studies a natural family of randomized dimension reduction maps and a large class of data sets. It pro…

2017-09-17cs.DScs.ITmath.IT