Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
From MaRDI portal
Publication:5470751
DOI10.1137/S0097539704442702zbMATH Open1111.68149MaRDI QIDQ5470751FDOQ5470751
Authors: Michael W. Mahoney, Petros Drineas, R. Kannan 
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Relative-Error $CUR$ Matrix Decompositions
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast monte-carlo algorithms for finding low-rank approximations
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Cited In (66)
- A Distance-Preserving Matrix Sketch
- A fast and oblivious matrix compression algorithm for Volterra integral operators
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Fast dimension reduction using Rademacher series on dual BCH codes
- Perturbations of the \textsc{Tcur} decomposition for tensor valued data in the Tucker format
- Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra
- Optimal subsampling for softmax regression
- Matrix decompositions using sub-Gaussian random matrices
- Less is More: Sparse Graph Mining with Compact Matrix Decomposition
- Generalizing the column-row matrix decomposition to multi-way arrays
- Low-rank incremental methods for computing dominant singular subspaces
- Descriptive matrix factorization for sustainability. Adopting the principle of opposites
- Far-field compression for fast kernel summation methods in high dimensions
- Parallel cross interpolation for high-precision calculation of high-dimensional integrals
- Cubature, approximation, and isotropy in the hypercube
- Fast construction of hierarchical matrix representation from matrix-vector multiplication
- A randomized algorithm for a tensor-based generalization of the singular value decomposition
- Column subset selection problem is UG-hard
- Randomized numerical linear algebra: Foundations and algorithms
- HOID: higher order interpolatory decomposition for tensors based on Tucker representation
- Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
- Title not available (Why is that?)
- Non‐negative residual matrix factorization: problem definition, fast solutions, and applications
- Multiway Monte Carlo method for linear systems
- Asymptotic error bounds for kernel-based Nyström low-rank approximation matrices
- Perturbations of CUR Decompositions
- Extending Hierarchical Probing for Computing the Trace of Matrix Inverses
- More efficient estimation for logistic regression with optimal subsamples
- An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries
- Evolutionary network analysis: a survey
- Perspectives on CUR decompositions
- Pass-efficient randomized LU algorithms for computing low-rank matrix approximation
- Approximation error in regularized SVD-based Fourier continuations
- Functional principal subspace sampling for large scale functional data analysis
- Fast randomized matrix and tensor interpolative decomposition using countsketch
- Efficient algorithms for CUR and interpolative matrix decompositions
- Robust CUR Decomposition: Theory and Imaging Applications
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification
- On selecting a maximum volume sub-matrix of a matrix and related problems
- Dimension reduction via principal variables
- Mode-wise tensor decompositions: multi-dimensional generalizations of CUR decompositions
- Sampling based succinct matrix approximation
- A cross-product approach for low-rank approximations of large matrices
- Relative-Error $CUR$ Matrix Decompositions
- Turbo‐SMT: Parallel coupled sparse matrix‐Tensor factorizations and applications
- Single-pass randomized algorithms for LU decomposition
- The Fourier approximation of smooth but non-periodic functions from unevenly spaced data
- Literature survey on low rank approximation of matrices
- Exemplar-based large-scale low-rank matrix decomposition for collaborative prediction
- Generalized pseudoskeleton decompositions
- Randomized local model order reduction
- A Model-free Variable Screening Method Based on Leverage Score
- Numerical linear algebra in the streaming model
- CUR matrix decompositions for improved data analysis
- Privacy preserving OLAP over distributed XML data: A theoretically-sound secure-multiparty-computation approach
- Quasioptimality of maximum-volume cross interpolation of tensors
- Fast monte-carlo algorithms for finding low-rank approximations
- Exemplar-based low-rank matrix decomposition for data clustering
- Compressed matrix multiplication
- A compact heart iteration for low-rank approximations of large matrices
- Randomized GCUR decompositions
- Link Prediction for Egocentrically Sampled Networks
- A hybrid stochastic interpolation and compression method for kernel matrices
- New subset selection algorithms for low rank approximation: offline and online
- Randomized estimation of functional covariance operator via subsampling
Uses Software
This page was built for publication: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470751)
