WILBUR: Adaptive In-Context Learning for Robust and Accurate Web Agents

Michael Lutz*1, Arth Bohra*1, Manvel Saroyan2
Artem Harutyunyan2 Giovanni Campagna2
UC Berkeley1, Bardeen2
*Indicates Equal Contribution
Paper Try It! arXiv

Abstract

In the realm of web agent research, achieving both generalization and accuracy remains a challenging problem. Due to high variance in website structure, existing approaches often fail. Moreover, existing fine-tuning and in-context learning techniques fail to generalize across multiple websites. We introduce WILBUR, an approach that uses a differentiable ranking model and a novel instruction synthesis technique to optimally populate a black-box large language model’s prompt with task demonstrations from previous runs. To maximize end-to-end success rates, we also propose an intelligent backtracking mechanism that learns and recovers from its mistakes. Finally, we show that our ranking model can be trained on data from a generative auto-curriculum which samples representative goals from an LLM, runs the agent, and automatically evaluates it, with no manual annotation. WILBUR achieves state-of-the-art results on the WebVoyager benchmark, beating text-only models by 8% overall, and up to 36% on certain websites. On the same benchmark, WILBUR is within 5% of a strong multi-modal model despite only receiving textual inputs, and further analysis reveals a substantial number of failures are due to engineering challenges of operating the web.

Architecture

Given the goal and the current state of the page, Wilbur repeatedly executes actions until the task is predicted to have finished or until backtracking is necessary.

At each step of the execution, Wilbur makes use of the following sub-modules:

  1. The demonstration retriever queries a demonstration bank of full-length trajectories and finds the relevant ones; individual action demonstrations are also queried. The retriever obtains both positive (successful) and negative (unsuccessful) demonstrations.
  2. The knowledge synthesizer summarizes the demonstrations into a description of learnings; demonstrations are summarized separately.
  3. The actor references demonstrations and learnings to predict an action, given the current state, next step plan from previous step, and feedback if returning from a backtrack.
  4. The executor performs the action on the website and obtains the new observable state as well as execution feedback.
  5. The reflection module compares the old and new states before determining whether to backtrack, continue, or finish; it updates feedback for backtracking or plans the next step if continuing.
  6. At the end of an execution, the answer module produces the textual response required by the goal using the final observable state, and agent's trajectory.
System Architecture

Action Demonstration Ranking

In order to have action demonstrations scale across multiple websites and types of pages (e.g. search pages, documentation, etc.), the quality of action demonstrations is important. To that end, a simple cosine similarity is not sufficient to determine whether a demonstration will actively help the actor. While a demonstration might be similar, there may exist slight differences in respective DOMs that lead the actor astray.

The ranking model is an MLP that encodes the embeddings of the demonstrations (observation, plan, action) as well as the current observation and plan, and it is trained to predict whether a demonstration leads to a successful execution or not, as a 0-1 score. After computing the score of each demonstrations and normalizing with softmax, we then sample successful executions to include in the actor's context.

WILBUR is a graph traverser

After an action is taken, WILBUR checks if the executed action achieved its intended step and is making progress toward the goal.

v, φ, p′ = Reflect(o, o′, a, p, g)

where v is a ternary verdict:

  • FINISH: the current goal was completed successfully
  • CONTINUE: proceed by completing planned step p′ next
  • BACKTRACK: backtrack and utilize feedback φ′

The reflector uses both a rule-based comparison algorithm that checks for state changes, and an LLM to compute the verdict.

If the agent backtracks, it returns to the most recent observation that is safe to return to. Because the backend is real and not simulated, not all state changes can be reverted. In the current implementation, WILBUR returns to the most recent state that corresponded to a navigation (change in page URL). The new state is applied by that refreshing or navigating to that URL, which resets the DOM on the page.

Backtracking

WILBUR learns from an autocurriculum

In order to populate WILBUR's demonstration banks and train our knowledge model, we build a multi-step auto-curriculum to collect reference trajectories.

  1. An auto-curriculum is run on a batch of websites and record predicted end-to-end success using an execution evaluation language model.
  2. A more challenging goal-generation process is run conditioned on initial goals and utilizing task and goal demonstrations from trajectories recorded in the first step.
  3. We train our knowledge model to predict success likelihood of actions in the follow-up run which reference demonstrations in the first run.

Our autocurriculum is generated through LLM generated goals, where given a set of websites, we query a model to generate realistic use-cases. To actually evaluate the agent's execution on a goal from the auto-curriculum, we model self-evaluation r ∈ [0, 1] as a function of the agent’s execution trajectory τ and returned text answer. Essentially, r is the LLM's evaluation of success of the agent's execution trajectory with regards to the goal's requirements.

Using the Autocurriculum to Train the Knowledge Model: The first run of auto-curriculum generates demonstrations queried during the second run of the auto-curriculum. As such, the follow-up run generates training data for the knowledge model. We train the knowledge model to predict action success as estimated in the reflection step, using binary cross-entropy loss.

Results

Results

On the WebVoyager benchmark using the experimental setup outlined in the paper, WILBUR outperforms the state-of-the-art text-only model by 8%. Specifically, we observe that WILBUR outperforms the SOTA model on most websites except Github and the Google websites.

It improves substantially on the very hard Booking.com case, from around 2.4% to 39%. WILBUR is also within 5% of the multimodal model, which has access to screenshots during execution, and outperforms it on Allrecipes, ArXiv, Booking.com, ESPN, Cambridge Dictionary, BBC News, and Wolfram.

Comparing against the ablation baselines, we observe that the naive zero-shot baseline is significantly worse than the state of the art, but adding backtracking is enough to come close to the state-of-the-art result. Adding task demonstrations improves to 50%, showing the value of recalling previous experiences from auto-curriculum. Finally, the use of the fine-tuned demonstration retrieval model further improves by 3% overall, highlighting the importance of selecting high-quality task demonstrations.

BibTeX

@misc{lutz2024wilbur,
  title={WILBUR: Adaptive In-Context Learning for Robust and Accurate Web Agents}, 
  author={Michael Lutz and Arth Bohra and Manvel Saroyan and Artem Harutyunyan and Giovanni Campagna},
  year={2024},
  eprint={2404.05902},
  archivePrefix={arXiv},
  primaryClass={cs.CL}
}