English
Related papers

Related papers: CORE: Contrastive Reflection Enables Rapid Improve…

200 papers

Multi-hop reasoning, which requires multi-step reasoning based on the supporting documents within a given context, remains challenging for large language models (LLMs). LLMs often struggle to filter out irrelevant documents within the…

Computation and Language · Computer Science 2025-04-30 Sangwon Yu , Ik-hwan Kim , Jongyoon Song , Saehyung Lee , Junsung Park , Sungroh Yoon

Reliable mathematical and scientific reasoning remains an open challenge for large vision-language models. Standard final-answer evaluation often masks reasoning errors, allowing silent failures to persist. To address this gap, we introduce…

Artificial Intelligence · Computer Science 2025-12-15 Shima Imani , Seungwhan Moon , Lambert Mathias , Lu Zhang , Babak Damavandi

Vision-Language Models (VLMs) struggle to translate high-level instructions into the precise spatial affordances required for robotic manipulation. While visual Chain-of-Thought (CoT) methods exist, they are often computationally intensive.…

Robotics · Computer Science 2025-11-05 Sangyun Park , Jin Kim , Yuchen Cui , Matthew S. Brown

Training on verifiable symbolic data is a promising way to expand the reasoning frontier of language models beyond what standard pre-training corpora provide. Yet existing procedural generators often rely on fixed puzzles or templates and…

Computation and Language · Computer Science 2026-03-03 Valentin Lacombe , Valentin Quesnel , Damien Sileo

Self-correction is a highly desirable capability of large language models (LLMs), yet it has consistently been found to be largely ineffective in modern LLMs. Current methods for training self-correction typically depend on either multiple…

Large-scale pre-trained language models (PLMs) bring new opportunities to challenging problems, especially those that need high-level intelligence, such as the math word problem (MWPs). However, directly applying existing PLMs to MWPs can…

Computation and Language · Computer Science 2024-01-01 Xinyu Zhu , Junjie Wang , Lin Zhang , Yuxiang Zhang , Ruyi Gan , Jiaxing Zhang , Yujiu Yang

Reward models (RMs) are fundamental to aligning Large Language Models (LLMs) via human feedback, yet they often suffer from reward hacking. They tend to latch on to superficial or spurious attributes, such as response length or formatting,…

Reinforcement learning with verifiable rewards (RLVR) has proven effective in enhancing the reasoning of large language models (LLMs). Monte Carlo Tree Search (MCTS)-based extensions improve upon vanilla RLVR (e.g., GRPO) by providing…

Artificial Intelligence · Computer Science 2026-04-21 Ziqi Zhao , Zhaochun Ren , Jiahong Zou , Liu Yang , Zhiwei Xu , Xuri Ge , Zhumin Chen , Xinyu Ma , Daiting Shi , Shuaiqiang Wang , Dawei Yin , Xin Xin

Retrieving fine-grained visual content based on user intent remains a challenge in multi-modal systems. Although current Composed Image Retrieval (CIR) methods combine reference images with retrieval texts, they are constrained to…

Computer Vision and Pattern Recognition · Computer Science 2025-11-24 Tong Wang , Guanyu Yang , Nian Liu , Zongyan Han , Jinxing Zhou , Salman Khan , Fahad Shahbaz Khan

Instruction-driven image editing with unified multimodal generative models has advanced rapidly, yet their underlying visual reasoning remains limited, leading to suboptimal performance on reasoning-centric edits. Reinforcement learning…

Computer Vision and Pattern Recognition · Computer Science 2026-02-27 Hengjia Li , Liming Jiang , Qing Yan , Yizhi Song , Hao Kang , Zichuan Liu , Xin Lu , Boxi Wu , Deng Cai

Scaling inference-time computation has substantially improved the reasoning capabilities of language models. However, existing methods have significant limitations: serialized chain-of-thought approaches generate overly long outputs,…

Artificial Intelligence · Computer Science 2025-08-19 Jiayi Pan , Xiuyu Li , Long Lian , Charlie Snell , Yifei Zhou , Adam Yala , Trevor Darrell , Kurt Keutzer , Alane Suhr

Speculative decoding is a powerful technique that accelerates Large Language Model (LLM) inference by leveraging a lightweight speculative draft model. However, existing designs suffers in performance due to misalignment between training…

Computation and Language · Computer Science 2025-05-27 Yepeng Weng , Dianwen Mei , Huishi Qiu , Xujie Chen , Li Liu , Jiang Tian , Zhongchao Shi

Self-reflection -- the ability of a large language model (LLM) to revisit, evaluate, and revise its own reasoning -- has recently emerged as a powerful behavior enabled by reinforcement learning with verifiable rewards (RLVR). While…

Machine Learning · Computer Science 2025-06-17 Xudong Zhu , Jiachen Jiang , Mohammad Mahdi Khalili , Zhihui Zhu

Recent advancements in large language models (LLMs) have been driven by their emergent reasoning capabilities, particularly through long chain-of-thought (CoT) prompting, which enables thorough exploration and deliberation. Despite these…

Computation and Language · Computer Science 2026-04-09 Junnan Liu , Hongwei Liu , Songyang Zhang , Kai Chen

Reinforcement learning with verifiable rewards (RLVR) is a promising approach for training language models (LMs) on reasoning tasks that elicit emergent long chains of thought (CoTs). Unlike supervised learning, it updates the model using…

Computation and Language · Computer Science 2025-10-28 Xinyu Zhu , Mengzhou Xia , Zhepei Wei , Wei-Lin Chen , Danqi Chen , Yu Meng

Logical reasoning is a pivotal component in the field of artificial intelligence. Proof planning, particularly in contexts requiring the validation of explanation accuracy, continues to present challenges. The recent advancement of large…

Computation and Language · Computer Science 2025-10-31 Ying Su , Mingwen Liu , Zhijiang Guo

Large reasoning models (LRMs) excel on complex problems but face a critical barrier to efficiency: reinforcement learning (RL) training requires long rollouts for outcome-based rewards, where autoregressive decoding dominates time and…

Machine Learning · Computer Science 2026-02-20 Zeliang Zhang , Xiaodong Liu , Hao Cheng , Hao Sun , Chenliang Xu , Jianfeng Gao

Controlled automated story generation seeks to generate natural language stories satisfying constraints from natural language critiques or preferences. Existing methods to control for story preference utilize prompt engineering which is…

Computation and Language · Computer Science 2022-12-16 Louis Castricato , Alexander Havrilla , Shahbuland Matiana , Michael Pieler , Anbang Ye , Ian Yang , Spencer Frazier , Mark Riedl

Reinforcement Learning with Verifiable Rewards (RLVR) improves reasoning in large language models but treats all correct solutions equally, potentially reinforcing flawed traces that get correct answers by chance. We observe that better…

Machine Learning · Computer Science 2026-03-11 Tiehua Mei , Minxuan Lv , Leiyu Pan , Zhenpeng Su , Hongru Hou , Hengrui Chen , Ao Xu , Deqing Yang

Typical evaluations of Large Language Models (LLMs) report a single metric per dataset, often representing the model's best-case performance under carefully selected settings. Unfortunately, this approach overlooks model robustness and…

Computation and Language · Computer Science 2025-03-04 Grigor Nalbandyan , Rima Shahbazyan , Evelina Bakhturina