Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods

DOI10.1007/11841036_29MaRDI QIDQ5449537zbMATH OpenOpenAlexFDO

Authors

Publication date 11 March 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11841036_29

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Sampling theory, sample surveys (62D05) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Relative-Error CUR Matrix Decompositions
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

Cited in

(12)

• Far-field compression for fast kernel summation methods in high dimensions
• A randomized algorithm for a tensor-based generalization of the singular value decomposition
• Regression-aware decompositions
• Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods
• Imbalanced data sampling design based on grid boundary domain for big data
• Functional principal subspace sampling for large scale functional data analysis
• Exact matrix completion via convex optimization
• Relative-Error CUR Matrix Decompositions
• Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
• Column-coherent matrix decomposition
• Randomized estimation of functional covariance operator via subsampling
• Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition

Describes a project that uses

Uses Software

• Algorithm 844

This page was built for publication: Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449537)