ModeX: Evaluator-Free Best-of-N Selection for Open-Ended Generation
Not on the map. Why?
Abstract (arXiv)
Selecting a single high-quality output from multiple stochastic generations remains a fundamental challenge for large language models (LLMs), particularly in open-ended tasks where no canonical answer exists. While Best-of-N and self-consistency methods show that aggregating multiple generations can improve performance, existing approaches typically rely on external evaluators, reward models, or exact string-match voting, limiting their applicability and efficiency. We propose Mode Extraction (ModeX), an evaluator-free Best-of-N selection framework that generalizes majority voting to open-ended text generation by identifying the modal output representing the dominant semantic consensus among generated texts. ModeX constructs a similarity graph over candidate generations and recursively applies spectral clustering to select a representative centroid, without requiring additional inference or auxiliary models. We further instantiate this selection principle as ModeX-Lite, an improved version of ModeX with early pruning for efficiency. Across open-ended tasks -- including text summarization, code generation, and mathematical reasoning -- our approaches consistently outperform standard single- and multi-path baselines, providing a computationally efficient solution for robust open-ended text generation. Code is released in https://github.com/deeplearning-wisc/ModeX.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 40 of its 48 references that are in the map. First posted on arXiv 5 Jan 2026.
Builds on
40 of 48 references.
References · 40
- 2017Attention Is All You Needcited by 60,361
- 2023GPT-4 Technical Reportcited by 18,396
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,626
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2022Self-Consistency Improves Chain of Thought Reasoning in Language Modelscited by 5,708
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2023Let's Verify Step by Stepcited by 3,789
28 more
- 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,442
- 2023Code Llama: Open Foundation Models for Codecited by 2,139
- 2024Qwen2 Technical Reportcited by 2,120
- 2024HybridFlow: A Flexible and Efficient RLHF Frameworkcited by 2,057
- 2024Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameterscited by 1,986
- 2024Mixtral of Expertscited by 1,823
- 2023Improving Factuality and Reasoning in Language Models through Multiagent Debatecited by 1,784
- 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,292
- 2015Teaching Machines to Read and Comprehendcited by 1,049
- 2024Mixture-of-Agents Enhances Large Language Model Capabilitiescited by 438
- 2025The Lessons of Developing Process Reward Models in Mathematical Reasoningcited by 415
- 2023DoLa: Decoding by Contrasting Layers Improves Factuality in Large Language Modelscited by 376
- 2023Generating with Confidence: Uncertainty Quantification for Black-box Large Language Modelscited by 293
- 2025Skywork-Reward-V2: Scaling Preference Data Curation via Human-AI Synergycited by 214
- 2025Scalable Best-of-N Selection for Large Language Models via Self-Certaintycited by 187
- 2024Fast Best-of-N Decoding via Speculative Rejectioncited by 112
- 2024ARGS: Alignment as Reward-Guided Searchcited by 103
- 2025Debate or Vote: Which Yields Better Decisions in Multi-Agent Large Language Models?cited by 81
- 2023Reward-Augmented Decoding: Efficient Controlled Text Generation With a Unidirectional Reward Modelcited by 79
- 2024Adaptive Inference-Time Compute: LLMs Can Predict if They Can Do Better, Even Mid-Generationcited by 64
- 2025Voting or Consensus? Decision-Making in Multi-Agent Debatecited by 59
- 2024DeAL: Decoding-time Alignment for Large Language Modelscited by 55
- 2025When Identity Skews Debate: Anonymization for Bias-Reduced Multi-Agent Reasoningcited by 21
- 2025Do We Truly Need So Many Samples? Multi-LLM Repeated Sampling Efficiently Scales Test-Time Computecited by 20
- 2025Collab: Controlled Decoding using Mixture of Agents for LLM Alignmentcited by 14
- 2025Slim-SC: Thought Pruning for Efficient Scaling with Self-Consistencycited by 13
- 2025CLUE: Non-parametric Verification from Experience via Hidden-State Clusteringcited by 12
- 2024Aggregation of Reasoning: A Hierarchical Framework for Enhancing Answer Selection in Large Language Modelscited by 5
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026Uncertainty Quantification in LLM Agents: Foundations, Emerging Challenges, and Opportunitiescited by 20
- 2026Epistemic Gain, Aleatoric Cost: Uncertainty Decomposition in Multi-Agent Debate for Math Reasoningcited by 5
- 2026Beyond Majority Voting: Efficient Best-Of-N with Radial Consensus Scorecited by 2
- 2026Reachability Is Not Realization: Tracing the Sources of LLM Benchmark Gainscited by 1
- 2026More Correct Mass, Worse Answers: Why Power Sampling Can Fail and How to Fix Itcited by 1
- 2026More Correct Mass, Worse Answers: Why Power Sampling Can Fail and How to Fix It14 Aug 2026
- 2026Reachability Is Not Realization: Tracing the Sources of LLM Benchmark Gains4 Aug 2026
- 2026Beyond Majority Voting: Efficient Best-Of-N with Radial Consensus Score14 Apr 2026
- 2026Epistemic Gain, Aleatoric Cost: Uncertainty Decomposition in Multi-Agent Debate for Math Reasoning1 Mar 2026
- 2026Uncertainty Quantification in LLM Agents: Foundations, Emerging Challenges, and Opportunities4 Feb 2026
Similar, not cited
Close in wording, no citation either way
- 2025Majority of the Bests: Improving Best-of-N via Bootstrapping
- 2024Retrieval is Accurate Generation
- 2026Select-And-Extract: A Lightweight Plugin for Retrieval-Augmented Generation
- 2024Integrate the Essence and Eliminate the Dross: Fine-Grained Self-Consistency for Free-Form Language Generation
- 2025A Survey on Parallel Text Generation: From Parallel Decoding to Diffusion Language Models
- 2024Improving Open-Ended Text Generation via Adaptive Decoding
- 2023Lightweight reranking for language model generations
- 2026Principled Top-k Selection for Language Models with Hybrid Gradients