From Imitation to Discrimination: Progressive Curriculum Learning for Robust Web Navigation (2026.findings-acl)
Copied to clipboard
| Challenge: | Text-based web agents offer computational efficiency for autonomous web navigation, yet they lack discrimination capabilities to reject plausible but incorrect elements in densely populated pages. |
| Approach: | They propose a model that uses a text-based web agent to learn to discriminate against incorrect elements in densely populated HTML and a training curriculum to synthesize diverse cross-domain tasks with strict verification. |
| Outcome: | Empirical evaluation shows that the model performs better than open-source models with 58.7% step success rate. |
Similar Papers
WorkForceAgent-R1: Incentivizing Reasoning Capability in LLM-based Web Agents via Reinforcement Learning (2026.findings-eacl)
Copied to clipboard
| Challenge: | Existing web agents relying on supervised fine-tuning struggle with generalization and robustness due to insufficient reasoning capabilities when handling the inherently dynamic nature of web interactions. |
| Approach: | They propose a large language model-empowered web agent that trains using a rule-based reinforcement learning framework to enhance single-step reasoning and planning for business-oriented web navigation tasks. |
| Outcome: | The proposed agent outperforms baseline LLM-based agents on the WorkArena benchmark by 10.26–16.59%. |
GTA: Generating Long-horizon Tasks for Web Agents at Scale (2026.acl-long)
Copied to clipboard
Tenghao Huang, Kung-Hsiang Huang, Prafulla Kumar Choubey, Yilun Zhou, Muhao Chen, Jonathan May, Chien-Sheng Wu
| Challenge: | Existing benchmarks provide only coarse start–goal annotations without intermediate trajectories . Existing frameworks provide no supervision over the agent's latent decision process . |
| Approach: | They propose a framework that integrates crawling, retrieval-based seeding, in-context generation and automated quality control to produce realistic tasks paired with executable trajectories. |
| Outcome: | The proposed framework decouples crawling from generation for greater efficiency and ensures dense supervision through deterministic replays and systematic validation. |
Virtual Data Augmentation: A Robust and General Framework for Fine-tuning Pre-trained Models (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have shown that powerful pre-trained language models can be fooled by small perturbations or intentional attacks. |
| Approach: | They propose a framework for fine-tuning PLMs using a masked language model and Gaussian noise to augment semantically relevant examples with sufficient diversity. |
| Outcome: | The proposed framework improves the robustness of pre-trained language models and alleviates performance degradation under adversarial attacks. |
RaDA: Retrieval-augmented Web Agent Planning with LLMs (2024.findings-acl)
Copied to clipboard
| 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. |
DPC: Training-Free Text-to-SQL Candidate Selection via Dual-Paradigm Consistency (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods for generating SQL queries lack the ability to self-evaluate correctness without an execution oracle. |
| Approach: | They propose a framework that reformulates SQL selection from a probabilistic guessing task on hidden data into a deterministic verification task on visible data. |
| Outcome: | Experiments on BIRD and Spider show that the proposed method outperforms baselines. |
Robust Navigation with Language Pretraining and Stochastic Sampling (D19-1)
Copied to clipboard
Xiujun Li, Chunyuan Li, Qiaolin Xia, Yonatan Bisk, Asli Celikyilmaz, Jianfeng Gao, Noah A. Smith, Yejin Choi
| Challenge: | Existing methods to learn visual representations and action decoding schemes are limited to previously unseen instructions and environments. |
| Approach: | They propose a stochastic sampling scheme to reduce the gap between the expert actions in training and sampled actions in test to correct its own mistakes. |
| Outcome: | The proposed methods achieve 6% absolute gain over the previous best results on the Room-to-Room benchmark. |
Leveraging Web-Crawled Data for High-Quality Fine-Tuning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Currently, large language models are fine-tuned using expensive human-annotated data or GPT-4 generated data. |
| Approach: | They propose to use web-crawled data to train a language model on a smaller set of data . their results show that the model can convert web data with irregular formats into high-quality ones . |
| Outcome: | The proposed model outperforms open-source models larger than 32B and outperformed open-sourced models such as GPT-3.5. |
Curr-ReFT: Overcoming Training Bottlenecks in Small-scale Vision-Language Models via Curriculum Reinforcement Finetuning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | State-of-the-art vision-language models require massive scaling that limits practical deployment. |
| Approach: | They propose to use supervised fine-tuning to train small-scale vision-language models but face out-of-domain collapse when trained with traditional supervised learning (SFT). |
| Outcome: | Experiments show that curr-reFT achieves state-of-the-art performance across visual tasks in both in- and out-of domain settings and benchmarks. |
GFT: From Imitation to Reward Fine-Tuning with Unbiased Group Advantages and Dynamic Coefficient Rectification (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing studies have demonstrated that supervised fine-tuning and reinforcement learning are effective in integrating knowledge injection with robust generalization. |
| Approach: | They propose a unified post-training framework that addresses intrinsic limitations of supervised fine-tuning and reinforcement learning. |
| Outcome: | The proposed framework surpasses SFT-based methods and yields policies that integrate more smoothly with subsequent RL training. |
AgentTuning: Enabling Generalized Agent Abilities for LLMs (2024.findings-acl)
Copied to clipboard
| Challenge: | Open large language models (LLMs) with great performance in various tasks are far inferior to commercial models such as ChatGPT and GPT-4 when acting as agents to tackle complex tasks in the real world. |
| Approach: | They propose a method to enhance the agent capabilities of LLMs while maintaining their general abilities. |
| Outcome: | The AgentLM-70B is comparable to GPT-3.5-turbo on unseen agent tasks, demonstrating generalized agent capabilities. |