English
Related papers

Related papers: Power-SMC: Low-Latency Sequence-Level Power Sampli…

200 papers

Large Reasoning Models (LRMs) excel in structured tasks by emulating deliberate human reasoning but often suffer from overthinking, degrading performance and wasting resources. One possible baseline is to deploy both LLM and LRM, then route…

Computation and Language · Computer Science 2025-10-09 Jaeseong Lee , Dayoung Kwon , seung-won hwang

Numerous capability and safety techniques of Large Language Models (LLMs), including RLHF, automated red-teaming, prompt engineering, and infilling, can be cast as sampling from an unnormalized target distribution defined by a given reward…

Machine Learning · Computer Science 2024-05-01 Stephen Zhao , Rob Brekelmans , Alireza Makhzani , Roger Grosse

Language Reasoning Models (LRMs) achieve strong performance by scaling test-time computation but often suffer from ``overthinking'', producing excessively long reasoning traces that increase latency and memory usage. Existing LRMs typically…

Symbolic regression is a powerful tool for discovering governing equations directly from data, but its sensitivity to noise hinders its broader application. This paper introduces a Sequential Monte Carlo (SMC) framework for Bayesian…

Machine Learning · Computer Science 2025-12-12 Geoffrey F. Bomarito , Patrick E. Leser

Recent studies show that Large Language Models (LLMs) achieve strong reasoning capabilities through supervised fine-tuning or reinforcement learning. However, a key approach, the Process Reward Model (PRM), suffers from reward hacking,…

Computation and Language · Computer Science 2026-04-10 Teng Wang , Zhangyi Jiang , Zhenqi He , Shenyang Tong , Wenhan Yang , Yanan Zheng , Zeyu Li , Zifan He , Hailei Gong , Zewen Ye , Shengjie Ma , Jianping Zhang

Large Language Models (LLMs) are increasingly applied to complex tasks that require extended reasoning. In such settings, models often benefit from diverse chains-of-thought to arrive at multiple candidate solutions. This requires two…

Machine Learning · Computer Science 2025-10-08 Xueyan Li , Guinan Su , Mrinmaya Sachan , Jonas Geiping

A recurring pattern in "reasoning without training" is that base LLMs already assign non-trivial probability mass to correct multi-step solutions; the bottleneck is locating these modes efficiently at inference time. Power sampling provides…

Artificial Intelligence · Computer Science 2026-05-13 Tu Nguyen , Matthieu Zimmer , Rasul Tutunov , Xiaotong Ji , Haitham Bou Ammar

In this article we develop a new sequential Monte Carlo (SMC) method for multilevel (ML) Monte Carlo estimation. In particular, the method can be used to estimate expectations with respect to a target probability distribution over an…

Computation · Statistics 2017-03-16 Alexandros Beskos , Ajay Jasra , Kody Law , Youssef Marzouk , Yan Zhou

Large language models (LLMs) solve problems more accurately and interpretably when instructed to work out the answer step by step using a ``chain-of-thought'' (CoT) prompt. One can also improve LLMs' performance on a specific task by…

Recent work shows that, beyond discrete reasoning through explicit chain-of-thought steps, which are limited by the boundaries of natural languages, large language models (LLMs) can also reason continuously in latent space, allowing richer…

Computation and Language · Computer Science 2026-03-03 Dachuan Shi , Abedelkadir Asi , Keying Li , Xiangchi Yuan , Leyan Pan , Wenke Lee , Wen Xiao

We introduce Projected Latent Markov Chain Monte Carlo (PL-MCMC), a technique for sampling from the high-dimensional conditional distributions learned by a normalizing flow. We prove that a Metropolis-Hastings implementation of PL-MCMC…

Machine Learning · Computer Science 2021-03-01 Chris Cannella , Mohammadreza Soltani , Vahid Tarokh

Large language models (LLMs) and multimodal LLMs (MLL-Ms) excel at chain-of-thought reasoning but face distribution shift at test-time and a lack of verifiable supervision. Recent test-time reinforcement learning (TTRL) methods derive…

Computation and Language · Computer Science 2026-03-09 Jianghao Wu , Yasmeen George , Jin Ye , Yicheng Wu , Daniel F. Schmidt , Jianfei Cai

Scaling large language models (LLMs) has driven significant advancements, yet it faces diminishing returns and escalating energy demands. This work explores how test-time compute (TTC) can serve as an energy-efficient complement to…

Machine Learning · Computer Science 2025-11-11 Yunho Jin , Gu-Yeon Wei , David Brooks

Recently, scaling test-time compute on Large Language Models (LLM) has garnered wide attention. However, there has been limited investigation of how various reasoning prompting strategies perform as scaling. In this paper, we focus on a…

Artificial Intelligence · Computer Science 2025-08-18 Yexiang Liu , Zekun Li , Zhi Fang , Nan Xu , Ran He , Tieniu Tan

Outcome-reward reinforcement learning (RL) is a common and increasingly significant way to refine the step-by-step reasoning of multimodal large language models (MLLMs). In the multiple-choice setting - a dominant format for multimodal…

Computer Vision and Pattern Recognition · Computer Science 2025-11-14 Jiahao Wang , Weiye Xu , Aijun Yang , Wengang Zhou , Lewei Lu , Houqiang Li , Xiaohua Wang , Jinguo Zhu

Language models (LMs) are trained on billions of tokens in an attempt to recover the true language distribution. Still, vanilla random sampling from LMs yields low quality generations. Decoding algorithms attempt to restrict the LM…

Machine Learning · Computer Science 2026-01-06 Kareem Ahmed , Sameer Singh

Sequential Monte Carlo (SMC) methods are a class of techniques to sample approximately from any sequence of probability distributions using a combination of importance sampling and resampling steps. This paper is concerned with the…

Statistics Theory · Mathematics 2012-03-05 Pierre Del Moral , Arnaud Doucet , Ajay Jasra

Large Language Models (LLMs) have demonstrated exceptional performance across diverse tasks. However, their deployment in long-context scenarios faces high computational overhead and information redundancy. While soft prompt compression has…

Computation and Language · Computer Science 2026-05-12 Jiwei Tang , Zhijing Huang , Xinyu Zhang , Chen Jason Zhang , Jianxing Yu , Libin Zheng , Rui Meng , Jian Yin

We propose a training-free conditional sampling method for flow matching models based on importance sampling. Because a na\"ive application of importance sampling suffers from weight degeneracy in high-dimensional settings, we modify and…

Machine Learning · Statistics 2026-02-16 Qianqian Qu , Jun S. Liu

We study inference-time alignment for diffusion-based generative models, aiming to steer a base model toward high-reward outputs without updating its weights. Recent Sequential Monte Carlo (SMC)-based steering methods approximate…

Machine Learning · Computer Science 2026-05-26 Weixin Wang , Yu Yang , Wei Deng , Pan Xu