Tag
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.
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.