aiqbench analysis
This paper introduces Pairwise-Guided Logit Adjustment (PGLA), a novel method for test-time scaling that leverages pairwise confidence comparisons between reasoning paths to correct ranking errors in large language models. By integrating comparative evidence with voting support through a KL-regularized objective, the framework theoretically aligns with traditional logit adjustments while empirically improving performance across mathematical reasoning, knowledge tasks, and code generation. The approach offers a plug-and-play enhancement for existing sampling-based inference strategies without requiring model retraining.
Compare to Correct: Pairwise-Guided Logit Adjustment for LLM Test-Time Scaling
arXiv:2610.18583v1 Announce Type: new Abstract: Sampling-based test-time scaling enhances LLM reasoning by aggregating multiple reasoning paths for the same query. Existing methods use answer frequencies or path confidence to compute candidate scores, which do not explicitly characterize comparisons between competing answers. Inspired by the Condorcet principle in social choice theory, we introduce pairwise confidence comparisons between paths supporting different answers to capture answer-level comparative advantage. We combine this comparative evidence with voting support through a KL-regularized objective. Theoretically, we show that this comparative-advantage is equivalent to the adjustment to the traditional voting logits. In this way, our proposed Pairwise-Guided Logit Adjustment (PGLA) framework allows comparative evidence to compensate for weaker voting support and correct voting-based ranking errors. Experiments on 10 challenging benchmarks including mathematical reasoning, knowledge reasoning, and code generation with 7 models ranging from 1.7B to 32B parameters speak to the effectiveness of this plug-and-play term. Additional evaluations with external reward scores and online sampling further demonstrate its applicability.
Abstract:Sampling-based test-time scaling enhances LLM reasoning by aggregating multiple reasoning paths for the same query. Existing methods use answer frequencies or path confidence to compute candidate scores, which do not explicitly characterize comparisons between competing answers. Inspired by the Condorcet principle in social choice theory, we introduce pairwise confidence comparisons between paths supporting different answers to capture answer-level comparative advantage. We combine this comparative evidence with voting support through a KL-regularized objective. Theoretically, we show that this comparative-advantage is equivalent to the adjustment to the traditional voting logits. In this way, our proposed Pairwise-Guided Logit Adjustment (PGLA) framework allows comparative evidence to compensate for weaker voting support and correct voting-based ranking errors. Experiments on 10 challenging benchmarks including mathematical reasoning, knowledge reasoning, and code generation with 7 models ranging from 1.7B to 32B parameters speak to the effectiveness of this plug-and-play term. Additional evaluations with external reward scores and online sampling further demonstrate its applicability.
Artificial Intelligence (cs.AI)
arXiv:2610.18583 [cs.AI]
(or arXiv:2610.18583v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2610.18583 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 249 words
Related coverage

Challenge: Hand coding weights for efficient sequence memorisation
AI Alignment Forum · Jul 23, 2026
Base Models Can Detect Hidden Intentions that Prompted Classifiers Miss
LessWrong · Oct 12, 2026
Training a coding model to paint watercolours with TRL and OpenEnv
Hugging Face · Sep 3, 2026

Automated Reasoning policy refinement in Amazon Bedrock
AWS · Aug 3, 2026