REVIEW 8 cited by
Algorithm of Thoughts: Enhancing Exploration of Ideas in Large 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
Current literature, aiming to surpass the "Chain-of-Thought" approach, often resorts to external modi operandi involving halting, modifying, and then resuming the generation process to boost Large Language Models' (LLMs) reasoning capacities. Due to their myopic perspective, they escalate the number of query requests, leading to increased costs, memory, and computational overheads. Addressing this, we propose the Algorithm of Thoughts -- a novel strategy that propels LLMs through algorithmic reasoning pathways. By employing algorithmic examples fully in-context, this overarching view of the whole process exploits the innate recurrence dynamics of LLMs, expanding their idea exploration with merely one or a few queries. Our technique outperforms earlier single-query methods and even more recent multi-query strategies that employ an extensive tree search algorithms while using significantly fewer tokens. Intriguingly, our results suggest that instructing an LLM using an algorithm can lead to performance surpassing that of the algorithm itself, hinting at LLM's inherent ability to weave its intuition into optimized searches. We probe into the underpinnings of our method's efficacy and its nuances in application. The code and related content can be found in: https://algorithm-of-thoughts.github.io.
Forward citations
Cited by 8 Pith papers
-
Hierarchical Domain Generalization
Over infinite domains, hierarchy-uniform domain generalization is impossible for every nontrivial hypothesis class; a length-generalization bound is a property of the length hierarchy, not a hierarchy-free guarantee.
-
Direct Behavior Optimization: Unlocking the Potential of Lightweight LLMs
A gradient-free Monte Carlo tree search over JSON key-step plans produces few-shot demonstrations that let LLaMA3-8B and LLaMA3.2-3B outperform GPT-3.5 on most of seven BIG-Bench Hard tasks.
-
LLM-First Search: Self-Guided Exploration of the Solution Space
LLM-First Search, where the model itself decides whether to continue or backtrack during reasoning, outperforms MCTS, BestFS, and ToT-BFS on harder Countdown and Sudoku tasks while using fewer tokens.
-
Chained Recursive Language Models for Multi-Iteration Reasoning
Chained fresh-root model calls with plain-text artifacts improve reported long-context reasoning accuracy over a single-call baseline, but the evidence lacks error bars and compute-matched comparison.
-
CodeAgents: A Token-Efficient Framework for Codified Multi-Agent Reasoning in LLMs
Rewriting multi-agent LLM prompts as pseudocode with assertions, replanning, and comments yields moderate accuracy gains and large token savings in the tests reported here, though some headline numbers are overstated.
-
Make Planning Research Rigorous Again!
A position paper calling for LLM-based planning research to reuse the rigor, benchmarks, and tools of the classical automated planning community.
-
Reason from Future: Reverse Thought Chain Enhances LLM Reasoning
A prompting method that alternates backward and forward reasoning improves small LLM accuracy on math and search tasks and reduces the number of visited search states.
-
Large Language Models for Planning: A Comprehensive and Systematic Survey
A structured survey of LLM planning methods, benchmarks, and interpretability work, organized around a three-way taxonomy.
Discussion (0). Sign in to comment.