TDA-RC: Task-Driven Alignment for Knowledge-Based Reasoning Chains in Large Language Models
Jiaquan Zhang, Qigan Sun, Chaoning Zhang, Xudong Wang, Zhenzhen Huang, Yitian Zhou, Pengcheng Zheng, Chi-lok Andy Tai, Sung-Ho Bae, Zeyu Ma, Caiyan Qin, Jinyu Guo, Yang Yang, Hengtao Shen

TL;DR
This paper introduces TDA-RC, a topology-based optimization method that enhances the reasoning quality of large language models by repairing logical gaps in single-round chains using topological analysis.
Contribution
It proposes a novel topological optimization framework that embeds reasoning structures into CoT, improving reasoning accuracy while maintaining efficiency.
Findings
Outperforms multi-round methods like ToT and GoT in accuracy and efficiency.
Uses persistent homology to unify and analyze reasoning chain structures.
Provides a practical single-round reasoning enhancement with multi-round capabilities.
Abstract
Enhancing the reasoning capability of large language models (LLMs) remains a core challenge in natural language processing. The Chain-of-Thought (CoT) paradigm dominates practical applications for its single-round efficiency, yet its reasoning chains often exhibit logical gaps. While multi-round paradigms like Graph-of-Thoughts (GoT), Tree-of-Thoughts (ToT), and Atom of Thought (AoT) achieve strong performance and reveal effective reasoning structures, their high cost limits practical use. To address this problem, this paper proposes a topology-based method for optimizing reasoning chains. The framework embeds essential topological patterns of effective reasoning into the lightweight CoT paradigm. Using persistent homology, we map CoT, ToT, and GoT into a unified topological space to quantify their structural features. On this basis, we design a unified optimization system: a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
