:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bagirov, Farid, Arkhipov, Mikhail, Sycheva, Ksenia, Glukhov, Evgeniy, Bogomolov, Egor
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2510.23393
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Diff-XYZ: A Benchmark for Evaluating Diff Understanding
by: Glukhov, Evgeniy, et al.
Published: (2025)

Challenge on Optimization of Context Collection for Code Completion
by: Ustalov, Dmitry, et al.
Published: (2025)

On Pretraining for Project-Level Code Completion
by: Sapronov, Maksim, et al.
Published: (2025)

BOND: Aligning LLMs with Best-of-N Distillation
by: Sessa, Pier Giuseppe, et al.
Published: (2024)

Majority of the Bests: Improving Best-of-N via Bootstrapping
by: Rakhsha, Amin, et al.
Published: (2025)

Best of mini-N in-loop Sampling: A Contextual Quality Reward Model for Reliable and Efficient Best-of-N Sampling
by: Rho, Hyung Gyu, et al.
Published: (2025)

Flexible Empowerment at Reasoning with Extended Best-of-N Sampling
by: Kobayashi, Taisuke
Published: (2026)

Excision Score: Evaluating Edits with Surgical Precision
by: Gruzinov, Nikolai, et al.
Published: (2025)

PIPer: On-Device Environment Setup via Online Reinforcement Learning
by: Kovrigin, Alexander, et al.
Published: (2025)

Best-of-N Jailbreaking
by: Hughes, John, et al.
Published: (2024)

Learning Generative Selection for Best-of-N
by: Toshniwal, Shubham, et al.
Published: (2026)

CarBoN: Calibrated Best-of-N Sampling Improves Test-time Reasoning
by: Tang, Yung-Chen, et al.
Published: (2025)

Long Code Arena: a Set of Benchmarks for Long-Context Code Models
by: Bogomolov, Egor, et al.
Published: (2024)

Variational Best-of-N Alignment
by: Amini, Afra, et al.
Published: (2024)

Is Best-of-N the Best of Them? Coverage, Scaling, and Optimality in Inference-Time Alignment
by: Huang, Audrey, et al.
Published: (2025)

AdaBoN: Adaptive Best-of-N Alignment
by: Raman, Vinod, et al.
Published: (2025)

Inference-Aware Fine-Tuning for Best-of-N Sampling in Large Language Models
by: Chow, Yinlam, et al.
Published: (2024)

BoNBoN Alignment for Large Language Models and the Sweetness of Best-of-n Sampling
by: Gui, Lin, et al.
Published: (2024)

TreeBoN: Enhancing Inference-Time Alignment with Speculative Tree-Search and Best-of-N Sampling
by: Qiu, Jiahao, et al.
Published: (2024)

Structured Pruning for Diverse Best-of-N Reasoning Optimization
by: Nguyen, Hieu Trung, et al.
Published: (2025)

GenSelect: A Generative Approach to Best-of-N
by: Toshniwal, Shubham, et al.
Published: (2025)

Mining Intrinsic Rewards from LLM Hidden States for Efficient Best-of-N Sampling
by: Guo, Jizhou, et al.
Published: (2025)

Best-of-N through the Smoothing Lens: KL Divergence and Regret Analysis
by: Aminian, Gholamali, et al.
Published: (2025)

From Curiosity to Caution: Mitigating Reward Hacking for Best-of-N with Pessimism
by: Yu, Zhuohao, et al.
Published: (2026)

Faster WIND: Accelerating Iterative Best-of-$N$ Distillation for LLM Alignment
by: Yang, Tong, et al.
Published: (2024)

Optimal Stopping vs Best-of-$N$ for Inference Time Optimization
by: Kalayci, Yusuf, et al.
Published: (2025)

Revisiting the (Sub)Optimality of Best-of-N for Inference-Time Alignment
by: Sriraman, Ved, et al.
Published: (2026)

Scalable Best-of-N Selection for Large Language Models via Self-Certainty
by: Kang, Zhewei, et al.
Published: (2025)

Learning to Choose or Choosing to Learn: Best-of-N vs. Supervised Fine-Tuning for Bit String Generation
by: Somerstep, Seamus, et al.
Published: (2025)

Reward Learning from Best-of-$N$ Preference Data: Targets, Tradeoffs, and Design Principles
by: Pukdee, Rattana, et al.
Published: (2026)

Drawing Pandas: A Benchmark for LLMs in Generating Plotting Code
by: Galimzyanov, Timur, et al.
Published: (2024)

Practical Code RAG at Scale: Task-Aware Retrieval Design Choices under Compute Budgets
by: Galimzyanov, Timur, et al.
Published: (2025)

Stochastically Constrained Best Arm Identification with Thompson Sampling
by: Yang, Le, et al.
Published: (2025)

Best-of-Both-Worlds Algorithms for Linear Contextual Bandits
by: Kuroki, Yuko, et al.
Published: (2023)

The Best of Both Worlds: On the Dilemma of Out-of-distribution Detection
by: Zhang, Qingyang, et al.
Published: (2024)

Best-of-Majority: Minimax-Optimal Strategy for Pass@$k$ Inference Scaling
by: Di, Qiwei, et al.
Published: (2025)

Transformer-based Model for ASR N-Best Rescoring and Rewriting
by: Kang, Iwen E., et al.
Published: (2024)

Thompson Exploration with Best Challenger Rule in Best Arm Identification
by: Lee, Jongyeong, et al.
Published: (2023)

Step Rejection Fine-Tuning: A Practical Distillation Recipe
by: Slinko, Igor, et al.
Published: (2026)

Tight Sample Complexity Bounds for Entropic Best Policy Identification
by: Essakine, Amer, et al.
Published: (2026)