轻量高效RAG框架,助力网络运维自动化问答
EasyRAG: Efficient Retrieval-Augmented Generation Framework for Automated Network Operations
- 分步检索+双路稀疏召回+大模型重排,流程简洁精准
- 零微调、低显存,推理延迟显著降低,保持高准确率
- 适合运维自动化、低资源部署场景,代码开源可复用
本文提出EasyRAG,一种用于自动化网络运维的简单、轻量且高效的检索增强生成框架。该框架具备三大优势:一是精准问答,基于特定数据处理流程、双路稀疏检索粗排序、大模型重排和生成优化,其在GLM4赛道预赛中排名第一,半决赛中排名第二;二是部署简便,仅需BM25检索与BGE重排器,无需任何模型微调,显存占用极低,易于部署且高度可扩展,并提供灵活代码库支持多种搜索与生成策略;三是推理高效,设计了端到端的推理加速方案,显著降低整体检索、重排与生成过程的延迟,各加速模块可插拔式集成至RAG任意组件,持续提升系统效率。代码与数据已公开于https://github.com/BUAADreamer/EasyRAG。
原文摘要 · Abstract (English)
This paper presents EasyRAG, a simple, lightweight, and efficient retrieval-augmented generation framework for automated network operations. Our framework has three advantages. The first is accurate question answering. We designed a straightforward RAG scheme based on (1) a specific data processing workflow (2) dual-route sparse retrieval for coarse ranking (3) LLM Reranker for reranking (4) LLM answer generation and optimization. This approach achieved first place in the GLM4 track in the preliminary round and second place in the GLM4 track in the semifinals. The second is simple deployment. Our method primarily consists of BM25 retrieval and BGE-reranker reranking, requiring no fine-tuning of any models, occupying minimal VRAM, easy to deploy, and highly scalable; we provide a flexible code library with various search and generation strategies, facilitating custom process implementation. The last one is efficient inference. We designed an efficient inference acceleration scheme for the entire coarse ranking, reranking, and generation process that significantly reduces the inference latency of RAG while maintaining a good level of accuracy; each acceleration scheme can be plug-and-play into any component of the RAG process, consistently enhancing the efficiency of the RAG system. Our code and data are released at \url{https://github.com/BUAADreamer/EasyRAG}.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。