Challenge: Agents powered by large language models inherit important limitations such as the restricted context length, dependency on human-engineered exemplars, and insufficient generalization.
Approach: They propose a novel planning method for Web agents that disentangles planning into two stages: for a new given task, it decomposes tasks into high-level subtasks; and then iteratively synthesizes actions based on dynamically retrieved exemplars.
Outcome: The proposed method decomposes tasks into high-level subtasks and iteratively synthesizes actions based on dynamically retrieved exemplars.

Similar Papers

Hybrid-RACA: Hybrid Retrieval-Augmented Composition Assistance for Real-time Text Prediction (2024.emnlp-industry)

Copied to clipboard

Challenge: Large language models (LLMs) enhanced with retrieval augmentation have shown great performance in many applications, but their computational overhead and additional retrieval step limit their effectiveness in real-time tasks.
Approach: They propose a system that combines a cloud-based LLM with a smaller client-side model through retrieval augmented memory to provide real-time text prediction.
Outcome: The proposed system can generate better responses from the cloud-based model while maintaining low latency.
Crafting Personalized Agents through Retrieval-Augmented Generation on Editable Memory Graphs (2024.emnlp-main)

Copied to clipboard

Challenge: In the age of mobile internet, personal information is constantly being generated on smartphones.
Approach: They propose a novel task of crafting personalized agents powered by large language models that leverage a user's smartphone memories to enhance downstream applications with LLM capabilities.
Outcome: The proposed approach improves 10% over the best existing approach on a real-world dataset and improves usability.
WebDART: Dynamic Decomposition and Re-planning for Complex Web Tasks (2026.findings-acl)

Copied to clipboard

Challenge: Large-language-model (LLM) agents are competent at straightforward web tasks, but struggle with complex tasks.
Approach: They propose a general framework that decomposes web tasks into three subtasks . they show that WebDART lifts end-to-end success rates by 13.7 percentage points .
Outcome: Evaluated on WebChoreArena, WebDART lifts success rates by 13.7 percentage points over previous state-of-the-art agents.
Data-Centric Perspectives on Agentic Retrieval-Augmented Generation: A Survey (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) excel at natural language understanding and generation, yet rely on static pre-training data.
Approach: They propose to augment Large Language Models with external retrieval to ground model outputs . traditional RAG is constrained by a fixed retrieve-then-generate routine . authors aim to guide creation of high-quality datasets for next generation of adaptive LLM agents .
Outcome: The proposed model can decompose tasks, issue exploratory queries, and refine evidence through iterative retrieval.
KnowAgent: Knowledge-Augmented Planning for LLM-Based Agents (2025.findings-naacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) fail to effectively guide the planning trajectories during task solving and result in planning hallucinations.
Approach: They propose a novel approach to enhance the planning capabilities of large language models by incorporating explicit action knowledge.
Outcome: The proposed approach can achieve comparable or superior performance to existing baselines on HotpotQA and ALFWorld.
Efficient Integration of External Knowledge to LLM-based World Models via Retrieval-Augmented Generation and Reinforcement Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing attempts to enhance LLM-based world models through prompting or fine-tuning approaches are either requiring human knowledge or computationally extensive.
Approach: They propose a framework that leverages retrieval-augmented generation to integrate external knowledge to LLM-based world models.
Outcome: The proposed framework outperforms baseline models and exhibits strong generalizability.
SGA-MCTS: Decoupling Planning from Execution via Training-Free Atomic Experience Retrieval (2026.findings-acl)

Copied to clipboard

Challenge: a new framework casts LLM planning as non-parametric retrieval, but high latency of inference-time search and supervised fine-tuning are limitations.
Approach: They propose a framework that casts LLM planning as non-parametric retrieval . they leverage Monte Carlo Tree Search to explore the solution space .
Outcome: Empirical results show that SGA-MCTS can match the performance of SOTA systems without task-specific fine-tuning.
Memp: Exploring Agent Procedural Memory (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) based agents suffer from brittle procedural memory that is manually engineered or entangled in static parameters.
Approach: They propose a procedural-memory repository that distills past agent trajectories into fine-grained, step-by-step instructions and higher-level, script-like abstractions.
Outcome: The proposed repository can be used to improve agents' performance on travelplanner and Alfworld.
RaLLe: A Framework for Developing and Evaluating Retrieval-Augmented Large Language Models (2023.emnlp-demo)

Copied to clipboard

Challenge: Existing libraries for building R-LLMs provide high-level abstractions without sufficient transparency for evaluating and optimizing prompts within specific inference processes.
Approach: They propose an open-source framework to facilitate the development, evaluation, and optimization of R-LLMs for knowledge-intensive tasks.
Outcome: The framework improves hand-crafted prompts, inference processes and quantitatively measures overall system performance.
ADaPT: As-Needed Decomposition and Planning with Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) are increasingly being used for interactive decision-making tasks requiring planning and adapting to the environment.
Approach: They propose an approach that explicitly plans and decomposes complex sub-tasks when the LLM is unable to execute them.
Outcome: The proposed approach significantly outperforms established strong baselines, achieving success rates up to 28.3% higher in ALFWorld, 27% in WebShop, and 33% in TextCraft.

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