中文
相关论文

相关论文: RoBoN: Routed Online Best-of-n for Test-Time Scali…

200 篇论文

Allocating more computation during inference time (test-time scaling) improves language model performance, especially for reasoning tasks. However, popular methods like Best-of-$N$ sampling often show diminishing returns as $N$ increases.…

机器学习 · 计算机科学 2025-10-20 Yung-Chen Tang , Pin-Yu Chen , Andrea Cavallaro

Large language models (LLMs) are powerful tools but are often expensive to deploy at scale. LLM query routing mitigates this by dynamically assigning queries to models of varying cost and quality to obtain a desired trade-off. Prior query…

This paper concerns the problem of aligning samples from large language models to human preferences using best-of-$n$ sampling, where we draw $n$ samples, rank them, and return the best one. We consider two fundamental problems. First: what…

计算与语言 · 计算机科学 2024-11-05 Lin Gui , Cristina Gârbacea , Victor Veitch

Obtaining high-quality generations in modern LLMs has largely been framed as a selection problem: identifying a single winning generation from a diverse pool of N samples, the Best-of-N (BoN). Yet, this approach is inherently zero-sum,…

计算与语言 · 计算机科学 2025-10-02 Ammar Khairi , Daniel D'souza , Marzieh Fadaee , Julia Kreutzer

Best-of-N selection is a key technique for improving the reasoning performance of Large Language Models (LLMs) through increased test-time computation. Current state-of-the-art methods often employ computationally intensive reward models…

计算与语言 · 计算机科学 2025-12-15 Zhewei Kang , Xuandong Zhao , Dawn Song

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…

计算与语言 · 计算机科学 2026-03-16 Vinod Raman , Hilal Asi , Satyen Kale

Best-of-N (BoN) is a popular and effective algorithm for aligning language models to human preferences. The algorithm works as follows: at inference time, N samples are drawn from the language model, and the sample with the highest reward,…

计算与语言 · 计算机科学 2025-03-05 Afra Amini , Tim Vieira , Elliott Ash , Ryan Cotterell

Inference-time alignment enhances the performance of large language models without requiring additional training or fine-tuning but presents challenges due to balancing computational efficiency with high-quality output. Best-of-N (BoN)…

Stepwise model routing improves the efficiency of Large Reasoning Models (LRMs) by assigning each reasoning step to a suitable model. Recent methods formulate routing as a sequential decision process and train the router with reinforcement…

人工智能 · 计算机科学 2026-05-29 Shenghao Ye , Yu Guo , Zhengheng Li , Shuangwu Chen , Jian Yang

Sampling multiple outputs from a Large Language Model (LLM) and selecting the most frequent (Self-consistency) or highest-scoring (Best-of-N) candidate is a popular approach to achieve higher accuracy in tasks with discrete final answers.…

机器学习 · 计算机科学 2025-11-25 Amin Rakhsha , Kanika Madan , Tianyu Zhang , Amir-massoud Farahmand , Amir Khasahmadi

The rapid emergence of diverse large language models (LLMs) has spurred the development of LLM routers that assign user queries to the most suitable model. However, existing LLM routers typically perform a single-round, one-to-one mapping…

计算与语言 · 计算机科学 2025-10-27 Haozhen Zhang , Tao Feng , Jiaxuan You

The inherent capabilities of a language model (LM) and the reasoning strategies it employs jointly determine its performance in reasoning tasks. While test-time scaling is regarded as an effective approach to tackling complex reasoning…

计算与语言 · 计算机科学 2025-05-27 Zhihong Pan , Kai Zhang , Yuze Zhao , Yupeng Han

Test-time scaling enhances large language model performance by allocating additional compute resources during inference. Best-of-N (BoN) sampling serves as a common sampling-based scaling technique, broadening the search space in parallel…

计算与语言 · 计算机科学 2025-11-04 Yiming Wang , Pei Zhang , Siyuan Huang , Baosong Yang , Zhuosheng Zhang , Fei Huang , Rui Wang

Routing large language models (LLMs) is a new paradigm that uses a router to recommend the best LLM from a pool of candidates for a given input. In this paper, our comprehensive analysis with more than 8,500 LLMs reveals a novel model-level…

计算与语言 · 计算机科学 2025-05-21 Zhongzhan Huang , Guoming Ling , Yupei Lin , Yandong Chen , Shanshan Zhong , Hefeng Wu , Liang Lin

Modern preference alignment techniques, such as Best-of-N (BoN) sampling, rely on reward models trained with pairwise comparison data. While effective at learning relative preferences, this paradigm fails to capture a signal of response…

统计方法学 · 统计学 2025-10-14 Hyung Gyu Rho , Sian Lee

LLM inference often generates a batch of candidates for a prompt and selects one via strategies like majority voting or Best-of- N (BoN). For difficult tasks, this single-shot selection often underperforms. Consequently, evaluations…

机器学习 · 计算机科学 2025-10-06 Qiwei Di , Kaixuan Ji , Xuheng Li , Heyang Zhao , Quanquan Gu

Recent advances in diffusion language models (DLMs) have presented a promising alternative to traditional autoregressive large language models (LLMs). However, DLMs still lag behind LLMs in reasoning performance, especially as the number of…

计算与语言 · 计算机科学 2025-10-27 Chenglong Wang , Yang Gan , Hang Zhou , Chi Hu , Yongyu Mu , Kai Song , Murun Yang , Bei Li , Chunliang Zhang , Tongran Liu , Jingbo Zhu , Zhengtao Yu , Tong Xiao

The safe and effective deployment of Large Language Models (LLMs) involves a critical step called alignment, which ensures that the model's responses are in accordance with human preferences. Prevalent alignment techniques, such as DPO, PPO…

计算与语言 · 计算机科学 2024-11-04 Hanshi Sun , Momin Haider , Ruiqi Zhang , Huitao Yang , Jiahao Qiu , Ming Yin , Mengdi Wang , Peter Bartlett , Andrea Zanette

Alignment has greatly improved large language models (LLMs)' output quality at the cost of diversity, yielding highly similar outputs across generations. We propose Base-Aligned Model Collaboration (BACo), an inference-time token-level…

计算与语言 · 计算机科学 2025-11-11 Yichen Wang , Chenghao Yang , Tenghao Huang , Muhao Chen , Jonathan May , Mina Lee

Chain-of-thought has been proven essential for enhancing the complex reasoning abilities of Large Language Models (LLMs), but it also leads to high computational costs. Recent advances have explored the method to route queries among…

计算与语言 · 计算机科学 2025-12-05 Chenyang Shao , Xinyang Liu , Yutang Lin , Fengli Xu , Yong Li
‹ 上一页 1 2 3 10 下一页 ›