From a80ec11f53bd71bf74a6ce191c09c1acefb7b8d3 Mon Sep 17 00:00:00 2001 From: Qing145 <68147254+Qing145@users.noreply.github.com> Date: Mon, 27 Oct 2025 16:59:00 +0800 Subject: Update readme.md --- readme.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'readme.md') diff --git a/readme.md b/readme.md index 21d15d1..1ca1443 100644 --- a/readme.md +++ b/readme.md @@ -17,18 +17,18 @@ --- ## 🚀 **Highlights** -- ✅ **Relation-free Graph Construction**: Eliminates unstable relation extraction, using only lightweight entity recognition to graph. -- 🔥 **Zero Token Consumption**: Complete graph construction and retrieval without any LLM calls. -- 📊 **Strong Results**: Outperforms previous RAG methods on widely-used benchmarks. - +- ✅ **Context-Preserving**: A relation-free graph construction paradigm, relying on lightweight entity recognition and semantic linking to achieve comprehensive contextual comprehension. +- ✅ **Complex Reasoning**: Enables deep retrieval via semantic bridging, achieving multi-hop reasoning in a single retrieval pass without requiring an explicit relational graph. +- ✅ **High Scalability**: Zero LLM token consumption, faster processing speed, and linear time/space complexity. +

Framework Overview

--- ## 🎉 **News** -- [2025-10-26] We have released the code and [dataset](https://huggingface.co/datasets/Zly0523/linear-rag). -- [2025-10-11] We have released the paper on [Arxiv](https://arxiv.org/abs/2510.10114). +- [2025-10-26] We have released the [code](https://github.com/DEEP-PolyU/LinearRAG.git) and [dataset](https://huggingface.co/datasets/Zly0523/linear-rag). +- [2025-10-11] We have released the preprint version of this paper on [arxiv](https://arxiv.org/abs/2510.10114). --- -- cgit v1.2.3