Graph of Thoughts (GoT)
Free while signed in. Answers cite the passages they came from.
Generalizes Chain-of-Thought and Tree-of-Thought by modeling LLM reasoning as an arbitrary graph.
Arbitrary graph structure: Represents LLM-generated thoughts as nodes in a graph with arbitrary edges - allowing merging, looping, and non-tree structures.
Feedback loops: Enables explicit feedback loops where earlier thoughts can be revised based on later exploration - impossible in strictly linear or tree-structured reasoning.
Network reasoning: The authors call this "network reasoning", treating reasoning as a graph-exploration problem rather than a linear or branching one.
No model updates: Like CoT and ToT, works purely at prompting level without any model fine-tuning - extending the chain-of-X prompting family.
Get next week’s papers.
The same picks and the same summaries, in your inbox. Free, and 176 issues deep.
Subscribe on Substack