Discover and explore top open-source AI tools and projects—updated daily.
Tree search library for LLM inference scaling
Top 65.9% on SourcePulse
TreeQuest is a Python library designed for flexible answer tree search, primarily aimed at scaling Large Language Model (LLM) inference. It provides an easy-to-use API for defining custom node generation and scoring logic, enabling users to explore complex search spaces efficiently.
How It Works
TreeQuest implements variants of Adaptive Branching Monte Carlo Tree Search (AB-MCTS), including ABMCTS-A (with node aggregation) and ABMCTS-M (with mixed models). The core idea is to represent the search space as a tree where each node contains a state and a score. Users define a generate
function that, given a parent state, produces new child states and their associated scores. The library then uses AB-MCTS algorithms to intelligently explore this tree, prioritizing promising branches to find optimal solutions. This approach allows for adaptive scaling of LLM inference by exploring multiple response paths simultaneously.
Quick Start & Requirements
uv add "treequest[abmcts-m]"
or pip install "treequest[abmcts-m]"
.Highlighted Details
Maintenance & Community
The project is associated with a paper published on arXiv (arXiv:2503.04412), indicating active research and development. Contribution guidelines are available in CONTRIBUTING.md
.
Licensing & Compatibility
The library is licensed under the Apache 2.0 license, which permits commercial use and linking with closed-source projects.
Limitations & Caveats
The AB-MCTS-M variant requires installing extra dependencies. The library is relatively new, with its primary research paper dated 2025, suggesting potential for evolving APIs or undiscovered edge cases.
1 month ago
Inactive