arXiv (All)
open access
On the Robustness of Sparse Randomized Sketching to FP16 Rounding on GPUs
Randomized sketching replaces large matrices with smaller surrogates that preserve geometry for downstream numerical linear algebra. Sparse sketches promise faster formation than dense projections, but irregular GPU atomic updates become costly when each input row contributes to several output rows,
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Scaling Fourier-Based Sparse Matrix Analysis on GPUs#1034300
- What Irregularity Costs: CUDA C++, Rust, and Triton on a Hash-Blocked GPU Workload#441766
- Taming Bitwise Behavior in GPU Kernels with Tensor Core: Black-Box Reconstruction, Compiler Enforcement, and Static Verification#673469
- GPU-Enabled Large-Scale Optimization Using Randomized Linear Algebra#985521
- Fast Differentiable SVD on GPU via Polar Decomposition#1116836
Record · ID 1343613
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive