diff options
| author | Qing145 <68147254+Qing145@users.noreply.github.com> | 2025-10-27 16:59:00 +0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2025-10-27 16:59:00 +0800 |
| commit | a80ec11f53bd71bf74a6ce191c09c1acefb7b8d3 (patch) | |
| tree | da77b0f1a547d0eb3c0c534348e3f59db2398b05 /readme.md | |
| parent | 14a416c1a03623ab3cf2ea2649abe50258d9eb18 (diff) | |
Update readme.md
Diffstat (limited to 'readme.md')
| -rw-r--r-- | readme.md | 12 |
1 files changed, 6 insertions, 6 deletions
@@ -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. + <p align="center"> <img src="figure/main_figure.png" width="95%" alt="Framework Overview"> </p> --- ## 🎉 **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). --- |
