English

Reliability-Aware Adaptive Self-Consistency for Efficient Sampling in LLM Reasoning

Computation and Language 2026-04-21 v2 Machine Learning

Abstract

Self-Consistency improves reasoning reliability through multi-sample aggregation, but incurs substantial inference cost. Adaptive self-consistency methods mitigate this issue by adjusting the sampling budget; however, they rely on count-based stopping rules that treat all responses equally, often leading to unnecessary sampling. We propose Reliability-Aware Adaptive Self-Consistency (ReASC), which addresses this limitation by reframing adaptive sampling from response counting to evidence sufficiency, leveraging response-level confidence for principled information aggregation. ReASC operates in two stages: a single-sample decision stage that resolves instances confidently answerable from a single response, and a reliability-aware accumulation stage that aggregates responses by jointly leveraging their frequency and confidence. Across five models and four datasets, ReASC consistently achieves the best accuracy-cost trade-off compared to existing baselines, yielding improved inference efficiency across model scales from 3B to 27B parameters. As a concrete example, ReASC reduces inference cost by up to 70\% relative to self-consistency while preserving accuracy on GSM8K using Gemma-3-4B-it.

Keywords

Cite

@article{arxiv.2601.02970,
  title  = {Reliability-Aware Adaptive Self-Consistency for Efficient Sampling in LLM Reasoning},
  author = {Junseok Kim and Nakyeong Yang and Kyungmin Min and Kyomin Jung},
  journal= {arXiv preprint arXiv:2601.02970},
  year   = {2026}
}

Comments

ACL 2026, Code is available at https://github.com/junseokkim00/ReASC

R2 v1 2026-07-01T08:52:33.160Z