paper-with-me

홈 › Papers

Best of mini-N in-loop Sampling: A Contextual Quality Reward Model for Reliable and Efficient Best-of-N Sampling

2025-10-05 · Hyung Gyu Rho, Sian Lee arxiv

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 acceptability, leaving systems vulnerable to selecting the least bad of many unacceptable options. This is particularly problematic for hard prompts, where the risk of such false acceptances increases with the number of samples. In this paper, we address this critical reliability gap by introducing a new data collection and modeling framework. By augmenting preference data with an outside option, inspired by discrete choice models, we train a reward model that can distinguish not just what is better, but what is good enough. We leverage this capability to create an adaptive inference strategy, best of mini-N in-loop, which partitions the generation budget into sequential loops with a calibrated, early-exit condition. Our experiments show that when tuned as an alignment guardrail, it reduces reliability failures by 70%, and when tuned as an inference accelerator, it improves average inference speed by over 22% in IMDB-sentiment setting. We thus provide a principled and flexible framework for practitioners to explicitly manage the trade-off between reliability and computational efficiency.

📄 PDF Abstract BibTeX arXiv:2510.04087

Code (0)

등록된 구현이 없습니다.

Tasks

Computational Efficiency

Similar Papers 제목 키워드 기반

Neural Video Compression with In-Loop Contextual Filtering and Out-of-Loop Reconstruction Enhancement

2025-09-04 · Yaojun Wu, Chaoyi Lin, Yiming Wang, Semih Esenlik 외 arxiv

This paper explores the application of enhancement filtering techniques in neural video compression. Specifically, we categorize these techniques into in-loop contextual filtering and out-of-loop reconstruction enhanceme…

Complexity of Single Loop Algorithms for Nonlinear Programming with Stochastic Objective and Constraints

2023-11-01 · Ahmet Alacaoglu, Stephen J. Wright

We analyze the complexity of single-loop quadratic penalty and augmented Lagrangian algorithms for solving nonconvex optimization problems with functional equality constraints. We consider three cases, in all of which th…

The Role of Contextual Information in Best Arm Identification

2021-06-26 · Masahiro Kato, Kaito Ariu

We study the best-arm identification problem with fixed confidence when contextual (covariate) information is available in stochastic bandits. Although we can use contextual information in each round, we are interested i…

BFTS: Thompson Sampling with Bayesian Additive Regression Trees

2026-02-08 · Ruizhe Deng, Bibhas Chakraborty, Ran Chen, Yan Shuo Tan arxiv

Contextual bandits are a core technology for personalized mobile health interventions, where decision-making requires adapting to complex, non-linear user behaviors. While Thompson Sampling (TS) is a preferred strategy f…

Loopholing Discrete Diffusion: Deterministic Bypass of the Sampling Wall

2025-10-22 · Mingyu Jo, Jaesik Yoon, Justin Deschenaux, Caglar Gulcehre 외 arxiv

Discrete diffusion models offer a promising alternative to autoregressive generation through parallel decoding, but they suffer from a sampling wall: once categorical sampling occurs, rich distributional information coll…

Text Generation