Challenge: Existing methods for function calling require expert effort and prompt engineering becomes inefficient.
Approach: They propose a method that performs fine-grained, stepwise retrieval from a continually updated experience pool.
Outcome: The proposed method achieves an average improvement of 6.1% on easy and 4.7% on hard questions.

Similar Papers

Improving Large Language Models Function Calling and Interpretability via Guided-Structured Templates (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) have strong reasoning and tool-use capabilities, yet fail in real-world tool-interactions due to incorrect parameterization, poor tool selection, or misinterpretation of user intent.
Approach: They propose a curriculum-inspired framework that leverages structured reasoning templates to guide LLMs through more deliberate step-by-step instructions for generating function calls.
Outcome: The proposed framework reduces tool-use errors and improves interpretability and transparency of tool-using agents.
Self-Knowledge Guided Retrieval Augmentation for Large Language Models (2023.findings-emnlp)

Copied to clipboard

Challenge: Large language models (LLMs) have shown superior performance without task-specific fine-tuning due to the computational costs.
Approach: They propose a method which lets LLMs refer to the questions they have previously encountered and adaptively call for external resources when dealing with new questions.
Outcome: The proposed method outperforms chain-of-thought based and fully retrieval-based methods on multiple datasets and outperformed chain- of-though, chatGPT and InstructGPT.
ExpeTrans: LLMs Are Experiential Transfer Learners (2025.acl-long)

Copied to clipboard

Challenge: Recent studies provide large language models with textual task-solving experiences via prompts to improve their performance.
Approach: They propose to use prompts to provide LLMs with textual task-solving experiences during their inference stage.
Outcome: The proposed framework improves the performance of large language models on 13 datasets.
SEEKR: Selective Attention-Guided Knowledge Retention for Continual Learning of Large Language Models (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods fail to fully exploit the knowledge embedded in models from previous tasks . Existing techniques fail to exploit the information embedded in previous tasks, resulting in a large number of replay samples to achieve good results.
Approach: They propose a method that uses attention weights to extract knowledge from previous tasks . they use a data replay strategy to extract the knowledge from the previous tasks.
Outcome: The proposed method achieves comparable or even better performance with only 1/10 of replayed data used by other methods.
SEE: Strategic Exploration and Exploitation for Cohesive In-Context Prompt Optimization (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches separate the optimization of prompt instructions and in-context learning examples, leading to incohesive, suboptimal results.
Approach: They propose a framework that refines both prompt instructions and in-context learning examples.
Outcome: The proposed framework outperforms state-of-the-art prompt optimization methods on 35 benchmark tasks.
Enhancing Tool Retrieval with Iterative Feedback from Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: Existing methods have shown that large language models can handle a certain amount of tools through in-context learning or fine-tuning.
Approach: They propose to enhance tool retrieval with iterative feedback from the large language model by prompting the tool usage model to provide feedback for the tool retriever model in multi-round.
Outcome: The proposed approach achieves advanced performance in both in-domain evaluation and out-of-domain assessment.
ToolPRM: Fine-Grained Inference Scaling of Structured Outputs for Function Calling (2026.acl-long)

Copied to clipboard

Challenge: Existing research on inference scaling focuses on unstructured output generation tasks, such as mathematical problems.
Approach: They propose an inference-scaling framework that combines fine-grained beam search with ToolPRM, a process reward model scoring each intra-call decision.
Outcome: The proposed framework outperforms outcome and coarse-grained reward models in predictive accuracy and yields consistent test-time gains on multiple function-calling benchmarks.
Feedback-Driven Tool-Use Improvements in Large Language Models via Automated Build Environments (2026.findings-acl)

Copied to clipboard

Challenge: Currently, there are no efficient reinforcement learning (RL) frameworks specifically designed for tool use.
Approach: They propose an automated environment construction pipeline that incorporates scenario decomposition, document generation, function integration, complexity scaling, and localized deployment to enable high-quality training environments without external tools.
Outcome: The proposed framework significantly improves the models’ tool-use performance without degrading their general capabilities.
Self-Demos: Eliciting Out-of-Demonstration Generalizability in Large Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Existing methods that rely on limited demos and out-of-demonstration (OOD) queries fail when faced with out- of-demotion queries.
Approach: They propose a query-aware prompting method that elicits the inherent generalizability of large language models by query-based demo generation.
Outcome: The proposed method outperforms state-of-the-art methods in the OOD setting and two public math benchmarks.
Beyond Experience Retrieval: Learning to Generate Utility-Optimized Structured Experience for Frozen LLMs (2026.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are largely static and often redo reasoning or repeat mistakes. Prior experience reuse relies on external retrieval, which is similarity-based, can introduce noise, and adds latency.
Approach: They propose a lightweight plug-in that stores experience in its parameters and generates a structured, instance-tailored experience entry in a single forward pass to guide a frozen LLM executor.
Outcome: Experiments on mathematical reasoning benchmarks show consistent accuracy gains across executors with low overhead.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations