English
Related papers

Related papers: Ada-RS: Adaptive Rejection Sampling for Selective …

200 papers

Large Language Models (LLMs) can adapt to new tasks via in-context learning (ICL). ICL is efficient as it does not require any parameter updates to the trained LLM, but only few annotated examples as input for the LLM. In this work, we…

Large language models (LLMs) benefit from test-time scaling but are often hampered by high inference latency. Speculative decoding is a natural way to accelerate the scaling process; however, scaling along both the parallel and sequential…

Recent large reasoning models (LRMs) have made substantial progress in complex reasoning tasks, yet they often generate lengthy reasoning paths for every query, incurring unnecessary computation and latency. Existing speed-up approaches…

Computation and Language · Computer Science 2026-01-08 Zhaofeng Zhong , Wei Yuan , Tong Chen , Xiangyu Zhao , Quoc Viet Hung Nguyen , Hongzhi Yin

Aligning large language models (LLMs) depends on high-quality datasets of human preference labels, which are costly to collect. Although active learning has been studied to improve sample efficiency relative to passive collection, many…

Machine Learning · Computer Science 2026-02-03 Yao Zhao , Kwang-Sung Jun

Large Language Models have shown remarkable capabilities in the NLP domain. Their effectiveness can mainly be attributed to their ability to adapt to an array of downstream tasks. However, generally, full fine-tuning is a computationally…

Computation and Language · Computer Science 2025-06-10 Harsh Bihany , Shubham Patel , Ashutosh Modi

This paper revisits the temporal difference (TD) learning algorithm for the policy evaluation tasks in reinforcement learning. Typically, the performance of TD(0) and TD($\lambda$) is very sensitive to the choice of stepsizes. Oftentimes,…

Optimization and Control · Mathematics 2021-10-12 Tao Sun , Han Shen , Tianyi Chen , Dongsheng Li

While Reinforcement Learning (RL) shows promise in training tool-use Large Language Models (LLMs) using verifiable outcome rewards, existing methods largely overlook the potential of reasoning rewards based on chain-of-thought quality for…

Computation and Language · Computer Science 2026-01-16 Zihan Lin , Xiaohan Wang , Hexiong Yang , Jiajun Chai , Jie Cao , Guojun Yin , Wei Lin , Ran He

Learning in the combinatorially large output space of sequence generation problems is challenging as providing expert demonstrations scales poorly with sequence length, and RL struggles with sparse rewards. Between dense demonstrations in…

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

Large language models (LLMs) excel in complex tasks through advanced prompting techniques like Chain-of-Thought (CoT) and Tree-of-Thought (ToT), but their reliance on manually crafted, task-specific prompts limits adaptability and…

Computation and Language · Computer Science 2025-07-04 Tao Xiong , Xavier Hu , Wenyan Fan , Shengyu Zhang

Inference-time computation is a powerful paradigm to enhance the performance of large language models (LLMs), with Best-of-N sampling being a widely used technique. However, this method is computationally expensive, requiring both (1) an…

Computation and Language · Computer Science 2024-10-04 Rohin Manvi , Anikait Singh , Stefano Ermon

The dominant approach to generating from language models subject to some constraint is locally constrained decoding (LCD), incrementally sampling tokens at each time step such that the constraint is never violated. Typically, this is…

When aligning large language models (LLMs), their performance on various tasks (such as being helpful, harmless, and honest) depends heavily on the composition of their training data. However, selecting a data mixture that achieves strong…

Machine Learning · Computer Science 2025-06-03 Nicholas E. Corrado , Julian Katz-Samuels , Adithya Devraj , Hyokun Yun , Chao Zhang , Yi Xu , Yi Pan , Bing Yin , Trishul Chilimbi

Recent advances in reasoning with large language models (LLMs) have demonstrated strong performance on complex mathematical tasks, including combinatorial optimization. Techniques such as Chain-of-Thought and In-Context Learning have…

Artificial Intelligence · Computer Science 2025-09-17 Marylou Fauchard , Florian Carichon , Margarida Carvalho , Golnoosh Farnadi

Self-evaluation, a model's ability to assess the correctness of its own output, is crucial for Large Multimodal Models (LMMs) to achieve self-improvement in multi-turn conversations, yet largely absent in foundation models. Recent work has…

Machine Learning · Computer Science 2025-08-14 Wenkai Wang , Hongcan Guo , Zheqi Lv , Shengyu Zhang

Recent advances in large language models (LLMs) have popularized test-time scaling, where models generate additional reasoning tokens before producing final answers. These approaches have demonstrated significant performance improvements on…

Artificial Intelligence · Computer Science 2026-01-13 Wenxun Wu , Yuanyang Li , Guhan Chen , Linyue Wang , Hongyang Chen

Data allocation plays a critical role in federated large language model (LLM) and small language models (SLMs) reasoning collaboration. Nevertheless, existing data allocation methods fail to address an under-explored challenge in…

Artificial Intelligence · Computer Science 2026-02-24 Wei Guo , Siyuan Lu , Xiangdong Ran , Yiqi Tong , Yikun Ban , Zelong Xu , Jing Fan , Zixuan Huang , Xiao Zhang , Zhaojun Hu , Fuzhen Zhuang

Recent advances in test-time alignment methods, such as Best-of-N sampling, offer a simple and effective way to steer language models (LMs) toward preferred behaviors using reward models (RM). However, these approaches can be…

Computation and Language · Computer Science 2026-03-16 Vinod Raman , Hilal Asi , Satyen Kale

Retrieval-augmented generation (RAG) is highly sensitive to the quality of selected context, yet standard top-k retrieval often returns redundant or near-duplicate chunks that waste token budget and degrade downstream generation. We present…

Computation and Language · Computer Science 2026-01-01 Chao Peng , Bin Wang , Zhilei Long , Jinfang Sheng

Multimodal Large Language Models (MLLMs) are powerful at integrating diverse data, but they often struggle with complex reasoning. While Reinforcement learning (RL) can boost reasoning in LLMs, applying it to MLLMs is tricky. Common issues…

Machine Learning · Computer Science 2025-06-30 Minjie Hong , Zirun Guo , Yan Xia , Zehan Wang , Ziang Zhang , Tao Jin , Zhou Zhao