REVIEW 2 cited by
Tulip Agent -- Enabling LLM-Based Agents to Solve Tasks Using Large Tool Libraries
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
We introduce tulip agent, an architecture for autonomous LLM-based agents with Create, Read, Update, and Delete access to a tool library containing a potentially large number of tools. In contrast to state-of-the-art implementations, tulip agent does not encode the descriptions of all available tools in the system prompt, which counts against the model's context window, or embed the entire prompt for retrieving suitable tools. Instead, the tulip agent can recursively search for suitable tools in its extensible tool library, implemented exemplarily as a vector store. The tulip agent architecture significantly reduces inference costs, allows using even large tool libraries, and enables the agent to adapt and extend its set of tools. We evaluate the architecture with several ablation studies in a mathematics context and demonstrate its generalizability with an application to robotics. A reference implementation and the benchmark are available at github.com/HRI-EU/tulip_agent.
Forward citations
Cited by 2 Pith papers
-
CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
CleANN combines workload-aware bridge building, on-the-fly neighborhood consolidation, and semi-lazy memory cleaning to keep graph-based ANNS recall near static-build levels under fully dynamic concurrent workloads.
-
Adapting Embedding Models for Agent Capability Retrieval
Fine-tuning three off-the-shelf retrieval models on AgentSelect improved query-to-agent ranking on two unseen marketplace catalogs, MuleRun and ClawHub, across all three model families.
Discussion (0). Continue with ORCID to comment.