Papers with PoT
SAAS: Solving Ability Amplification Strategy for Enhanced Mathematical Reasoning in Large Language Models (2024.emnlp-industry)
Copied to clipboard
| Challenge: | Existing approaches to enhance mathematical reasoning and problem-solving abilities of Large Language Models (LLMs) despite their remarkable performance across domains, a notable challenge persists in the realm of mathematical reasoning. |
| Approach: | They propose a sequential learning approach that integrates the Chain-of-Thought and the Program-ofThough. |
| Outcome: | The proposed approach achieves state-of-the-art (SOTA) performance by integrating CoT and PoT learning. |
Mixed Distillation Helps Smaller Language Models Reason Better (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Recent large language models (LLMs) have demonstrated impressive multiple step-by-step reasoning capabilities in recent NLP reasoning tasks. |
| Approach: | They propose a mixed distillation framework that distills multiple step-by-step reasoning abilities into smaller language models (SLMs) they leverage LLMs to generate multiple step by step reasoning rationales by sampling automatically. |
| Outcome: | The proposed framework outperforms existing models on SVAMP, GSM8K and ASDIV, while a single model generated by MD exceeds the comprehensive performance of two individual CoT and PoT distilled models. |
TinyChart: Efficient Chart Understanding with Program-of-Thoughts Learning and Visual Token Merging (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have shown that multimodal large language models can be useful for chart understanding, but their size limits their use in resource-constrained environments. |
| Approach: | They propose an efficient multimodal large language model with only 3B parameters for chart understanding. |
| Outcome: | The proposed model outperforms several chart-understanding MLLMs with up to 13B parameters on ChartQA, Chart-to-Text, Chart to Table, OpenCQA, and ChartX. |
Program-of-Thought Reveals LLM Abstraction Ceilings (2026.findings-eacl)
Copied to clipboard
| Challenge: | Large language models exhibit reasoning ability when supervised with chain-of-thought (CoT) traces. |
| Approach: | They evaluate large language models with CoT traces and fine-tune them with Program-of-Thought supervision. |
| Outcome: | The proposed model performance degrades sharply under numeric perturbations under isomorphic variants. |
How Do Humans Write Code? Large Models Do It the Same Way Too (2024.emnlp-main)
Copied to clipboard
| Challenge: | Program-of-Thought (PoT) replaces natural language-based Chain-ofThough (CoT) but introduces more reasoning errors, such as incorrect formulas or flawed logic, compared to CoT. |
| Approach: | They propose a method that integrates CoT and Program-of-Thought to achieve more accurate reasoning and reinforcement learning. |
| Outcome: | The proposed method achieves an average improvement of 6.5% on the Llama-Base model and 4.3% on the Mistral-Bass model across 8 mathematical calculation datasets. |
Python is Not Always the Best Choice: Embracing Multilingual Program of Thoughts (2024.emnlp-main)
Copied to clipboard
Xianzhen Luo, Qingfu Zhu, Zhiming Zhang, Libo Qin, Xuanyu Zhang, Qing Yang, Dongliang Xu, Wanxiang Che
| Challenge: | Program of Thoughts (PoT) is an approach characterized by its executable intermediate steps, which ensure the accuracy of the logical calculations in the reasoning process. |
| Approach: | They propose a task and model agnostic approach which harnesses strength and diversity from various languages to achieve better performance across all tasks. |
| Outcome: | The proposed approach outperforms Python Self-Consistency in almost all tasks and models and achieves comparable or superior performance on ChatGPT. |
FinanceReasoning: Benchmarking Financial Numerical Reasoning More Credible, Comprehensive and Challenging (2025.acl-long)
Copied to clipboard
Zichen Tang, Haihong E, Ziyan Ma, Haoyang He, Jiacheng Liu, Zhongjun Yang, Zihua Rong, Rongjin Li, Kun Ji, Qing Huang, Xinyang Hu, Yang Liu, Qianhe Zheng
| Challenge: | Compared to existing benchmarks, FinanceReasoning provides three key advancements: (1) credibility; (2) comprehensiveness; (3) numerical precision; (4) complexity; (5) complexity; and (6) complexity. |
| Approach: | They propose a benchmark to evaluate the reasoning capabilities of large reasoning models (LRMs) in financial numerical reasoning problems. |
| Outcome: | The proposed benchmark exceeds existing benchmarks in 67.8% of financial concepts and formulas and is credible, comprehensive, and challenging. |
Towards Better Understanding of Program-of-Thought Reasoning in Cross-Lingual and Multilingual Environments (2025.findings-acl)
Copied to clipboard
Patomporn Payoungkhamdee, Pume Tuchinda, Jinheon Baek, Samuel Cahyawijaya, Can Udomcharoenchaikit, Potsawee Manakul, Peerat Limkonchotiwat, Ekapol Chuangsuwanich, Sarana Nutanong
| Challenge: | Multi-step reasoning is essential for large language models, yet multilingual performance remains challenging. |
| Approach: | They propose a framework to evaluate Program-of-Thought (PoT) prompting by separating multilingual reasoning from code execution to examine impact of fine-tuning on question-reasoning alignment and reasoning quality. |
| Outcome: | The proposed framework outperforms CoT fine-tuned models in multilingual settings and shows strong correlation between reasoning quality and answer accuracy. |
Do Large Language Models excel in Complex Logical Reasoning with Formal Language? (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies on LLMs have focused on formal language, but evaluations of their performance are limited. |
| Approach: | They propose to use a formal language to evaluate LLMs across logical reasoning problems using formal languages. |
| Outcome: | The proposed model outperforms Instruct models in three dimensions, taxonomy of tasks, and format of trajectories, and achieves the best generalization performance across other languages. |
Language Models as Compilers: Simulating Pseudocode Execution Improves Algorithmic Reasoning in Language Models (2024.emnlp-main)
Copied to clipboard
Hyungjoo Chae, Yeonghyeon Kim, Seungone Kim, Kai Ong, Beong-woo Kwak, Moohyeon Kim, Sunghwan Kim, Taeyoon Kwon, Jiwan Chung, Youngjae Yu, Jinyoung Yeo
| Challenge: | Prior work has used LLMs to generate programming language and applied external compilers for such tasks. |
| Approach: | They propose a framework that expresses task-level logic with pseudocode and tailors it to each instance and simulates execution of it. |
| Outcome: | The proposed framework outperforms baselines in diverse reasoning tasks. |
Table-R1: Region-based Reinforcement Learning for Table Understanding (2026.findings-acl)
Copied to clipboard
Zhenhe Wu, Jian Yang, Zhongjiang He, Changzai Pan, Jiaheng Liu, Xianjie Wu, Yu Zhao, Shuangyong Song, Yongxiang Li, Zhoujun Li, Xuelong Li
| Challenge: | Tables are a widely used data format that poses unique challenges for language models due to their structured row-column interactions. |
| Approach: | They propose a region-based reinforcement learning approach that integrates region evidence into reasoning steps. |
| Outcome: | The proposed method outperforms baseline models on three benchmark datasets and significantly reduces the reasoning token consumption by 67.5%. |
VET: Verifiable Execution Tracing for Reliable Text-to-SQL Generation (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for text-to-SQL generation are prone to hallucinations and grounding . authors present a novel reasoning paradigm that transforms text- to-Sql from unverifiable textual rationales into step-wise executable semantics. |
| Approach: | They propose a reasoning paradigm that transforms text-to-SQL from unverifiable textual rationales into step-wise executable semantics. |
| Outcome: | The proposed reasoning paradigm transforms text-to-SQL from unverifiable textual rationales into step-wise executable semantics. |
Self-Consistency from Only Two Samples: CoT–PoT Ensembling for Efficient LLM Reasoning (2026.findings-acl)
Copied to clipboard
| Challenge: | Self-consistency (SC) is a popular technique for improving the reasoning accuracy of large language models but it comes at a high computational cost due to extensive sampling. |
| Approach: | They propose a hybrid ensembling approach that leverages the complementary strengths of Chain-of-Thought and Program-of -Thus . they propose encapsulating two different modes of reasoning to create a single output and a final answer is selected as the most frequently occurring one among these outputs. |
| Outcome: | The proposed approach reduces the number of samples required for SC by 9.3x . the majority of tasks can be addressed with only two samples, which has not been possible with prior methods. |