REVIEW 2 cited by
EdgeRAG: Online-Indexed RAG for Edge Devices
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Deploying Retrieval Augmented Generation (RAG) on resource-constrained edge devices is challenging due to limited memory and processing power. In this work, we propose EdgeRAG which addresses the memory constraint by pruning embeddings within clusters and generating embeddings on-demand during retrieval. To avoid the latency of generating embeddings for large tail clusters, EdgeRAG pre-computes and stores embeddings for these clusters, while adaptively caching remaining embeddings to minimize redundant computations and further optimize latency. The result from BEIR suite shows that EdgeRAG offers significant latency reduction over the baseline IVF index, but with similar generation quality while allowing all of our evaluated datasets to fit into the memory.
Forward citations
Cited by 2 Pith papers
-
WebANNS: Fast and Efficient Approximate Nearest Neighbor Search in Web Browsers
A new browser-native ANNS engine uses WebAssembly, lazy loading, and a memory optimizer to cut P99 query latency by up to 743.8x and memory use by up to 39% compared to Mememo.
-
MobileRAG: A Fast, Memory-Efficient, and Energy-Efficient Method for On-Device RAG
A fully on-device RAG pipeline using a partitioned, partially disk-loaded graph index and selective sentence-window reduction claims 1.72-8.89x faster vector search and up to 40.2% lower power than baselines, with com...
Discussion (0). Sign in to comment.