• 面向大语言模型的子问题拆解与多阶段推理优化方法

    Sub-question decomposition and multi-stage reasoning optimization with large language models for retrieval-augmented generation

    • 随着大语言模型在智能客服、知识工程、文本生成等领域的深度应用,其已成为推动人工智能技术落地的核心驱动力。然而,在多阶段问答场景中,现有方法普遍采用原始问题直接检索模式,难以解析问题内部的隐式逻辑关联,导致复杂推理中的语义断层与路径偏差。针对上述局限性,提出一种基于问题解构思维链的多阶段问答框架。首先,通过查询感知的实体树段落筛选机制,系统提取核心实体及其语义关联,构建结构化问题表征体系,实现相关性段落的高效检索与噪声抑制;其次,结合GPT-3模型,将复杂问题与实体树相关段落作为提示,生成语义独立的高质量子问题;最后,在检索-推理迭代过程中,将子问题序列作为多阶段检索的查询基准。该分解策略通过捕捉复杂问题的核心语义单元,将复合型问题转化为可解析的模块化子任务,为多阶段推理提供结构化知识表示与多样化检索视角。在公开数据集上的实验表明,所提方法相较于现有方法在检索和问答F1得分上提升1.2%~4.5%;同时,在铁路招标系统处理中取得了良好的应用效果,推动了大语言模型在铁路垂直领域的落地。

       

      Abstract: With the deep application of large language models in areas such as intelligent customer service, knowledge engineering, and text generation, they have become the core driving force behind the deployment of artificial intelligence technologies. However, in multi-stage question answering scenarios, existing methods generally adopt a direct retrieval approach based on the original question, which struggles to capture the implicit logical associations within the question, leading to semantic discontinuities and path deviations in complex reasoning. To address these limitations, this paper proposes a multi-stage question answering framework based on a question-decomposition chain of thought. First, through a query-aware entity tree paragraph filtering mechanism, the framework systematically extracts core entities and their semantic correlations, constructs a structured question representation, and achieves efficient retrieval of relevant paragraphs while suppressing noise. Second, using the GPT-3 model, the framework takes the complex question together with the entity-tree-related paragraphs as prompts to generate semantically independent, high-quality sub-questions. Finally, during the iterative retrieval-and-reasoning process, the sequence of sub-questions serves as the query basis for multi-stage retrieval. This decomposition strategy captures the core semantic units of complex questions, transforms compound questions into analyzable modular subtasks, and provides structured knowledge representations and diversified retrieval perspectives for multi-stage reasoning. Experimental results on public datasets show that the proposed method improves retrieval and question answering F1 scores by 1.2% to 4.5% compared to existing methods. Moreover, it achieves favorable performance in railway bidding system processing, promoting the application of large language models in the railway vertical domain.

       

    /

    返回文章
    返回