arXiv (All)
open access
Sample, Mix, or Verify? Allocating Test-Time Compute under Imperfect Verifiers
A common way to make language models and agents more accurate is to spend more compute at inference time: generate many candidate solutions and submit the one a verifier prefers. Success then requires that some candidate is correct and that the verifier picks it. The first grows predictably with the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Adaptive Test-Time Compute Allocation for Block Diffusion Language Models in Complex Reasoning#665649
- Adaptive Test-Time Compute Allocation for Block Diffusion Language Models in Complex Reasoning#664149
- When Agents Slow Down: Understanding LLM Agents' Test-Time Strategies via Elo-per-token Analysis#1109339
- MAS-ProVe: Understanding the Process Verification of Multi-Agent Systems#819295
- MAS-ProVe: Understanding the Process Verification of Multi-Agent Systems#809302
Record · ID 1387539
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive