AIFeb 25, 2024

Budget-Constrained Tool Learning with Planning

Tsinghua
arXiv:2402.15960v228 citationsh-index: 35ACL
AI Analysis

This addresses a practical limitation in tool learning for large language models, though it is incremental as it builds on existing methods.

The paper tackles the problem of budget-constrained tool learning, where user queries must be resolved within specific budget limits, by proposing a method that creates a plan to allocate tool usage under constraints, resulting in significant effectiveness improvements when integrated with existing methods under strict budgets.

Despite intensive efforts devoted to tool learning, the problem of budget-constrained tool learning, which focuses on resolving user queries within a specific budget constraint, has been widely overlooked. This paper proposes a novel method for budget-constrained tool learning. Our approach involves creating a preferable plan under the budget constraint before utilizing the tools. This plan outlines the feasible tools and the maximum number of times they can be employed, offering a comprehensive overview of the tool learning process for large language models. This allows them to allocate the budget from a broader perspective. To devise the plan without incurring significant extra costs, we suggest initially estimating the usefulness of the candidate tools based on past experience. Subsequently, we employ dynamic programming to formulate the plan. Experimental results demonstrate that our method can be integrated with various tool learning methods, significantly enhancing their effectiveness under strict budget constraints.

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes