Communication Avoiding Parallel Sketching via Sparse Subspace Embeddings
Year: 2026
Type: conference-paper
Abstract: This paper considers sketching via sparse subspace embeddings that are commonly employed in randomized algorithms due to their efficiency when applied to large scale matrices. We introduce lower bounds on communication and design optimal algorithms for sketching large scale matrices using sparse random embeddings. We consider different matrix dimensions and aspect ratios that are relevant for scientific computing and machine learning applications. We demonstrate the strong and weak scalability of these algorithms on both CPU and GPU architectures.
Source: HAL
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7213734592
