arXiv (All)
open access
Parason: Revealing Subtask and Trial Parallelism in LLM Reasoning
Scaling test-time reasoning has substantially improved the problem-solving ability of large language models (LLMs), but standard autoregressive decoding still executes long reasoning traces sequentially, creating severe latency for difficult tasks (up to days and weeks). Parallel reasoning offers a
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
- Quantifying the Stability of Multi-Step Reasoning via Error Amplification#1215507
- Post-Reasoning: Improving the Performance of Non-Thinking Models at No Cost#1084202
- When LLM Meets Tree Search: A Systematic View of Inference as Search in Large Language Models#799599
- SPIRAL: Learning to Search and Aggregate#1155241
- What Makes Good Multilingual Reasoning? Disentangling Traces with Measurable Features#1049794
Record · ID 1342591
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