Challenge: Existing web agents struggle with complex tasks due to rigid planning strategies and hallucination-prone reasoning.
Approach: They propose a task-uncertainty-driven Adaptive Planning Mechanism that adaptively selects planning modes to navigate unknown environments.
Outcome: The proposed framework performs better on the WebArena and WebVoyager benchmarks than existing frameworks.

Similar Papers

Branch-and-Browse: Efficient and Controllable Web Exploration with Tree-Structured Reasoning and Action Memory (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for embodied reasoning are coarse-grained and expensive . branch-and-browse framework enables fine-grounded, memory-guided, and efficient multi-branch reasoning.
Approach: They propose a framework that unifies structured reasoning-acting, contextual memory, and efficient execution.
Outcome: The proposed framework achieves task success rate of 35.8% and reduces execution time by up to 40.4% relative to state-of-the-art methods.
Why Do LLM-based Web Agents Fail? A Hierarchical Planning Perspective (2026.acl-long)

Copied to clipboard

Challenge: Existing evaluations focus primarily on end-to-end success, offering limited insight into where failures arise.
Approach: They propose a hierarchical planning framework that analyzes web agents across three layers . they show that structured Planning Domain Definition Language (PDDL) plans produce more concise and goal-directed strategies than natural language (NL) plans .
Outcome: The proposed framework analyzes web agents across three layers to improve reasoning, grounding, and recovery.
Rethinking LLM Uncertainty: A Multi-Agent Approach to Estimating Black-Box Model Uncertainty (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to gauge model’s uncertainty through self-consistency in responses to the target query are misleading: an LLM may confidently provide an incorrect answer to a target query, yet give a confident and accurate answer to that same query when answering a knowledge-preserving perturbation of the query.
Approach: They propose a method that uses multi-agent interaction to estimate black-box LLMs' uncertainty.
Outcome: The proposed method outperforms existing self-consistency based methods and improves hallucination detection.
Web Sitemap Knowledge Can Enhance Autonomous Browsing (2026.findings-acl)

Copied to clipboard

Challenge: Existing web agents suffer from limited robustness, efficiency and task success due to lack of structural understanding of websites and lack of browsing priors in pre-trained models.
Approach: They propose an agent-oriented sitemap protocol that integrates structured website knowledge into web agents.
Outcome: The proposed agent-oriented sitemap improves robustness, efficiency and effectiveness without extra training.
The Confidence Dichotomy: Analyzing and Mitigating Miscalibration in Tool-Use Agents (2026.acl-long)

Copied to clipboard

Challenge: a fundamental pillar of trustworthiness is calibration, which refers to an agent’s ability to express confidence that reliably reflects its actual performance.
Approach: They propose a reinforcement learning framework that jointly optimizes task accuracy and calibration, supported by a holistic benchmark of reward designs.
Outcome: The proposed framework improves calibration across tool types and shows that trained agents achieve superior calibration and exhibit robust generalization from local training environments to noisy web settings and to distinct domains such as mathematical reasoning.
Agentic Reasoning: A Streamlined Framework for Enhancing LLM Reasoning with Agentic Tools (2025.acl-long)

Copied to clipboard

Challenge: Existing reasoning methods excel in structured domains like math and code, but they are not all effective in knowledge-intensive tasks.
Approach: They introduce a framework that enhances large language model reasoning by integrating external tool-using agents.
Outcome: The proposed framework achieves state-of-the-art among public models and delivers comparable performance to OpenAI Deep Research.
Navigating the Infinite Dynamic Web Space: Effective In-Context Exploration via Cognitive Multi-Agent Collaboration (2026.eacl-long)

Copied to clipboard

Challenge: Existing methods for dynamic web navigation rely on greedy strategies or value estimation, struggle to achieve effective backtracking and are heavily dependent on proprietary models.
Approach: They propose a cognitive multi-agent collaboration framework that enhances cyberspace exploration capability through In-Context Exploration.
Outcome: The proposed framework surpasses the proprietary model Claude-3.5 Sonnet on the WebArena benchmark.
MSI-Agent: Incorporating Multi-Scale Insight into Embodied Agents for Superior Planning and Decision-Making (2024.emnlp-main)

Copied to clipboard

Challenge: Insight is a form of long-term memory for an agent but lack of general insight can undermine its effectiveness.
Approach: They propose an embodied agent that summarises and utilizes insight effectively across different scales and generates task-specific and high-level insight, stores it in a database, and then uses relevant insight from it.
Outcome: The proposed agent outperforms a similar agent when planning by GPT3.5 and is more robust when faced with domain-shifting scenarios.
Demystifying Uncertainty in LLMs: Active Calibration between Concepts and Human Evaluations (2026.acl-long)

Copied to clipboard

Challenge: Existing static strategies for mitigating hallucinations do not explicitly model the information gain from interacting with the external environment.
Approach: They propose a calibration-driven interactive learning strategy that selects clarification queries by optimizing calibration error.
Outcome: The proposed method provides theoretical guarantees and empirical gains for reliability.
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.

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