arXiv (All)
open access
HHR: Hierarchical Hash Retrieval for Efficient LLM Generation
Efficient long-context inference is essential for large language models (LLMs), yet it poses a severe computational bottleneck. Hash-based retrieval offers an efficient alternative by encoding queries and keys into binary codes and using Hamming distance for key selection. However, this leads to a c
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
- JeanKaddour/minipile#786962
- SCOPE: A Generative Approach for LLM Prompt Compression#652091
- SCOPE: A Generative Approach for LLM Prompt Compression#650638
- mwHIT: accelerated and accurate histone modification imputation using multi-scale window attention.#406429
- LLM Probability Concentration: How Alignment Shrinks the Generative Horizon#1082952
Record · ID 1156502
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