graph-pruning

Tag

Cards List
#graph-pruning

Better Nearest Neighbor Graph Indices via (Efficient) LLM-Guided Pruning

arXiv cs.AI ↗ · 2026-09-30 Cached

This paper introduces LLM-Guided Graph Pruning (LGP), a framework that uses LLM reasoning to refine graph-based ANN indices (e.g., HNSW, DiskANN) by pruning low-value neighbors, addressing the geometry–semantic mismatch in how these indices are built versus evaluated, and improving end-to-end retrieval over vanilla greedy search and LLM reranking.

0 favorites 0 likes
#graph-pruning

Mapping Text to Multiplex Graph: Prompt Compression as L\'evy Walk-Guided Graph Pruning

arXiv cs.CL ↗ · 2026-07-03 Cached

This paper proposes RAGP, a prompt compression method that models text as a multiplex graph and uses Lévy walks for redundancy-aware graph pruning, achieving superior performance on LongBench compared to existing LLM-based compression methods.

0 favorites 0 likes
← Back to home

Submit Feedback