Count votes and compare competing answers
Pairwise-Guided Logit Adjustment, or PGLA, studies how a language model chooses between answers after sampling several reasoning paths. A common approach counts how often each answer appears. Other methods use confidence attached to the individual paths.
The authors add pairwise confidence comparisons between paths supporting different answers. Their goal is to capture comparative advantage between candidates, including cases where the better answer has weaker voting support. The paper draws on the Condorcet principle from social choice theory to motivate that comparison.
Adjust the ranking through a defined objective
PGLA combines comparative evidence with voting support through a KL-regularized objective. The paper derives an equivalence between this comparative advantage and an adjustment to the traditional voting logits.
That gives the proposed method a specific role in an existing sampling workflow: it changes the aggregation of candidate evidence. It does not require treating the most frequent answer as correct simply because more sampled paths reached it.
Experiments cover ten benchmarks involving mathematical reasoning, knowledge reasoning and code generation. The authors evaluate seven models ranging from 1.7 billion to 32 billion parameters, with additional evaluations using external reward scores and online sampling.
The reported effectiveness applies to those evaluated models and tasks. Pairwise confidence remains a signal to assess; several candidate paths can still share a mistaken assumption, and the abstract does not establish a universal accuracy improvement for arbitrary deployments.
Compare aggregation methods on identical samples
Franklin analysis: keep the sampled paths fixed when comparing majority voting and PGLA. Save the original frequency ranking, pairwise evidence and adjusted result, including cases where adjustment changes a correct answer into an incorrect one.
Measure total cost as well as accuracy. A gain is more useful when its extra comparisons are affordable for the application and remain dependable on the task types the system actually receives.
Comments