Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
From MaRDI portal
Publication:5470751
DOI10.1137/S0097539704442702zbMath1111.68149MaRDI QIDQ5470751
Michael W. Mahoney, Petros Drineas, Ravindran Kannan
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Related Items
Randomized numerical linear algebra: Foundations and algorithms ⋮ Functional principal subspace sampling for large scale functional data analysis ⋮ Randomized Local Model Order Reduction ⋮ A Distance-Preserving Matrix Sketch ⋮ Column subset selection problem is UG-hard ⋮ Unnamed Item ⋮ A randomized algorithm for a tensor-based generalization of the singular value decomposition ⋮ Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format ⋮ Far-field compression for fast kernel summation methods in high dimensions ⋮ Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices ⋮ Cubature, Approximation, and Isotropy in the Hypercube ⋮ Fast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra ⋮ A compact heart iteration for low-rank approximations of large matrices ⋮ Pass-efficient randomized LU algorithms for computing low-rank matrix approximation ⋮ A hybrid stochastic interpolation and compression method for kernel matrices ⋮ Descriptive matrix factorization for sustainability. Adopting the principle of opposites ⋮ Optimal subsampling for softmax regression ⋮ Low-rank incremental methods for computing dominant singular subspaces ⋮ Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction ⋮ Link Prediction for Egocentrically Sampled Networks ⋮ Generalized pseudoskeleton decompositions ⋮ Literature survey on low rank approximation of matrices ⋮ Optimal CUR Matrix Decompositions ⋮ Parallel cross interpolation for high-precision calculation of high-dimensional integrals ⋮ Exemplar-based low-rank matrix decomposition for data clustering ⋮ A Model-free Variable Screening Method Based on Leverage Score ⋮ An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries ⋮ Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach ⋮ The Fourier approximation of smooth but non-periodic functions from unevenly spaced data ⋮ Quasioptimality of maximum-volume cross interpolation of tensors ⋮ Approximation error in regularized SVD-based Fourier continuations ⋮ Fast construction of hierarchical matrix representation from matrix-vector multiplication ⋮ Evolutionary Network Analysis ⋮ Generalizing the column-row matrix decomposition to multi-way arrays ⋮ Unnamed Item ⋮ Fast randomized matrix and tensor interpolative decomposition using countsketch ⋮ Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification ⋮ CUR matrix decompositions for improved data analysis ⋮ A cross-product approach for low-rank approximations of large matrices ⋮ Perspectives on CUR decompositions ⋮ Less is More: Sparse Graph Mining with Compact Matrix Decomposition ⋮ Non‐negative residual matrix factorization: problem definition, fast solutions, and applications ⋮ Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications ⋮ HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation ⋮ Dimension reduction via principal variables ⋮ On selecting a maximum volume sub-matrix of a matrix and related problems ⋮ Fast dimension reduction using Rademacher series on dual BCH codes ⋮ Multiway Monte Carlo Method for Linear Systems ⋮ Unnamed Item ⋮ Perturbations of CUR Decompositions ⋮ Robust CUR Decomposition: Theory and Imaging Applications
Uses Software
