Zhixiao Qi
2026
Thought-Action Graph Reasoning: Faithful and Efficient Reasoning of Large Language Models via Reusing Past Experience
Zhixiao Qi | Feng Huang | Yunqi Zhang | Shijie Zhang | Qingqing Sun | Yongfeng Huang | Minghu Jiang | Shuai Chen | Tianyi Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Zhixiao Qi | Feng Huang | Yunqi Zhang | Shijie Zhang | Qingqing Sun | Yongfeng Huang | Minghu Jiang | Shuai Chen | Tianyi Zhang
Findings of the Association for Computational Linguistics: ACL 2026
Large language models (LLMs) often hallucinate in question answering (QA) tasks due to a lack of factual knowledge. While integrating knowledge graphs (KGs) with LLMs has alleviated this issue, existing methods suffer from poor generalization or low reasoning efficiency, and critically, they overlook the learning and reuse of reasoning paths from past experiences. To address these challenges, we introduce Thought-Action Graph (TAG), a structured repository of reasoning experiences. TAG decomposes successful LLM-KG interaction trajectories into fine-grained semantic operators, which are stored in TAG constructed by the thought layer and action layer. Building upon TAG, we propose a novel KGQA paradigm — TAG-Reasoning (TAGR). TAGR first retrieves and assembles reasoning blueprints from TAG, and then guides LLM to efficiently execute on KG according to them. Through this approach, TAGR transforms the computationally expensive online exploration process of LLMs into an offline process of TAG retrieval and assembly. Experimental results on multiple KGQA benchmarks demonstrate that TAGR significantly outperforms state-of-the-art methods across key metrics, while drastically reducing the number of LLM calls and generated tokens. This work opens new avenues for building continual learning, efficient, and faithful KGQA systems.
2025
Long-context Language Models Fail in Basic Retrieval Tasks Without Sufficient Reasoning Steps
Yijiong Yu | Zhixiao Qi | Yongfeng Huang | Wei Wang | Weifeng.liu | Ran Chen | Ji Pei
Findings of the Association for Computational Linguistics: EMNLP 2025
Yijiong Yu | Zhixiao Qi | Yongfeng Huang | Wei Wang | Weifeng.liu | Ran Chen | Ji Pei
Findings of the Association for Computational Linguistics: EMNLP 2025
Long-context language models (LCLMs), characterized by their extensive context window, are becoming popular. However, despite the fact that they are nearly perfect at standard long-context retrieval tasks, our evaluations demonstrate they fail in some basic cases. Later, we find they can be well addressed with a sufficient number of reasoning steps, guided by specific CoT prompts. This result emphasizes the potential necessity of solving specific long-context tasks using long-CoT methods, while previous long-context benchmarks always ignore the necessity of long reasoning for long-context tasks and treat them as direct QA tasks. Our code and datasets are available at https://github.com/yuyijiong/hard_retrieval_for_llm