Importance sampling for a Monte Carlo matrix multiplication algorithm, with application to information retrieval
From MaRDI portal
(Redirected from Publication:3103537)
Basic linear algebra (15A99) Positive matrices and their generalizations; cones of matrices (15B48) Applications of statistics in engineering and industry; control charts (62P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Randomized algorithms (68W20)
Recommendations
Cited in
(9)- Gaussian variant of Freivalds' algorithm for efficient and reliable matrix product verification
- Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
- A numerical study of efficient sampling strategies for randomized singular value decomposition
- A multilevel Monte Carlo estimator for matrix multiplication
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra
- A literature survey of matrix methods for data science
- Optimal sampling algorithms for block matrix multiplication
- Efficient algorithms for Tucker decomposition via approximate matrix multiplication
This page was built for publication: Importance sampling for a Monte Carlo matrix multiplication algorithm, with application to information retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3103537)