arXiv (All)
open access
Test-Time Scaling in Reasoning LLMs: Inference Regimes, Evaluation, and Reproducibility
Large language models can solve harder reasoning problems with more inference-time compute. The term "test-time scaling," however, covers several inference algorithms: extending deliberation along one trajectory, sampling completed candidates and aggregating them by voting or verification, and searc
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
- Test-Time Scaling in Reasoning LLMs: Inference Regimes, Evaluation, and Reproducibility#809448
- What is the Role of Small Models in the LLM Era: A Survey#1049587
- Beyond Surface Forms: Symbolic Edits as a Test for Logical Reasoning with LLMs#799472
- Beyond Surface Forms: Symbolic Edits as a Test for Logical Reasoning with LLMs#798049
- Taming Speculative Search for Test-Time Scaling in LLM Serving#1160999
Record · ID 819441
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