English
Related papers

Related papers: SCOPE: Compress Mathematical Reasoning Steps for E…

200 papers

Synthetic high-quality multi-step reasoning data can significantly enhance the performance of large language models on various tasks. However, most existing methods rely on rejection sampling, which generates trajectories independently and…

Computation and Language · Computer Science 2025-07-22 Peiji Li , Kai Lv , Yunfan Shao , Yichuan Ma , Linyang Li , Xiaoqing Zheng , Xipeng Qiu , Qipeng Guo

Process supervision, i.e., evaluating each step, is critical for complex large language model (LLM) reasoning and test-time searching with increased inference compute. Existing approaches, represented by process reward models (PRMs),…

Computation and Language · Computer Science 2025-03-07 Wenxiang Chen , Wei He , Zhiheng Xi , Honglin Guo , Boyang Hong , Jiazheng Zhang , Rui Zheng , Nijun Li , Tao Gui , Yun Li , Qi Zhang , Xuanjing Huang

Pre-trained language models have shown excellent results in few-shot learning scenarios using in-context learning. Although it is impressive, the size of language models can be prohibitive to make them usable in on-device applications, such…

Computation and Language · Computer Science 2022-04-27 Navid Rezaei , Marek Z. Reformat

The field of Language Reasoning Models (LRMs) has been very active over the past few years with advances in training and inference techniques enabling LRMs to reason longer, and more accurately. However, a growing body of studies show that…

Computation and Language · Computer Science 2025-12-17 Yannis Belkhiter , Seshu Tirupathi , Giulio Zizzo , John D. Kelleher

Process Reinforcement Learning~(PRL) has demonstrated considerable potential in enhancing the reasoning capabilities of Large Language Models~(LLMs). However, introducing additional process reward models incurs substantial computational…

Machine Learning · Computer Science 2025-07-04 Wu Fei , Hao Kong , Shuxian Liang , Yang Lin , Yibo Yang , Jing Tang , Lei Chen , Xiansheng Hua

This paper presents a new annotation method called Sparse Annotation (SA) for crowd counting, which reduces human labeling efforts by sparsely labeling individuals in an image. We argue that sparse labeling can reduce the redundancy of full…

Computer Vision and Pattern Recognition · Computer Science 2023-04-13 Shiwei Zhang , Zhengzheng Wang , Qing Liu , Fei Wang , Wei Ke , Tong Zhang

Recent research has shown that rationales, or step-by-step chains of thought, can be used to improve performance in multi-step reasoning tasks. We reconsider rationale-augmented prompting for few-shot in-context learning, where (input ->…

Computation and Language · Computer Science 2022-07-05 Xuezhi Wang , Jason Wei , Dale Schuurmans , Quoc Le , Ed Chi , Denny Zhou

Large Language Models (LLMs) have shown remarkable reasoning capabilities through Reinforcement Learning with Verifiable Rewards (RLVR) methods. However, a key limitation of existing approaches is that rewards defined at the full trajectory…

Machine Learning · Computer Science 2025-09-30 Zhicheng Yang , Zhijiang Guo , Yinya Huang , Xiaodan Liang , Yiwei Wang , Jing Tang

Prompting is a mainstream paradigm for adapting large language models to specific natural language processing tasks without modifying internal parameters. Therefore, detailed supplementary knowledge needs to be integrated into external…

Computation and Language · Computer Science 2024-12-03 Kaiyan Chang , Songcheng Xu , Chenglong Wang , Yingfeng Luo , Xiaoqian Liu , Tong Xiao , Jingbo Zhu

We propose Process-Aware Policy Optimization (PAPO), a method that integrates process-level evaluation into Group Relative Policy Optimization (GRPO) through decoupled advantage normalization, to address two limitations of existing reward…

Artificial Intelligence · Computer Science 2026-04-06 Zelin Tan , Zhouliang Yu , Bohan Lin , Zijie Geng , Hejia Geng , Yudong Zhang , Mulei Zhang , Yang Chen , Shuyue Hu , Zhenfei Yin , Chen Zhang , Lei Bai

Predictive state representations (PSRs) offer an expressive framework for modelling partially observable systems. By compactly representing systems as functions of observable quantities, the PSR learning approach avoids using local-minima…

Machine Learning · Computer Science 2014-07-22 William L. Hamilton , Mahdi Milani Fard , Joelle Pineau

Prompt-based methods have recently gained prominence in Continual Learning (CL) due to their strong performance and memory efficiency. A prevalent strategy in this paradigm assigns a dedicated subset of prompts to each task, which, while…

Machine Learning · Computer Science 2026-03-12 Minh Le , Bao-Ngoc Dao , Huy Nguyen , Quyen Tran , Anh Nguyen , Nhat Ho

Language models can use verifiable rewards to improve at a wide variety of reasoning tasks. However, both parametric (e.g. RLVR) and non-parametric (e.g. prompt optimization) approaches to doing so typically require hundreds of training…

Artificial Intelligence · Computer Science 2026-05-28 Linas Nasvytis , Simon Jerome Han , Ben Prystawski , Satchel Grant , Noah D. Goodman , Judith E. Fan

Recent advancements in large language models (LLMs) have enabled their successful application to a broad range of tasks. However, in information-intensive tasks, the prompt length can grow fast, leading to increased computational…

Computation and Language · Computer Science 2025-10-13 Weronika Łajewska , Momchil Hardalov , Laura Aina , Neha Anna John , Hang Su , Lluís Màrquez

Large Language Models (LLMs) deliver powerful reasoning and generation capabilities but incur substantial run-time costs when operating in agentic workflows that chain together lengthy prompts and process rich data streams. We introduce…

Artificial Intelligence · Computer Science 2025-10-22 Joong Ho Choi , Jiayang Zhao , Jeel Shah , Ritvika Sonawane , Vedant Singh , Avani Appalla , Will Flanagan , Filipe Condessa

Large reasoning models (LRMs) typically solve reasoning-intensive tasks by generating long chain-of-thought (CoT) traces, leading to substantial inference overhead. We identify a reproducible inference-time phenomenon, termed…

Computation and Language · Computer Science 2026-02-03 Jie Deng , Shining Liang , Jun Li , Hongzhi Li , Yutao Xie

Offline imitation learning (offline IL) enables training effective policies without requiring explicit reward annotations. Recent approaches attempt to estimate rewards for unlabeled datasets using a small set of expert demonstrations.…

Machine Learning · Computer Science 2025-11-19 Shengjie Sun , Jiafei Lyu , Runze Liu , Mengbei Yan , Bo Liu , Deheng Ye , Xiu Li

Prompt engineering enables Large Language Models (LLMs) to perform a variety of tasks. However, lengthy prompts significantly increase computational complexity and economic costs. To address this issue, we study six prompt compression…

Computation and Language · Computer Science 2025-05-02 Zheng Zhang , Jinyi Li , Yihuai Lan , Xiang Wang , Hao Wang

Data annotated by humans is a source of knowledge by describing the peculiarities of the problem and therefore fueling the decision process of the trained model. Unfortunately, the annotation process for subjective natural language…

Computation and Language · Computer Science 2023-12-14 Kamil Kanclerz , Julita Bielaniewicz , Marcin Gruza , Jan Kocon , Stanisław Woźniak , Przemysław Kazienko

Reasoning in knowledge-intensive domains remains challenging as intermediate steps are often not locally verifiable: unlike math or code, evaluating step correctness may require synthesizing clues across large external knowledge sources. As…

Artificial Intelligence · Computer Science 2026-04-13 Jiwoong Sohn , Tomasz Sternal , Kenneth Styppa , Torsten Hoefler , Michael Moor