Challenge: Gödel agent Polaris makes policy level changes with small, auditable patches that persist in the policy and are reused on unseen instances within each benchmark.
Approach: They propose a Gödel agent that performs policy repair via experience abstraction . Polaris makes policy level changes with small, auditable patches that persist in the policy .
Outcome: The proposed agent improves on MGSM, DROP, GPQA, and LitBench models over the base policy and competitive baselines.

Similar Papers

Gödel Agent: A Self-Referential Agent Framework for Recursively Self-Improvement (2025.acl-long)

Copied to clipboard

Challenge: Existing agentic systems cannot search the whole design space due to the restriction of human-designed components.
Approach: They propose a Gödel Agent framework that allows agents to recursively improve themselves without relying on fixed algorithms or fixed algorithms.
Outcome: The proposed framework surpasses manual crafted agents in performance, efficiency, and generalizability.
Inverting the Shield: Systematically Generating Safety Tests from Policy Specifications (2026.acl-long)

Copied to clipboard

Challenge: Existing safety evaluation paradigms rely on constructed benchmarks or dynamic red-teaming to probe potential vulnerabilities.
Approach: They propose a framework that integrates specification-based software testing with AI safety.
Outcome: The proposed framework achieves higher coverage and attack success counts compared to baselines.
ReCreate: Reasoning and Creating Domain Agents Driven by Experience (2026.acl-long)

Copied to clipboard

Challenge: Large Language Model (LLM) agents are reshaping the industrial landscape, but tasks differ widely, making them labor-intensive to build.
Approach: They propose an experience-driven framework for the automatic creation of domain agents . they leverage agent interaction histories to provide rich concrete signals on success or failure .
Outcome: The proposed framework outperforms human-designed agents and existing methods in experiments across diverse domains.
CAR: Empowering Agents with Dynamic Tool Synthesis and Global Trajectory Rectification (2026.findings-acl)

Copied to clipboard

Challenge: Existing LLM agents are brittle in open-ended environments due to two limitations: 1) a closed action space; 2) myopic error recovery.
Approach: They propose a novel architecture that augments the action space and revises global strategies by adding a reflective replanning mechanism to the system.
Outcome: Experiments show that CAR outperforms baselines in a diagnostic benchmark with pruned toolsets to simulate tool scarcity.
From Off-Policy to On-Policy: Enhancing GUI Agents via Bi-level Expert-to-Policy Assimilation (2026.acl-long)

Copied to clipboard

Challenge: Vision-language models are increasingly deployed as computer-use agents that operate desktops and browsers.
Approach: They propose a method that turns static expert traces into policy-aligned guidance . they propose RLVR with a per-task, dynamically updated cache to decompose planning and execution .
Outcome: The proposed model improves UITARS1.5-7B success from 22.87% to 32.13% on OSWorld-Verified and raises a held-out split from 5.74% to 10.30% on MMBench-GUI and Online-Mind2Web.
QiMeng-PRepair: Precise Code Repair via Edit-Aware Reward Optimization (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to program repair are based on correctness alone.
Approach: They propose a framework that mitigates over-editing and improves repair accuracy by generating buggy programs and re-edits.
Outcome: The proposed framework improves repair precision by 31.4% under fix1@1, a metric that considers repair correctness and extent, and significantly increases decoding throughput when combined with speculative editing.
ReDel: A Toolkit for LLM-Powered Recursive Multi-Agent Systems (2024.emnlp-demo)

Copied to clipboard

Challenge: Recent studies show that large language models can be used to construct complex multi-agent systems.
Approach: They propose a toolkit for recursive multi-agent systems that supports custom tool-use, delegation schemes, event-based logging, and interactive replay.
Outcome: The proposed tool achieves significant performance gains on agentic benchmarks and identify potential areas of improvement through visualization and debugging tools.
Improving Retrospective Language Agents via Joint Policy Gradient Optimization (2025.naacl-long)

Copied to clipboard

Challenge: Recent advances in large language models have sparked interest in creating autonomous agents.
Approach: They propose a framework that jointly optimizes both task-planning and self-reflective evolution capabilities in language agents.
Outcome: The proposed framework improves task planning and self-reflective evolution capabilities in language agents.
OPT-BENCH: Evaluating the Iterative Self-Optimization of LLM Agents in Large-Scale Search Spaces (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated remarkable capabilities in reasoning and tool use, but their ability to continuously refine solutions in response to dynamic environmental feedback remains underexplored.
Approach: They propose a benchmark to evaluate self-improvement capabilities in large-scale search spaces by combining 20 machine learning tasks with 10 classic NP-hard problems.
Outcome: The proposed framework emulates human-like cognitive adaptation and operates via a general perception–memory–reasoning loop, iteratively refining solutions based on environmental feedback.
ToolDNA: Autonomous Evolution of Tool Metadata for Robust Dialogue Agents (2026.findings-acl)

Copied to clipboard

Challenge: Task-oriented dialogue systems face labor-intensive manual metadata tuning and sparse reinforcement learning (RL) rewards that fail to diagnose invocation errors.
Approach: They propose a framework that enables auto-evolution of policy networks and tool metadata via RL . a tool metadata loop coordinates metadata through policy-generated candidates during rollouts .
Outcome: The proposed framework achieves +11% problem resolution and +54% accuracy over commercial LLMs with prompt engineering and +25%/+35% over supervised fine-tuning.

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