FAST MONTE CARLO ALGORITHMS FOR MATRICES II: COMPUTING A LOW-RANK APPROXIMATION TO A MATRIX∗

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication

  2006influential reference
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

  2006cited by this paper
• Visual learning and recognition of 3-d objects from appearance

  2005cited by this paper
• FAST MONTE CARLO ALGORITHMS FOR MATRICES III: COMPUTING A COMPRESSED APPROXIMATE MATRIX DECOMPOSITION∗

  2004cited by this paper
• Pass efficient algorithms for approximating large matrices

  2003influential reference
• Sampling lower bounds via information theory

  2003cited by this paper
• The complexity of massive data set computations

  2002cited by this paper
• Fast Monte-Carlo algorithms for approximate matrix multiplication

  2001cited by this paper
• Fast computation of low rank matrix approximations

  2001influential reference
• Missing value estimation methods for DNA microarrays

  2001cited by this paper
• Singular value decomposition for genome-wide expression data processing and modeling.

  2000cited by this paper
• Stable distributions, pseudorandom generators, embeddings and data stream computation

  2000cited by this paper
• MICROARRAY EXPERIMENTS : APPLICATION TO SPORULATION TIME SERIES

  1999cited by this paper
• Clustering in large graphs and matrices

  1999cited by this paper
• Matrices, Vector Spaces, and Information Retrieval

  1999cited by this paper
• Authoritative sources in a hyperlinked environment

  1999cited by this paper
• Latent semantic indexing: a probabilistic analysis

  1998cited by this paper
• Fast Monte-Carlo algorithms for finding low-rank approximations

  1998influential reference
• Random projection: a new approach to VLSI layout

  1998cited by this paper
• Two algorithms for nearest-neighbor search in high dimensions

  1997cited by this paper
• Using Linear Algebra for Intelligent Information Retrieval

  1995cited by this paper
• Matrix Perturbation Theory

  1991cited by this paper
• Eigenfaces for Recognition

  1991cited by this paper
• Matrix analysis

  1985cited by this paper

• Low-rank Orthogonalization for Large-scale Matrix Optimization with Applications to Foundation Model Training

  2025cites this paper
• k-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation

  2025cites this paper
• A joint sparse self-representation learning method for multiview clustering

  2025cites this paper
• Efficient quaternion CUR decomposition based on discrete empirical interpolation method

  2025cites this paper
• Efficient Machine Learning for Wi-Fi CSI-based Human Activity Recognition Using Fast Monte Carlo based Feature Extraction

  2025cites this paper
• Algorithmic Guarantees for Distilling Supervised and Offline RL Datasets

  2025cites this paper
• Randomized Krylov-Schur eigensolver with deflation

  2025cites this paper
• CURing Large Models: Compression via CUR Decomposition

  2025cites this paper
• SVE-Former: A fast fourier transformer via singular vector embedding

  2025cites this paper
• The General Expiration Streaming Model: Diameter, k-Center, Counting, Sampling, and Friends

  2025cites this paper
• Near-optimal hierarchical matrix approximation from matrix-vector products

  2024cites this paper
• Admissible subspaces and the subspace iteration method

  2024cites this paper
• Optimization of Random Feature Method in the High-Precision Regime

  2024influential citation
• A Fast Algorithm for the Finite Expression Method in Learning Dynamics on Complex Networks

  2024cites this paper
• Learning to Solve Multiresolution Matrix Factorization by Manifold Optimization and Evolutionary Metaheuristics

  2024cites this paper
• LibAMM: Empirical Insights into Approximate Computing for Accelerating Matrix Multiplication

  2024cites this paper
• Efficient and Accurate PageRank Approximation on Large Graphs

  2024cites this paper
• Re-anchoring Quantum Monte Carlo with Tensor-Train Sketching

  2024cites this paper
• LRAMM - Low precision approximates GEMM via RSVD

  2024cites this paper
• CUR and Generalized CUR Decompositions of Quaternion Matrices and their Applications

  2024cites this paper
• Fast multiple rank-constrained matrix approximation

  2023cites this paper
• Solution of the EEG inverse problem by random dipole sampling

  2023cites this paper
• Faster TKD: Towards Lightweight Decomposition for Large-Scale Tensors With Randomized Block Sampling

  2023cites this paper
• Random or Nonrandom Signal in High-Dimensional Regimes

  2023cites this paper
• Gradient Coding With Iterative Block Leverage Score Sampling

  2023cites this paper
• A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation

  2023influential citation
• Adaptive Parallelizable Algorithms for Interpolative Decompositions via Partially Pivoted LU

  2023cites this paper
• A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks

  2023cites this paper
• A parallel low rank matrix optimization method for recovering internet traffic network data via link flow measurement

  2023cites this paper
• Energy-Based Adaptive CUR Matrix Decomposition

  2023cites this paper
• A compact Heart iteration for low-rank approximations of large matrices

  2023cites this paper
• Robust Dequantization of the Quantum Singular Value Transformation and Quantum Machine Learning Algorithms

  2023cites this paper
• Efficient Block Approximate Matrix Multiplication

  2023cites this paper
• NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors

  2023influential citation
• Robust enhanced indexation optimization with sparse industry layout constraint

  2023cites this paper
• Compressing Tabular Data via Latent Variable Estimation

  2023cites this paper
• Least-Mean-Squares Coresets for Infinite Streams

  2023cites this paper
• An Iterative Random Sampling Algorithm for Rapid and Scalable Estimation of Matrix Spectra

  2023cites this paper
• Uncovering block structures in large rectangular matrices

  2023cites this paper
