English
Related papers

Related papers: Stop Rewarding Hallucinated Steps: Faithfulness-Aw…

200 papers

Large Reasoning Models (LRMs) demonstrate strong performance in complex tasks but often face the challenge of overthinking, leading to substantially high inference costs. Existing approaches synthesize shorter reasoning responses for LRMs…

Computation and Language · Computer Science 2026-03-02 Hexuan Deng , Wenxiang Jiao , Xuebo Liu , Jun Rao , Min Zhang

Chain-of-thought (CoT) reasoning has emerged as a powerful tool for improving large language model performance on complex tasks, but recent work shows that reasoning steps often fail to causally influence the final answer, creating brittle…

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

Reinforcement learning with verifiable rewards (RLVR) has emerged as a promising paradigm for advancing complex reasoning in large language models, and recent work extends RLVR to multimodal large language models (MLLMs). This transfer,…

Computation and Language · Computer Science 2026-05-22 Changyuan Tian , Zhicong Lu , Huaxing Liu , Xiang Wang , Shuai Li , Yu Chen , Wenqian Lv , Zichuan Lin , Juncheng Diao , Deheng Ye

Although contemporary large language models (LMs) demonstrate impressive question-answering capabilities, their answers are typically the product of a single call to the model. This entails an unwelcome degree of opacity and compromises…

Artificial Intelligence · Computer Science 2022-08-31 Antonia Creswell , Murray Shanahan

Reinforcement learning (RL) has become a standard paradigm for refining large language models (LLMs) beyond pre-training and instruction tuning. A prominent line of work is RL with verifiable rewards (RLVR), which leverages automatically…

Machine Learning · Computer Science 2025-09-23 Bonan Zhang , Zhongqi Chen , Bowen Song , Qinya Li , Fan Wu , Guihai Chen

Existing large language models (LLMs) face challenges of following complex instructions, especially when multiple constraints are present and organized in paralleling, chaining, and branching structures. One intuitive solution, namely…

Computer Vision and Pattern Recognition · Computer Science 2025-10-01 Yulei Qin , Gang Li , Zongyi Li , Zihan Xu , Yuchen Shi , Zhekai Lin , Xiao Cui , Ke Li , Xing Sun

Reinforcement Learning with Verifiable Rewards (RLVR) is widely used to improve reasoning in large language models, but rewards only final-answer correctness with no supervision over intermediate steps. Rubric-based methods such as Rubrics…

While Chain-of-Thought (CoT) prompting boosts Language Models' (LM) performance on a gamut of complex reasoning tasks, the generated reasoning chain does not necessarily reflect how the model arrives at the answer (aka. faithfulness). We…

Computation and Language · Computer Science 2023-09-22 Qing Lyu , Shreya Havaldar , Adam Stein , Li Zhang , Delip Rao , Eric Wong , Marianna Apidianaki , Chris Callison-Burch

Chain-of-thought (CoT) reasoning is useful for monitoring language models only when the reasoning trace faithfully reflects the computation that produces the final answer. However, models can rely on prompt-to-answer shortcuts that bypass…

Machine Learning · Computer Science 2026-05-26 Jinghan Jia , Joe Benton , Eric Easley

Large language models (LLMs) often generate hallucinations -- unsupported content that undermines reliability. While most prior works frame hallucination detection as a binary task, many real-world applications require identifying…

Reinforcement learning has recently improved the reasoning ability of Large Language Models and Multimodal LLMs, yet prevailing reward designs emphasise final-answer correctness and consequently tolerate process hallucinations--cases where…

Computer Vision and Pattern Recognition · Computer Science 2026-03-10 Yantao Li , Qiang Hui , Chenyang Yan , Kanzhi Cheng , Fang Zhao , Chao Tan , Huanling Gao , Jianbing Zhang , Kai Wang , Xinyu Dai , Shiguo Lian

Recent work on reinforcement learning with verifiable rewards (RLVR) has shown that large language models (LLMs) can be substantially improved using outcome-level verification signals, such as unit tests for code or exact-match checks for…

Computation and Language · Computer Science 2026-01-27 Massimiliano Pronesti , Anya Belz , Yufang Hou

Through reinforcement learning with verifiable rewards (RLVR), large language models have achieved substantial progress in domains with easily verifiable outcomes, such as mathematics and coding. However, when applied to more complex tasks…

Computation and Language · Computer Science 2025-10-01 Qiyao Ma , Yunsheng Shi , Hongtao Tian , Chao Wang , Weiming Chang , Ting Yao

Large reasoning models (LRMs) extend large language models by generating explicit chain-of-thought (CoT) reasoning, significantly improving mathematical and logical problem solving. However, this explicit reasoning process also introduces…

Computation and Language · Computer Science 2025-12-02 Jinghan Jia , Nathalie Baracaldo , Sijia Liu

Multimodal Large Language Models (MLLMs) frequently suffer from unfaithfulness, generating reasoning chains that drift from visual evidence or contradict final predictions. We propose Faithful-First Reasoning, Planning, and Acting (RPA)…

Artificial Intelligence · Computer Science 2026-04-09 Junxian Li , Xinyue Xu , Sai Ma , Di Zhang , Sichao Li

While reinforcement learning has unlocked unprecedented complex reasoning in large language models, it has also amplified their propensity for hallucination, creating a critical trade-off between capability and reliability. This work…

Computation and Language · Computer Science 2025-12-11 Yudong Wang , Zhe Yang , Wenhan Ma , Zhifang Sui , Liang Zhao

Aligning Large Language Models (LLMs) to be faithful to new knowledge in complex, multi-hop reasoning tasks is a critical, yet unsolved, challenge. We find that SFT-based methods, e.g., Reason-KE, while state-of-the-art, suffer from a…

Computation and Language · Computer Science 2025-11-18 Yuchen Wu , Liang Ding , Li Shen , Dacheng Tao

Large Language Models (LLMs) often struggle with problems that require multi-step reasoning. For small-scale open-source models, Reinforcement Learning with Verifiable Rewards (RLVR) fails when correct solutions are rarely sampled even…

Computation and Language · Computer Science 2026-03-02 Yihe Deng , I-Hung Hsu , Jun Yan , Zifeng Wang , Rujun Han , Gufeng Zhang , Yanfei Chen , Wei Wang , Tomas Pfister , Chen-Yu Lee

Reinforcement Learning with Verifiable Rewards (RLVR) elicits long chain-of-thought reasoning in large language models (LLMs), but outcome-based rewards lead to coarse-grained advantage estimation. While existing approaches improve RLVR via…

Computation and Language · Computer Science 2026-01-08 Fei Wu , Zhenrong Zhang , Qikai Chang , Jianshu Zhang , Quan Liu , Jun Du