ToC: Tree-of-Claims Search with Multi-Agent Language Models
Shuyang Yu, Jianan Liang, Hui Hu

TL;DR
This paper introduces Tree of Claims (ToC), a novel framework combining Monte Carlo Tree Search with multi-agent LLMs to optimize patent claims by balancing novelty, scope, and coherence, outperforming standard LLMs in claim refinement tasks.
Contribution
ToC is the first to integrate MCTS with multi-agent LLMs for structured patent claim editing, enabling transparent and effective optimization.
Findings
ToC achieves an 8 ext% average improvement over standard LLMs.
Outperforms in zero-shot and few-shot claim revision scenarios.
Validated through extensive ablation studies.
Abstract
Optimizing patent claims is a critical yet challenging task, demanding careful balance between maximizing novelty and preserving legal scope. Manual claim drafting is labor-intensive, costly, and inherently inconsistent, while conventional Large Language Models (LLMs) often lack the structured, iterative reasoning essential for precise claim refinement. To address these challenges, we introduce Tree of Claims (ToC), an innovative framework that redefines claim editing as a guided search problem. ToC synergistically integrates Monte Carlo Tree Search (MCTS) with a collaborative multi-agent system, comprising an LLM-based EditorAgent that proposes contextually grounded edits, and an ExaminerAgent that mimics patent examiner critiques through structured, chain-of-thought analyses of novelty and prior art disclosure. Driven by a carefully designed multi-objective reward function, ToC…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsIntellectual Property and Patents · Explainable Artificial Intelligence (XAI) · Artificial Intelligence in Law
