Search arXiv⌕ Search

arXiv · 2610.23246

Think More or Read More? A Token-Budget Theory of Reasoning with Shared Context

Abstract

Reasoning systems increasingly improve answers by incorporating additional context into the model's input, from multi-agent debate, where agents read their peers' responses, to self-refinement, where a model revisits its own drafts. In these systems, communication consumes context as one agent's output becomes another's input. We study the regime where token reading and generation draw on one fixed token window, so every token spent reading is a token that cannot be spent reasoning. We develop a \textbf{token-budget theory} that formalizes this trade-off, modeling accuracy as a function of the reasoning budget remaining after reading and aggregating votes with a Condorcet jury model that permits correlated errors. For multi-agent debate, the theory gives a closed-form prediction for the optimal number of agents. This quantity is estimated from single-agent measurements, allowing the optimal group size to be determined without running debate, and the same accounting extends to a heterogeneous set of different models. We empirically verify our theory and show that, at the predicted group size, our method outperforms strong baselines under the tightest calibration spend, where debate-calibrated rules can afford only one or two questions. Self-refinement obeys the same accounting, with its own draft in place of a peer message. The theory further predicts that communication pays only when the gain in the accuracy ceiling exceeds the reasoning room spent on reading, with this condition tightening as the window shrinks. Across five open models and four reasoning tasks, self-consistency matches or beats deployed debate at $93$\% of $980$ matched window-and-group-size settings, with the gap being largest under tight windows and nearly disappearing at a loose one, consistent with the theory. Under a shared window, how much room a model has left to \textit{think matters more than what it reads}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manh Nguyen, Sunil Gupta, Hung Le. 2026-10-16. Think More or Read More? A Token-Budget Theory of Reasoning with Shared Context. https://arxiv.org/abs/2610.23246

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Enriching Patent Claim Generation with European Patent Dataset

Drafting patent claims is time-intensive, costly, and requires professional skill. Therefore, researchers have investigated large language models (LLMs) to assist inventors in writing claims. However, existing work has largely relied on datasets from the United States Patent and Trademark Office (USPTO). To enlarge research scope regarding various jurisdictions, drafting conventions, and legal standards, we introduce EPD, a European patent dataset. EPD presents rich textual data and structured metadata to support multiple patent-related tasks, including claim generation. This dataset enriches the field in three critical aspects: (1) Jurisdictional diversity: Patents from different offices vary in legal and drafting conventions. EPD fills a critical gap by providing a benchmark of European patents to enable more comprehensive evaluation. (2) Quality improvement: EPD offers high-quality granted patents with finalized and legally approved texts, whereas others consist of patent applications that are unexamined or provisional. Experiments show that LLMs fine-tuned on EPD significantly outperform those trained on previous datasets and even GPT-4o in claim quality and cross-domain generalization. (3) Real-world simulation: We propose a difficult subset of EPD to better reflect real-world challenges. Results reveal that all tested LLMs perform substantially worse on challenging samples, which highlights the need for future research.

cs.CL↗

POSID: Target-Task-Unsupervised Person-Attribute Extraction from Heterogeneous Public-Safety Text

Person descriptions in public-safety text can be compact and regular, or distributed across heterogeneous narratives in which evidence boundaries and person ownership are ambiguous. We present POSID, a target-task-unsupervised framework that decomposes person-attribute extraction into candidate localization, provenance-controlled extraction scope, structured recovery and traversal, and person association, without supervised training or fine-tuning on the target task. We evaluate six localization configurations under two traversal policies across three real-use cohorts and two controlled synthetic diagnostics. On structurally regular descriptions, the strongest configurations reach 1.000/.972 Attr-Only (AO)/Attr-Value (AV) F1 on Compact500. Across the real-use cohorts, every RE-containing configuration benefits from conservative early stopping, while semantic-only retrieval can benefit from continued traversal when localization is less constrained. On the heterogeneous multi-person Challenge14 cohort, the best automatic AO and AV results are .500 and .382; replacing automatic candidates with verified evidence raises the frozen extractor to .522/.410 under early stopping, showing that localization is one of the material bottlenecks. We further introduce provenance-aware scoring for collective and underspecified evidence and a separate person-aware diagnostic for ownership and fragmentation. Together, the results establish a measurable operating regime for inspectable person-attribute extraction and distinguish errors due to localization, traversal, structured recovery, and attribution. Code: https://github.com/ksolaiman/hart-posid.

cs.CL↗

Reasoning for Hierarchical Text Classification: The Case of Patents

Hierarchical text classification (HTC) assigns documents to multiple levels of a pre-defined taxonomy. Automated patent subject classification represents one of the hardest HTC scenarios because of professional difficulties and extensive labels. Prior approaches only output a flat label set, which offers little insight into the reason behind predictions. Therefore, we propose Reasoning for Hierarchical Classification (RHC), a novel framework that reformulates HTC as a step-by-step reasoning task to sequentially deduce hierarchical labels. RHC trains large language models (LLMs) in two stages: a cold-start stage that aligns outputs with chain-of-thought (CoT) reasoning format and a reinforcement learning (RL) stage to enhance multi-step reasoning ability. RHC demonstrates four advantages in our experiments. (1) Effectiveness: RHC surpasses previous baselines and outperforms the supervised fine-tuning counterparts by approximately 3% in accuracy and macro F1. (2) Explainability: RHC produces natural-language justifications before prediction to facilitate human inspection. (3) Scalability: RHC scales favorably with model size with larger gains compared to standard fine-tuning. (4) Applicability: Beyond patents, we further demonstrate that RHC achieves state-of-the-art performance on other widely used HTC benchmarks, which highlights its broad applicability.

cs.CL↗