English
Related papers

Related papers: Rewarding Structural Conformance of Reasoning usin…

200 papers

Step-by-step verifiers -- also known as process reward models (PRMs) -- are a key ingredient for test-time scaling. PRMs require step-level supervision, making them expensive to train. This work aims to build data-efficient PRMs as…

Machine Learning · Computer Science 2025-12-09 Muhammad Khalifa , Rishabh Agarwal , Lajanugen Logeswaran , Jaekyeom Kim , Hao Peng , Moontae Lee , Honglak Lee , Lu Wang

Large language models (LLMs) increasingly rely on thinking models that externalize intermediate steps and allocate extra test-time compute, with think-twice strategies showing that a deliberate second pass can elicit stronger reasoning. In…

Computation and Language · Computer Science 2026-01-30 Yizhu Jiao , Jiaqi Zeng , Julien Veron Vialard , Oleksii Kuchaiev , Jiawei Han , Olivier Delalleau

Multimodal sarcasm detection requires resolving pragmatic incongruity across textual, acoustic, and visual cues through cross-modal reasoning. To enable robust sarcasm reasoning with foundation models, we propose SarcasmMiner, a…

Multimedia · Computer Science 2026-03-06 Zhu Li , Yongjian Chen , Huiyuan Lai , Xiyuan Gao , Shekhar Nayak , Matt Coler

Human reasoning is shaped by resource rationality -- optimizing performance under constraints. Recently, inference-time scaling has emerged as a powerful paradigm to improve the reasoning performance of Large Language Models by expanding…

Computation and Language · Computer Science 2026-02-12 Zhimin Hu , Riya Roshan , Sashank Varma

Process Reward Models (PRMs) have emerged as a powerful tool for providing step-level feedback when evaluating the reasoning of Large Language Models (LLMs), which frequently produce chains of thought (CoTs) containing errors even when the…

Computation and Language · Computer Science 2026-04-21 Raffaele Pisano , Roberto Navigli

Reinforcement Learning (RL) serves as a potent paradigm for enhancing reasoning capabilities in Large Language Models (LLMs), yet standard outcome-based approaches often suffer from reward sparsity and inefficient credit assignment. In this…

Artificial Intelligence · Computer Science 2026-02-03 Xiangwei Wang , Wei Wang , Ken Chen , Nanduni Nimalsiri , Saman Halgamuge

Enhancing the mathematical reasoning capabilities of Large Language Models (LLMs) is of great scientific and practical significance. Researchers typically employ process-supervised reward models (PRMs) to guide the reasoning process,…

Computation and Language · Computer Science 2025-07-24 Wei Sun , Qianlong Du , Fuwei Cui , Jiajun Zhang

Policy gradient methods, which have been extensively studied in the last decade, offer an effective and efficient framework for reinforcement learning problems. However, their performances can often be unsatisfactory, suffering from…

Machine Learning · Computer Science 2026-01-27 Shihab Ahmed , El Houcine Bergou , Aritra Dutta , Yue Wang

Test-time scaling improves the reasoning performance of large language models but often results in token-inefficient overthinking, where models continue reasoning beyond what is necessary for a correct answer. Existing dynamic early-exit…

Artificial Intelligence · Computer Science 2026-04-21 Jiakun Li , Xingwei He , Kefan Li , Hongzheng Chai , Hongyue Yu , Yuan Yuan

Fine-tuned large language models can exhibit reward-hacking behavior arising from emergent misalignment, which is difficult to detect from final outputs alone. While prior work has studied reward hacking at the level of completed responses,…

Computation and Language · Computer Science 2026-03-05 Patrick Wilhelm , Thorsten Wittkopp , Odej Kao

Generative Reward Models (GRMs) provide greater flexibility than scalar reward models in capturing human preferences, but their effectiveness is limited by poor reasoning capabilities. This often results in incomplete or overly speculative…

Computation and Language · Computer Science 2025-06-23 Bin Chen , Xinzge Gao , Chuanrui Hu , Penghang Yu , Hua Zhang , Bing-Kun Bao

When language models (LMs) are trained via reinforcement learning (RL) to generate natural language "reasoning chains", their performance improves on a variety of difficult question answering tasks. Today, almost all successful applications…

Machine Learning · Computer Science 2026-05-18 Mehul Damani , Isha Puri , Stewart Slocum , Idan Shenfeld , Leshem Choshen , Yoon Kim , Jacob Andreas

Process Reward Models (PRMs) are crucial in complex reasoning and problem-solving tasks (e.g., LLM agents with long-horizon decision-making) by verifying the correctness of each intermediate reasoning step. In real-world scenarios, LLMs may…

Artificial Intelligence · Computer Science 2025-05-30 Xiang Li , Haiyang Yu , Xinghua Zhang , Ziyang Huang , Shizhu He , Kang Liu , Jun Zhao , Fei Huang , Yongbin Li

Large language models excel on static benchmarks, but their ability as self-learning agents in dynamic environments remains unclear. We evaluate three prompting strategies: self-reflection, heuristic mutation, and planning across dynamic…

Artificial Intelligence · Computer Science 2025-08-12 Annie Wong , Thomas Bäck , Aske Plaat , Niki van Stein , Anna V. Kononova

Large Reasoning Models (LRMs) have shown remarkable capabilities in solving complex problems through reinforcement learning (RL), particularly by generating long reasoning traces. However, these extended outputs often exhibit substantial…

Computation and Language · Computer Science 2025-05-22 Wei Liu , Ruochen Zhou , Yiyun Deng , Yuzhen Huang , Junteng Liu , Yuntian Deng , Yizhe Zhang , Junxian He

Reasoning models enhance performance by tackling problems in a step-by-step manner, decomposing them into sub-problems and exploring long chains of thought before producing an answer. However, applying extended reasoning to every step…

Artificial Intelligence · Computer Science 2025-10-08 Haiquan Lu , Gongfan Fang , Xinyin Ma , Qi Li , Xinchao Wang

Process Reward Models (PRMs) have shown promise in enhancing the mathematical reasoning capabilities of Large Language Models (LLMs) through Test-Time Scaling (TTS). However, their integration into multimodal reasoning remains largely…

Computation and Language · Computer Science 2025-10-07 Ruilin Luo , Zhuofan Zheng , Yifan Wang , Xinzhe Ni , Zicheng Lin , Songtao Jiang , Yiyao Yu , Chufan Shi , Lei Wang , Ruihang Chu , Jin Zeng , Yujiu Yang

While Multimodal Large Language Models (MLLMs) have achieved impressive progress in vision-language understanding, they still struggle with complex multi-step reasoning, often producing logically inconsistent or partially correct solutions.…

Artificial Intelligence · Computer Science 2025-06-06 Lingxiao Du , Fanqing Meng , Zongkai Liu , Zhixiang Zhou , Ping Luo , Qiaosheng Zhang , Wenqi Shao

Despite recent successes, test-time scaling - i.e., dynamically expanding the token budget during inference as needed - remains brittle for vision-language models (VLMs): unstructured chains-of-thought about images entangle perception and…

Computer Vision and Pattern Recognition · Computer Science 2026-02-11 Niccolo Avogaro , Nayanika Debnath , Li Mi , Thomas Frick , Junling Wang , Zexue He , Hang Hua , Konrad Schindler , Mattia Rigotti

Large language models (LLMs) have recently demonstrated impressive performance on complex, multi-step reasoning tasks, especially when post-trained with outcome-rewarded reinforcement learning Guo et al. 2025. However, it has been observed…

Artificial Intelligence · Computer Science 2026-04-01 Luoxin Chen , Yichi Zhou , Huishuai Zhang