• Sketching and Vectorizing Merge Trees for Scientific Data Visualization

  2023cites this paper
• Graph Sparsification by Approximate matrix Multiplication

  2023cites this paper
• Sketching Merge Trees for Scientific Visualization

  2023cites this paper
• Online Dominant Generalized Eigenvectors Extraction via a Randomized Algorithm

  2023cites this paper
• An Improved Classical Singular Value Transformation for Quantum Machine Learning

  2023cites this paper
• Matrix Compression via Randomized Low Rank and Low Precision Factorization

  2023cites this paper
• Extraordinarily Time- and Memory-Efficient Large-Scale Canonical Correlation Analysis in Fourier Domain: From Shallow to Deep

  2023cites this paper
• WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions

  2022cites this paper
• Time and Memory Efficient Large-Scale Canonical Correlation Analysis in Fourier Domain

  2022cites this paper
• Cross Tensor Approximation for Image and Video Completion

  2022cites this paper
• Adaptive surrogate modeling for high-dimensional spatio-temporal output

  2022cites this paper
• A Novel False Data Injection Attack Formulation Based on CUR Low-Rank Decomposition Method

  2022cites this paper
• Dequantizing algorithms to understand quantum advantage in machine learning

  2022cites this paper
• Sampling With Replacement vs Poisson Sampling: A Comparative Study in Optimal Subsampling

  2022cites this paper
• Non-uniform Nyström approximation for sparse kernel regression: Theoretical analysis and experimental evaluation

  2022cites this paper
• Multiresolution Matrix Factorization and Wavelet Networks on Graphs

  2022cites this paper
• Fast hypergraph regularized nonnegative tensor ring decomposition based on low-rank approximation

  2022cites this paper
• Generalized Reference Kernel for One-class Classification

  2022cites this paper
• Learning Approach For Fast Approximate Matrix Factorizations

  2022cites this paper
• Long-time prediction of nonlinear parametrized dynamical systems by deep learning-based reduced order models

  2022cites this paper
• projUNN: efficient method for training deep networks with unitary matrices

  2022cites this paper
• Error Analysis of Tensor-Train Cross Approximation

  2022cites this paper
• Effective implementation to reduce execution time of a low-rank matrix approximation problem

  2022cites this paper
• Efficient algorithms for computing rank‐revealing factorizations on a GPU

  2021cites this paper
• Dominant subspace and low-rank approximations from block Krylov subspaces without a gap

  2021cites this paper
• An Efficient Randomized Algorithm for Computing the Approximate Tucker Decomposition

  2021cites this paper
• Sketching Merge Trees for Scientific Data Visualization

  2021influential citation
• Robust portfolio rebalancing with cardinality and diversification constraints

  2021cites this paper
• Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA

  2021cites this paper
• Deterministic matrix sketches for low-rank compression of high-dimensional simulation data

  2021cites this paper
• Faster Quantum-inspired Algorithms for Solving Linear Systems

  2021cites this paper
• Approximating matrix eigenvalues by randomized subspace iteration

  2021cites this paper
• A comparative study on sampling with replacement vs Poisson sampling in optimal subsampling

  2021cites this paper
• POD-DL-ROM: enhancing deep learning-based reduced order models for nonlinear parametrized PDEs by proper orthogonal decomposition

  2021cites this paper
• Multiplying Matrices Without Multiplying

  2021cites this paper
• Preconditioning for Scalable Gaussian Process Hyperparameter Optimization

  2021cites this paper
• A quantum-inspired algorithm for approximating statistical leverage scores

  2021cites this paper
• GraphLSHC: Towards large scale spectral hypergraph clustering

  2021cites this paper
• Probabilistic computing with p-bits

  2021cites this paper
• WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditions

  2021cites this paper
• Dominant subspace and low-rank approximations from block Krylov subspaces without a prescribed gap

  2021cites this paper
• Improved Algorithms for Low Rank Approximation from Sparsity

  2021cites this paper
• Learning Multiresolution Matrix Factorization and its Wavelet Networks on Graphs

  2021cites this paper
• Randomized block Krylov methods for approximating extreme eigenvalues

  2021cites this paper
• Generalized Fractional Repetition Codes for Binary Coded Computations

  2021cites this paper
• Functional principal subspace sampling for large scale functional data analysis

  2021cites this paper
• On the approximation of a matrix

  2021cites this paper
• Fast Hypergraph Regularized Nonnegative Tensor Ring Factorization Based on Low-Rank Approximation

  2021cites this paper
• An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration

  2021cites this paper
• Sketching Merge Trees

  2021cites this paper
• An Efficient and Scalable Algorithm for Estimating Kemeny's Constant of a Markov Chain on Large Graphs

  2021cites this paper
• Cross Tensor Approximation Methods for Compression and Dimensionality Reduction

  2021cites this paper
• Perspective: Probabilistic computing with p-bits

  2021cites this paper
• Randomized Algorithms for Computation of Tucker Decomposition and Higher Order SVD (HOSVD)

  2020cites this paper
• A cross-product approach for low-rank approximations of large matrices

  2020cites this paper
• A randomized balanced proper orthogonal decomposition technique

  2020cites this paper
• Pass-efficient randomized LU algorithms for computing low-rank matrix approximation

  2020cites this paper
• Algorithms for Massive Data Problems: Streaming, Sketching, and Sampling

  2020cites this paper
• Approximating Hamiltonian dynamics with the Nyström method

  2020cites this paper
• Best-Fit Subspaces and Singular Value Decomposition (SVD)

  2020cites this paper
• Approximate Weighted C R Coded Matrix Multiplication

  2020cites this paper