Elamur Research⌕
☰
home / papers / 2026 / Minimal Free Resolution Guided Adaptive Tree Reasoning

Minimal Free Resolution Guided Adaptive Tree Reasoning

Paper · 2026 · Dezhao Tang, Meihan Liu, Yulai Tong et al.

Summary

Tree-style reasoning helps LLMs on multi-step problems, but adaptive tree methods usually depend on a hand-built pool of decomposition examples and manually tuned thresholds. When no suitable template exists, subquestions can be missed. Errors in deep nodes also cannot easily flow back to correct higher-level conclusions.

The authors propose SyRA (Syzygy-driven Reasoning Adapter). It frames question decomposition in terms of Minimal Free Resolution (MFR) from commutative algebra and turns three of its properties into algorithmic rules:

  • Minimality prunes redundant subproblems.
  • Exactness ensures no information is lost between tree layers.
  • Syzygy motivates residual backtracking, in which a weakly supported node is revised using evidence from all its descendants.

The framework runs a three-stage cycle inside a single LLM:

  • Knowledge Verifier: extracts key constraints and filters subproblems.
  • Knowledge Controller: decides whether a node should be split further and fills in missing pieces.
  • Knowledge Reasoner: answers each node and corrects errors.

On eight benchmarks, SyRA reduces logical errors and raises accuracy compared with CoT, DeAR and ToT, at the cost of extra inference time. This matters for accuracy-critical, multi-step tasks.

Key points

  • A pretrained T5-based discriminator identifies the "free generating elements," meaning the core constraints of a problem. Their count determines whether a subproblem becomes a leaf node or is decomposed further.
  • The Knowledge Controller uses two components to recover dropped information across layers:
    • an element-ratio check called IRR;
    • a generator called GCM that creates new subproblems from missing elements.
  • Evaluation covers eight datasets, including GSM8K, SVAMP and StrategyQA. Ablations run with GPT-4o-mini show that removing any module (KV, KC, IRR+GCM, or KR) lowers accuracy.
  • SyRA is slower than CoT per question. The authors recommend it for complex tasks and suggest CoT for latency-sensitive use. The paper also reports token usage.
  • Human evaluation involved two annotators who labelled 223 and 177 items. Code and data are available at github.com/Tim798-art/SyRA.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

 Fields, topics and concepts

📚 Shelves 4The field of science this work belongs to (OpenAlex fields).Computer Science · 18,614 worksArtificial Intelligence · 17,965 worksArts and Humanities · 17,450 worksLanguage and Linguistics · 17,296 works

🧭 Topics 1Research subjects and languages the work is about.Reasoning · 1,685 works

Cite

Cite as Dezhao Tang, Meihan Liu, Yulai Tong, Guan Yuan and Qiuyan Yan. 2026. Minimal Free Resolution Guided Adaptive Tree Reasoning. Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers).

The paper itself, not this page. BibTeX from the library's record of the work. DOI 10.18653/v1/2026.acl-long.2158

@inproceedings{tang2026minimal,
  title = {{Minimal Free Resolution Guided Adaptive Tree Reasoning}},
  author = {Dezhao Tang, Meihan Liu, Yulai Tong, Guan Yuan and Qiuyan Yan},
  booktitle = {Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)},
  year = {2026},
  doi = {10.18653/v1/2026.acl-long.2158},
  url = {https://doi.org/10.18653/v1/2026.acl-long.2158}
}

References

