arXiv — cs.AI preprintsInternational2 October 2026
From Discovery to Decision: Finite-Budget Recoverability in LLM Voting
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.01014v1 Announce Type: new Abstract: Voting over multiple LLM responses is a common primitive in test-time scaling and ensemble inference. Collecting more responses can expand the candidate pool and increase the chance that a correct answer is discovered. Under a fixed call budget, a discovered answer still needs to accumulate enough support within the remaining calls to become the final plurality winner, creating a discovery-to-decision gap. In this work, we characterize this gap through the realized vote state and remaining call budget. We derive a sharp recoverability threshold a
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Heavy-Tailed Memory Traces in Long-Horizon Language Agents2 October 2026
- When Do Causal World Models Help Modular LLM Agents2 October 2026
- From Proposal to Verified Effect: Praxa, an Evidence-Bound Harness for Governed AI Agent Execution2 October 2026
- What Do Rationales Communicate? A Message-Intervention Study in Role-Specialized QA2 October 2026
- Measuring the Microtask Eligibility Gap: When Is an Off-the-Shelf SLM Enough for an Agent Harness?2 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.