arXiv (All)
open access
GPUSparse: Fast and Exact Learned Sparse Retrieval on a GPU-Resident Inverted Index
Learned sparse models such as SPLADE match the quality of dense bi-encoders and keep the exact-match behavior of lexical retrieval. They are served on CPUs, using inverted-index traversal algorithms such as WAND. These algorithms are fast because they prune: they skip documents that cannot enter the
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
- D-NOVA: In-Storage Retrieval Accelerator via Dual-Bound 3D NAND-Optimized Similarity Search with Vector Adaptation#386983
- Retrieval-Centric Deep Learning in Growing Nonparametric Neural Networks#1199132
- Sequential Retrieval in Dense Associative Memory: Asymptotic Dynamics and Storage Capacity#1083472
- Two For The Price Of One: Curvature-Aware Pruning Preserves Influence Functions Too#1344018
- CyFA: Linear Sequence Modeling with Relative-Time-Partitioned Memory#1131101
Record · ID 1534978
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