arXiv (All)
open access
Fast Differentiable SVD on GPU via Polar Decomposition
We present a fully GPU-oriented SVD pipeline based on polar decomposition, motivated by iterative methods that rely solely on matrix multiplications, such as the Newton-Schulz iteration. We show that this approach enables up to a $2\times$ speedup compared to standard implementations. Furthermore, w
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
- Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging#1061762
- TIDE-MC: Two-Sided Interpolative Decomposition for Billion-Scale GPU Matrix Completion#423939
- Accelerate Vector Diffusion Maps by Landmarks#793607
- Accelerate Vector Diffusion Maps by Landmarks#789603
- Graph Traversal on Tensor Cores: A BFS Framework for Modern GPUs#259426
Record · ID 1116836
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