Improving compressed matrix multiplication using control variate method

DOI10.1016/J.IPL.2024.106517MaRDI QIDQ6602328zbMATH OpenFDO

Authors Bhisham Dev Verma, Punit Pankaj Dubey, Rameshwar Pratap, Manoj Thakur

Publication date 11 September 2024

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

control variatematrix multiplicationsketching algorithmscount-sketch

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx)

Recommendations

• Compressed matrix multiplication
• Compressed matrix multiplication
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• A note on compressed sensing and the complexity of matrix multiplication
• Fast Output-Sensitive Matrix Multiplication

Cites work

• A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
• A Perspective on the Use of Control Variables to Increase the Efficiency of Monte Carlo Simulations
• Approximating Matrix Multiplication for Pattern Recognition Tasks
• Compressed matrix multiplication
• Correlations between random projections and the bivariate normal
• Extra High Speed Matrix Multiplication on the Cray-2
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
• Fast sparse matrix multiplication
• Finding frequent items in data streams
• Frequent directions: simple and deterministic matrix sketching
• Gaussian elimination is not optimal
• New hash functions and their use in authentication and set equality
• The space complexity of approximating the frequency moments
• Universal classes of hash functions
• Variance reduction in feature hashing using MLE and control variate method

This page was built for publication: Improving compressed matrix multiplication using control variate method

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