arXiv (All)
open access
SparseConflicts: Handling Conflicting Data Layouts in Sparse Tensor Contractions
Optimizing sparse tensor computations is challenging due to the use of compressed storage formats, which leads to non-affine loop nests and a vast, complex schedule space. The performance of a given schedule is sensitive to the sparsity pattern of the input tensors, making it difficult to find a sin
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
- WingSpan: Concurrency and Dependence for Sparse and Structured Tensor Compilers#677649
- WingSpan: Concurrency and Dependence for Sparse and Structured Tensor Compilers#674448
- DanLing NestedTensor: Composable Multi-Ragged Tensors for Deep Learning#1104578
- ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings#677415
- ReLATE: Accelerating Tensor Decomposition via Safe and Efficient Learning of Sparse Encodings#674218
Record · ID 973909
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