45 references, 11 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. M Artale. 1990. A minimal graded free resolution of a non-perfect module. Journal of Algebra, 132(1):1– 21. find
  2. Guangsheng Bao, Hongbo Zhang, Cunxiang Wang, Linyi Yang, and Yue Zhang. 2025. How likely do llms with cot mimic human reasoning? In Proceedings of the 31st International Conference on Computational Linguistics, pages 7831–7850.
  3. Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Michal Podstawski, Lukas Gianinazzi, Joanna Gajda, Tomasz Lehmann, Hubert Niewiadomski, Piotr Nyczyk, and 1 others. 2024. Graph of thoughts: Solving elaborate problems with large language models. In Proceedings of the AAAI conference on a… find
  4. Winfried Bruns and H Jürgen Herzog. 1998. Cohen-macaulay rings. 39. Cambridge university press. find
  5. Antonio Capani, Gabriel De Dominicis, Gianfranco Niesi, and Lorenzo Robbiano. 1997. Computing minimal finite free resolutions. Journal of Pure and Applied Algebra, 117:105–117. find
  6. Kaiyuan Chen, Jin Wang, and Xuejie Zhang. 2024. Mathematical reasoning via multi-step self questioning and answering for small language models. In CCF International Conference on Natural Language Processing and Chinese Computing, pages 81–93. Springer. find
  7. Wenhu Chen, Xueguang Ma, Xinyi Wang, and William W Cohen. 2022. Program of thoughts prompting: Disentangling computation from reasoning for numerical reasoning tasks. arXiv preprint arXiv:2211.12588. find
  8. Junhang Cheng, Fang Liu, Chengru Wu, and Li Zhang. 2025. Adaptivellm: A framework for selecting optimal cost-efficient llm for code-generation based on cot length. In Proceedings of the 16th International Conference on Internetware, pages 461–473. find
  9. Pengyu Cheng, Yong Dai, Tianhao Hu, Han Xu, Zhisong Zhang, Lei Han, Nan Du, and Xiaolong Li. 2024. Self-playing adversarial language game enhances llm reasoning. Advances in Neural Information Processing Systems, 37:126515–126543. find
  10. Cox David. 1991. Ideals, varieties, and algorithms-an introduction to computational algebraic geometry and commutative algebra. Undergraduate Texts in Mathematics. find
  11. David Eisenbud. 2013. Commutative algebra: with a view toward algebraic geometry, volume 150. Springer Science & Business Media. find
  12. Nathan Fieldsteel and Uwe Nagel. 2021. Minimal and cellular free resolutions over polynomial oi-algebras. arXiv preprint arXiv:2105.08603. — [arXiv:2105.08603](https://arxiv.org/abs/2105.08603) find
  13. Mor Geva, Daniel Khashabi, Elad Segal, Tushar Khot, Dan Roth, and Jonathan Berant. 2021. Did aristotle use a laptop? a question answering benchmark with implicit reasoning strategies. Transactions of the Association for Computational Linguistics, 9:346– 361. find
  14. Philippe Gimenez, Indranath Sengupta, and Hema Srinivasan. 2010. Minimal free resolutions for certain affine monomial curve. arXiv preprint arXiv:1011.4247. — [arXiv:1011.4247](https://arxiv.org/abs/1011.4247) find
  15. Team GLM, Aohan Zeng, Bin Xu, Bowen Wang, Chenhui Zhang, Da Yin, Dan Zhang, Diego Rojas, Guanyu Feng, Hanlin Zhao, and 1 others. 2024. Chatglm: A family of large language models from glm-130b to glm-4 all tools. arXiv preprint arXiv:2406.12793.
  16. Olga Golovneva, Moya Chen, Spencer Poff, Martin Corredor, Luke Zettlemoyer, Maryam Fazel-Zarandi, and Asli Celikyilmaz. 2022. Roscoe: A suite of metrics for scoring step-by-step reasoning. arXiv preprint arXiv:2212.07919.
  17. Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun. 2015. Deep residual learning. Image Recognition, 7(4):327–336. find
  18. Binyuan Hui, Jian Yang, Zeyu Cui, Jiaxi Yang, Dayiheng Liu, Lei Zhang, Tianyu Liu, Jiajun Zhang, Bowen Yu, Keming Lu, and 1 others. 2024. Qwen2. 5-coder technical report. arXiv preprint arXiv:2409.12186. — Qwen2.5-Coder Technical Report
  19. Aaron Hurst, Adam Lerer, Adam P Goucher, Adam Perelman, Aditya Ramesh, Aidan Clark, AJ Ostrow, Akila Welihinda, Alan Hayes, Alec Radford, and 1 others. 2024. Gpt-4o system card. arXiv preprint arXiv:2410.21276.
  20. Aditya Kalyanpur, Siddharth Patwardhan, BK Boguraev, Adam Lally, and Jennifer Chu-Carroll. 2012. Fact-based question decomposition in deepqa. IBM Journal of Research and Development, 56(3.4):13–1. find
  21. Roberto La Scala and Michael Stillman. 1998. Strategies for computing minimal free resolutions. Journal of Symbolic Computation, 26(4):409–431. find
  22. Chenghao Li, Chaoning Zhang, Yi Lu, Jiaquan Zhang, Qigan Sun, Xudong Wang, Jiwei Wei, Guoqing Wang, Yang Yang, and Heng Tao Shen. 2025. Syzygy of thoughts: Improving llm cot with the minimal free resolution. arXiv preprint arXiv:2504.09566. find
  23. Bingbin Liu, Sebastien Bubeck, Ronen Eldan, Janardhan Kulkarni, Yuanzhi Li, Anh Nguyen, Rachel Ward, and Yi Zhang. 2023. Tinygsm: achieving\> 80% on gsm8k with small language models. arXiv preprint arXiv:2312.09241. find
  24. Zhiyuan Ma, Zhenya Huang, Jiayu Liu, Minmao Wang, Hongke Zhao, and Xin Li. 2025. Automated creation of reusable and diverse toolsets for enhancing llm reasoning. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 39, pages 24821– 24830. find
  25. Kumar Manas, Stefan Zwicklbauer, and Adrian Paschke. 2024. Cot-tl: Low-resource temporal knowledge representation of planning instructions using chain-of-thought reasoning. In 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 9636–9643. IEEE. find
  26. Sewon Min, Victor Zhong, Luke Zettlemoyer, and Hannaneh Hajishirzi. 2019. Multi-hop reading comprehension through question decomposition and rescoring. arXiv preprint arXiv:1906.02916.
  27. Gabriel Nguetseng. 2003. Homogenization structures and applications i. Zeitschrift für Analysis und ihre Anwendungen, 22(1):73–108. find
  28. Giuseppe Pareschi. 2000. Syzygies of abelian varieties. Journal of the American Mathematical Society, 13(3):651–664. find
  29. Prasanna Reddy Pulakurthi, Jiamian Wang, Majid Rabbani, Sohail Dianat, Raghuveer Rao, and Zhiqiang Tao. 2025. X-cot: Explainable text-to-video retrieval via llm-based chain-of-thought reasoning. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing, pages 31172– 3… find
  30. Ankit Satpute, Noah Gießing, André Greiner-Petter, Moritz Schubotz, Olaf Teschke, Akiko Aizawa, and Bela Gipp. 2024. Can llms master math? investigating large language models on math stack exchange. In Proceedings of the 47th international ACM SIGIR conference on research and development in informat… find
  31. Amrith Setlur, Saurabh Garg, Xinyang Geng, Naman Garg, Virginia Smith, and Aviral Kumar. 2024. Rl on incorrect synthetic data scales the efficiency of llm math reasoning by eight-fold. Advances in Neural Information Processing Systems, 37:43000–43031. find
  32. Mirac Suzgun, Nathan Scales, Nathanael Schärli, Sebastian Gehrmann, Yi Tay, Hyung Won Chung, Aakanksha Chowdhery, Quoc Le, Ed Chi, Denny Zhou, and 1 others. 2023. Challenging big-bench tasks and whether chain-of-thought can solve them. In Findings of the Association for Computational Linguistics: AC…
  33. Yubo Wang, Xueguang Ma, Ge Zhang, Yuansheng Ni, Abhranil Chandra, Shiguang Guo, Weiming Ren, Aaran Arulraj, Xuan He, Ziyan Jiang, and 1 others. 2024. Mmlu-pro: A more robust and challenging multi-task language understanding benchmark. Advances in Neural Information Processing Systems, 37:95266–95290…
  34. Charles Weibel and MCR Butler. 1996. An introduction to homological algebra. Bulletin of the London Mathematical Society, 28(132):322–323. find
  35. Tomer Wolfson, Mor Geva, Ankit Gupta, Matt Gardner, Yoav Goldberg, Daniel Deutch, and Jonathan Berant. 2020. Break it down: A question understanding benchmark. Transactions of the Association for Computational Linguistics, 8:183–198.
  36. Haoyuan Wu, Xueyi Chen, Rui Ming, Jilong Gao, Shoubo Hu, Zhuolun He, and Bei Yu. 2025. Totrl: Unlock llm tree-of-thoughts reasoning potential through puzzles solving. arXiv preprint arXiv:2505.12717. — [arXiv:2505.12717](https://arxiv.org/abs/2505.12717) find
  37. Zhuofeng Wu, Richard He Bai, Aonan Zhang, Jiatao Gu, VG Vinod Vydiswaran, Navdeep Jaitly, and Yizhe Zhang. 2024. Divide-or-conquer? which part should you distill your llm? In Findings of the Association for Computational Linguistics: EMNLP 2024, pages 2572–2585. find
  38. Ziyang Xiao, Dongxiang Zhang, Xiongwei Han, Xiaojin Fu, Wing Yin Yu, Tao Zhong, Sai Wu, Yuan Wang, Jianwei Yin, and Gang Chen. 2024. Enhancing llm reasoning via vision-augmented prompting. Advances in Neural Information Processing Systems, 37:28772–28797. find
  39. Shangzi Xue, Zhenya Huang, Jiayu Liu, Xin Lin, Yuting Ning, Binbin Jin, Xin Li, and Qi Liu. 2024. Decompose, analyze and rethink: Solving intricate problems with human-like reasoning cycle. Advances in Neural Information Processing Systems, 37:357–385. find
  40. Xiao-Wen Yang, Xuan-Yi Zhu, Wen-Da Wei, Ding-Chu Zhang, Jie-Jing Shao, Zhi Zhou, Lan-Zhe Guo, and Yu-Feng Li. 2025. Step back to leap forward: Self-backtracking for boosting reasoning of language models. arXiv preprint arXiv:2502.04404. — [arXiv:2502.04404](https://arxiv.org/abs/2502.04404) find
  41. Shunyu Yao, Dian Yu, Jeffrey Zhao, Izhak Shafran, Tom Griffiths, Yuan Cao, and Karthik Narasimhan. 2023. Tree of thoughts: Deliberate problem solving with large language models. Advances in neural information processing systems, 36:11809–11822. find
  42. Haoyu Zhang, Jingjing Cai, Jianjun Xu, and Ji Wang. 2019. Complex question decomposition for semantic parsing. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 4477–4486. find
  43. Jinghan Zhang, Xiting Wang, Weijieying Ren, Lu Jiang, Dongjie Wang, and Kunpeng Liu. 2025. Ratt: A thought structure for coherent and correct llm reasoning. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 39, pages 26733–26741. find
  44. Renrui Zhang, Dongzhi Jiang, Yichi Zhang, Haokun Lin, Ziyu Guo, Pengshuo Qiu, Aojun Zhou, Pan Lu, Kai-Wei Chang, Yu Qiao, and 1 others. 2024. Mathverse: Does your multi-modal llm truly see the diagrams in visual math problems? In European Conference on Computer Vision, pages 169–186. Springer.
  45. Denny Zhou, Nathanael Schärli, Le Hou, Jason Wei, Nathan Scales, Xuezhi Wang, Dale Schuurmans, Claire Cui, Olivier Bousquet, Quoc Le, and 1 others. 2022. Least-to-most prompting enables complex reasoning in large language models. arXiv preprint arXiv:2205.10625.

Updated

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/tang-2026-minimal-free-resolution-guided-adaptive/