REVIEW 1 cited by
Recursion of Thought: A Divide-and-Conquer Approach to Multi-Context Reasoning with Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Generating intermediate steps, or Chain of Thought (CoT), is an effective way to significantly improve language models' (LM) multi-step reasoning capability. However, the CoT lengths can grow rapidly with the problem complexity, easily exceeding the maximum context size. Instead of increasing the context limit, which has already been heavily investigated, we explore an orthogonal direction: making LMs divide a problem into multiple contexts. We propose a new inference framework, called Recursion of Thought (RoT), which introduces several special tokens that the models can output to trigger context-related operations. Extensive experiments with multiple architectures including GPT-3 show that RoT dramatically improves LMs' inference capability to solve problems, whose solution consists of hundreds of thousands of tokens.
Forward citations
Cited by 1 Pith paper
-
MetaRuleGPT: Recursive Numerical Reasoning of Language Models Trained with Simple Rules
A 30M-parameter Transformer trained on digit-operation rules and paired with a verification loop reports 100% accuracy on high-digit arithmetic and vector cross products.
Discussion (0). Continue with ORCID to comment.