Optimal sampling algorithms for block matrix multiplication

DOI10.1016/j.cam.2023.115063arXiv2105.04940OpenAlexW4316126879MaRDI QIDQ6100583

Chengmei Niu, Hanyu Li

Publication date: 22 June 2023

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.04940

zbMATH Keywords

optimal samplinga-optimal design criterionblock matrix multiplicationprobability error boundtwo step algorithm

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (1)

A block-randomized stochastic method with importance sampling for CP tensor decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The restricted isometry property for random block diagonal matrices
• Distributed subdata selection for big data via sampling-based approach
• Importance Sampling for a Monte Carlo Matrix Multiplication Algorithm, with Application to Information Retrieval
• Approximating Matrix Multiplication for Pattern Recognition Tasks
• Optimal Approximate Matrix Product in Terms of Stable Rank
• A Refinement of the Remainder in the Lyapunov Theorem
• Optimal Subsampling for Large Sample Logistic Regression
• A Multilevel Monte Carlo Estimator for Matrix Multiplication
• Fast monte-carlo algorithms for finding low-rank approximations
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Optimal subsampling for quantile regression in big data

This page was built for publication: Optimal sampling algorithms for block matrix multiplication