Search: “multi-agent-learning”

Smart search ranks by meaning as well as keywords (one row per story, last 45 days).

AgentGrad: Intervention-guided Prompt Optimization for Multi Agent Systems

AgentGrad introduces intervention-guided prompt optimization for LLM multi-agent systems, achieving state-of-the-art results with 2.5x faster optimization.

AgentGrad is a prompt optimization framework for LLM-based multi-agent systems that addresses limitations in textual gradient extraction and aggregation. It uses sequential intervention to identify the agent whose prompt modification resolves a given failure, then applies agent-level supervision and semantic gradient clustering to build generalized gradients. Experiments report state-of-the-art performance across five MAS benchmarks and a 2.5x average reduction in wall-clock optimization time versus the next-fastest baseline.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research

32

Multi-Agent Reinforcement Learning for Autonomous UAV Exploration in Wildfire Response

Researchers trained multi-agent deep reinforcement learning UAV agents for autonomous wildfire monitoring, with converging policies tracking fire boundaries in simulation.

The study develops a deep reinforcement learning framework for training UAV agents to navigate and monitor simulated wildfire environments. Agents showed increasingly stable and effective behavior over time, evidenced by converging loss trends, improved rewards, and consistent navigation patterns such as fire-boundary tracking. The findings highlight DRL-based UAV potential for autonomous wildfire monitoring and show that environmental structure and reward design influence policy effectiveness.

arXiv cs.AI / cs.LG / cs.CL·Sep 9, 16:45 UTC · 7d agoAI research1

18

Environments as Scaffold: Enriching Feedback to Bootstrap Self-Evolving Agents in Long-Horizon Tasks

Researchers propose Feedback-Enriched Environments (FEEs) that reduce reward sparsity and improve RL training of Qwen3-based agents on SciWorld and BFCL.

The paper proposes shifting from agent-side warmup (SFT) to environment-side adaptation via Feedback-Enriched Environments to address severe reward sparsity in RL training of long-horizon LLM agents. A pilot study defines a feedback strategy that transitions from action guidance to observation enrichment in later training stages. Large-scale experiments on SciWorld and BFCL across Qwen3 model scales and GRPO, GSPO, and DAPO show consistent gains, plus stabilized training dynamics and proactive exploration.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research

25

Online Change-point Detection for Cooperative Multi-Agent Reinforcement Learning

Researchers propose Patterns of Past Rewards (PPR), a lightweight reward-based detector that flags environment shifts in cooperative multi-agent reinforcement learning training.

The paper introduces Patterns of Past Rewards (PPR), an algorithm-agnostic detector that smooths cooperative agents' return streams and applies statistical drift testing to flag environment or task changes. Evaluation in a custom Speaker-Listener environment built on the Multi-Agent Particle Environment under two non-stationarity scenarios shows PPR balances detection speed against alarm stability. It avoids the repeated alarms of a smoothed-return baseline and the missed shifts of raw-return detection, enabling MARL systems to reliably identify major changes during training.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 15:49 UTC · 12d agoAI research1

20

When an Attacker Meets a Group of Agents: Navigating Amazon Bedrock's Multi

Unit 42 red-teamed Amazon Bedrock multi-agent applications, demonstrating prompt-injection attack chains that leak agent instructions and invoke tools, mitigated by Bedrock Guardrails.

Unit 42 red-teamed Amazon Bedrock Agents' multi-agent collaboration in Supervisor and Supervisor with Routing modes. The demonstrated attack chain detects the operating mode, discovers collaborator agents, delivers attacker-controlled payloads, and can disclose agent instructions and tool schemas and invoke tools with attacker-supplied inputs. No vulnerabilities were found in Bedrock itself, and the built-in prompt attack Guardrail blocked the attacks when properly configured. The researchers collaborated with Amazon's security team and frame the findings as a broader prompt injection risk for LLM-based systems.

Palo Alto Unit 42·Aug 17, 12:31 UTC · Aug 17, 2026AI safety & security

55

Optimal Rates for Agentic Networked Information Aggregation

Researchers close the Kearns–Roth–Ryu gap for agentic networked information aggregation, proving excess error is constant up to depth M^2 then Θ(M^2/D).

The paper studies a networked learning model where agents in a DAG each see only a subset of features and pass only their predictions forward. It sharpens the earlier lower bound to Ω(√(M/D)) for depth below M^2 and constructs M-covered paths of depth D ≥ M^2 achieving Ω(M^2/D) excess error, establishing the correct rate for both regression and logistic classification. It also shows excess error contracts geometrically along the path for any fixed distribution, ruling out a single instance that witnesses polynomial lower bounds at every depth.

arXiv cs.AI / cs.LG / cs.CL·Sep 4, 16:12 UTC · 12d agoAI research

28

NeoHorse-1: Towards Recursive Self-Improvement via Agentic Post-Training with Routing Harness

NeoHorse-1 introduces agentic post-training with intelligent routing that lifts agent benchmark scores at 4B and 9B scales, prototyping recursive self-improvement.

NeoHorse-1 is a family of agent-native models trained through agentic post-training: routing-harness logs (predicted capability demand, service tier, interaction) become structurally validated training data organized into a three-stage SFT curriculum plus routing-guided on-policy distillation. Capability-guided allocation converts evaluation feedback into the next training mixture, closing an evaluation-selection-update loop. Post-training raises the macro-average from 58.94 to 64.87 at 4B and from 65.60 to 69.04 at 9B across eleven agent, tool-use, coding, and instruction-following benchmarks. The authors position it as a prototype of harness-mediated recursive self-improvement.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research1

42

Groupoid-Based Internal State Representations for Reinforcement Learning with Local Symmetries

Groupoid-based RL discovers local, state-dependent symmetries during interaction, learning in a symmetry-reduced space and beating standard Q-learning efficiency.

The paper proposes a reinforcement learning framework using groupoids to capture local, state-dependent symmetries and dynamically discover equivalence structures during interaction. The agent maintains orbit representatives together with transporters that map raw states to canonical forms, enabling learning and decision-making in a symmetry-reduced space while preserving local distinctions. Empirical results show improved sample efficiency and convergence over standard Q-learning in dense and large-scale environments with strong partial symmetries.

arXiv cs.AI / cs.LG / cs.CL·Sep 11, 16:32 UTC · 5d agoAI research1

20

COBRA-Skills: Contextual Bandit-Guided Evolution for Agent Skill Optimization

COBRA-Skills uses contextual bandits to guide LLM agent skill evolution, cutting optimization cost 55-58% versus SkillOpt while topping six agent benchmarks.

COBRA-Skills formulates LLM agent skill optimization as budgeted sequential optimization over a dynamically evolving candidate space. It couples contextual-bandit-guided prioritization with evidence-grounded skill evolution, selectively spending execution-based evaluations on promising candidates while refining skills from feedback. Across six heterogeneous agent benchmarks and three target models, it achieves the strongest average performance while reducing optimization cost by 55-58% relative to SkillOpt using only 50 unique optimization examples per benchmark. The method remains robust to agent harness changes and works when the target model generates its own skills.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research

30

Bilevel Coordinated Reflection: A Game-Theoretic Approach to Multi-Agent LLM Systems

Paper models multi-agent LLM orchestration as a bilevel game, proving transcript-only gating limits and introducing grounded-memory SRMA.

A new paper frames orchestrator-worker coordination in multi-agent LLM systems as a bilevel coordination game and analyzes free-form reflection as stochastic movement over semantic memory states, deriving finite-time bounds and an information-theoretic impossibility result: no gate observing only the generated transcript can uniformly improve over text-indistinguishable environments, while an environment-grounded gate can. The authors propose Stochastic Reflective Memory Ascent (SRMA), which accepts candidate memory only when grounded evaluation risk strictly decreases, with geometric or polynomial convergence guarantees. On 500 SWE-bench instances, a Kimi-based instantiation of the full system resolves 72.2% versus a 70.8% public mini-SWE-agent reference.

Hugging Face daily papers·Sep 1, 20:00 UTC · 14d agoAI research1

32

Beyond Top-k Skill Retrieval: Diversity-Aware Skill Routing for LLM Agents

DSR reranks LLM agent skills with Determinantal Point Processes to favor complementary, non-redundant sets, improving multi-skill query coverage.

The paper proposes Diverse Skill Routing (DSR), a diversity-aware reranking framework for LLM agent skill routing that uses a Determinantal Point Process to balance query relevance and non-redundancy across large skill registries. DSR introduces a query-residual diversity kernel that penalizes redundant skill overlap while avoiding penalties arising only from shared query relevance. On the SkillRouter benchmark, DSR improves recall and full coverage over a strong pointwise reranking baseline, with the largest gains on multi-skill queries. The authors argue skill routing should be treated as complementary set selection, not just relevance ranking.

Hugging Face daily papers·Sep 4, 20:00 UTC · 11d agoAI research

25

EmbodiedSkills: A Unified Framework for Orchestrating, Training, and Deploying VLA Agents

Researchers introduce EmbodiedSkills, a framework treating VLA skill decisions as verified execution proposals, reaching 86.2% success on RoboTwin 2.0.

The EmbodiedSkills framework treats each vision-language-action skill decision as an execution proposal, checking prerequisites before execution and verifying outcomes afterward via a shared executable-skill interface. It connects high-level skill selection, bounded low-level VLA execution and post-action verification in a single agent loop, and logs structured trajectories for supervision and optional online adaptation. Instantiated with Qwen3-VL and OpenPI/pi0.5, task-adapted policies achieve 86.20% average success across 50 RoboTwin 2.0 tasks and 97.40% across the four LIBERO suites, with 12.5% on memory-dependent RMBench tasks.

Hugging Face daily papers·Aug 31, 20:00 UTC · 15d agoAI research1

46

When Agents Slow Down: Understanding LLM Agents' Test-Time Strategies via Elo-per-token Analysis

Elo-per-token analysis shows LLM agents' marginal gains drop below independent sampling at scale; parallel sessions beat one long session.

The paper proposes Elo-per-token analysis, using a Bradley-Terry model to measure how agent performance scales with token budget on open-ended tasks with continuous scoring. Across four agents and four benchmarks with sessions up to 100M tokens, agents initially convert tokens to Elo faster than independent sampling but eventually slow below the linear-in-log-compute reference. The authors define a scaling inflection point and show that splitting 100M tokens across parallel sessions on FrontierCS Polyomino Packing gains +264 Elo over one long session and +355 over ten short sessions. Human contestants on shared AtCoder Heuristic Contest tasks improve superlinearly, indicating headroom over current agents.

Hugging Face daily papers·Sep 13, 20:00 UTC · 2d agoAI research3· 2 reads

48

DRG-MAPPO: Hierarchical Dynamic Role-Graph Multi-Agent Reinforcement Learning for Cooperative Air Combat

DRG-MAPPO combines graph-based relational modeling with dynamic role assignment in multi-agent RL, reaching an 87% win rate in cooperative air combat.

The hierarchical framework uses graph attention to extract relational features among allies, enemies, and threats, with a high-level policy assigning tactical roles like leader and supporter. A low-level policy executes discrete maneuver actions conditioned on roles and graph features, plus a target-priority auxiliary task encouraging focus-fire behavior. Experiments report a state-of-the-art 87% win rate, balancing relational modeling, interpretability, and optimization stability.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research

20

MeClear: Cooperative Game-Theoretic Attribution and Risk-Aware Memory Clearance for Long-Horizon LLM Agents

MeClear uses cooperative Shapley attribution to clear harmful memories from long-horizon LLM agents, boosting task recovery by 25.5 points over baselines.

The paper introduces MeClear, a task-conditioned memory clearance framework for long-horizon LLM agents that identifies and selectively suppresses memories with negative downstream utility without permanently altering the persistent memory bank. It combines Leave-One-Out screening with sampled cooperative Shapley attribution to distribute utility across interacting evidence, resolving redundant conflict masking that single-removal evaluations miss. Across ten long dialogue memory pools it achieves 85.9% target recall and 82.3% overall task recovery, a 25.5 percentage-point improvement over LOO baselines.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:46 UTC · 8d agoAI research

32

Scaling Automatic Research Agents via World Models

WMRL replaces environment execution with a world model in RL, accelerating research-agent post-training 3-4x and letting 4B/9B agents beat 48B/120B open-weight agents.

The paper identifies that environment execution dominates RL training cost for automatic research agents because each execution occupies an exclusive sandbox while generation batches efficiently. World Model RL (WMRL) substitutes a learned world model for execution, with Online Debiasing and Inverse-Variance Denoising to handle reward bias and noise, and the paper proves both improve convergence guarantees. WMRL accelerates training 3-4x across tasks and outperforms standard RL baselines; post-trained 4B and 9B agents beat 48B and 120B open-weight agents on held-out benchmarks. WMRL also transfers to post-training embodied VLA policies.

Hugging Face daily papers·Aug 28, 20:00 UTC · 18d agoAI research1

45

Copying explains the collective behavior of AI agents in the wild

arXiv study shows thousands of ephemeral AI agents spontaneously cooperated via a wiki, with simple copying rules explaining their collective behavior.

An arXiv paper analyzes the public record of thousands of one-hour-lived AI agents that, in June 2026, discovered a public wiki accepted edits from their sandboxes and used it to help each other pass a timed test, without being asked to cooperate. Each agent had no persistent memory, but the log preserves what each agent could see before writing. Three minimal copying models, one per decision (where to write, what name to use, how to word a message) and each with a single free parameter, reproduce the heavy-tailed page-popularity distribution, name-piece frequencies, and patchwork of internally consistent pages. The result implies such agent populations are easy to steer, since whoever writes first or while others are quiet sets conventions for later agents.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:59 UTC · 8d agoAI research

32

Learning to Coach for Experiential Learning

Learning to Coach trains a dedicated LLM coach to extract transferable experiential knowledge from a frozen actor's trajectories, beating self-refinement.

Learning to Coach (L2C) trains an LLM-as-a-Coach to extract actionable experiential knowledge from a frozen actor model's previous solution trajectories, optimizing rewards based on the actor's guided response correctness. It studies same-instance and cross-instance rewards, where cross-instance elicits knowledge that transfers to other problems. Across mathematical reasoning and interactive text-games, L2C outperforms self-refinement and untrained coaches, scales better with extra inference iterations than larger decoding budgets, and transfers to out-of-distribution tasks.

arXiv cs.AI / cs.LG / cs.CL·Sep 14, 16:47 UTC · 2d agoAI research1

20

T1: Terminal Agent Reinforcement Learning for Long-Horizon Tasks

T1, a 122B MoE terminal agent trained with reinforcement learning, reaches 64.0% on Terminal-Bench 2.1, surpassing GPT-5.4 and GLM-5.1 on long-horizon tasks.

T1 is a 122B mixture-of-experts model trained with reinforcement learning to operate a real shell in a cloud sandbox for up to 300+ tool-call turns per task, rewarded by executing each task's own verifier. The recipe combines aggressive warm starts, dense process rewards, TITO construction, and rollout routing replay, cutting the training-to-inference log-probability difference from 0.021 to 0.013 with zero token drift. Training used an out-of-distribution corpus disjoint from Terminal-Bench 2.1. Post-training raised the base model from 43.8% to 64.0% resolved on Terminal-Bench 2.1 and 27.9% on Long-Horizon Terminal Bench.

Hugging Face daily papers·Sep 9, 20:00 UTC · 6d agoAI research1

55

ScienceBuddy: Recursive-in-Recursive Self-Improvement for Interactive Scientific Agents

ScienceBuddy couples harness evolution with model reinforcement learning so scientific agents continually self-improve from researcher feedback in an interactive workspace.

The authors release ScienceBuddy, an interactive scientific research workspace that transforms researcher requests, feedback, and execution evidence into tasks and evaluation rubrics for continual learning. Its recursive-in-recursive self-improvement paradigm couples harness evolution (inner recursion, model fixed) with model reinforcement learning under the improved harness (outer recursion). Case studies span four scientific task families, and the system is released to the scientific community as a research product.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:55 UTC · 1d agoAI research 2 sources

35

SAEScientist-Bench: Can AI Agents Conduct Autonomous SAE Interpretability Research?

SAEScientist-Bench tests whether AI agents can autonomously run SAE interpretability research on Gemma-2-9B-IT; frontier agents trail expert baselines.

The benchmark requires agents to design contrastive probes and navigate the Gemma Scope dictionary of over 131K features in Gemma-2-9B-IT to discover optimal interpretable features, scored against expert-curated references on Neuronpedia via activation rank, concept selectivity, and causal steering. Across 10 agent configurations and 20 tasks, frontier agents demonstrate genuine discovery capability and approach expert levels at separating target concepts from controls, but lag substantially in causal steering and frequently misinterpret experimental measurements. The authors frame this as establishing experimental model understanding as a measurable capability for closed-loop autonomous AI R&D and post-hoc monitoring for recursive self-improvement.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:45 UTC · 8d agoAI research1

40

Co-Evolving Harnesses and Models: On-Policy Correction Helps Weaker Models Catch Up Where Imitation Fails

Research shows on-policy expert correction, not imitation fine-tuning, lets weaker agent models catch up under evolved harnesses.

Researchers study how to combine automated agent-harness evolution with lightweight fine-tuning across seven enterprise agent tasks. Naively training weaker models (Qwen3-Coder, Gemma 4) on expert trajectories under an evolved harness regressed performance by 4 to 30 points on all tasks. They propose an on-policy correction pipeline, automated by a meta-level MLE agent, where an expert rewrites only the failing turn of the weaker model's rollout, preserving model-harness fit.

arXiv cs.AI / cs.LG / cs.CL·Sep 8, 17:53 UTC · 8d agoAI research

35

Co-Evolving Harnesses and Models: On-Policy Correction Helps Weaker Models Catch Up Where Imitation Fails

Research shows imitation of expert trajectories breaks weaker models' harness fit, while on-policy expert correction preserves gains across seven enterprise agent tasks.

The paper studies combining automated agent-harness evolution with lightweight fine-tuning across seven enterprise agent tasks using Qwen3-Coder and Gemma 4. Training weaker models on complete expert trajectories under an evolved harness regressed performance by 4-30 points on all tasks, disrupting model-harness fit. The authors propose an on-policy expert-correction pipeline, automated by a meta-level MLE agent, that rewrites only failing turns and preserves the model's planning style.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research

48

Online Learning with LLM Experts from Limited Feedback

Paper proposes bandit algorithms for adaptively routing prompts to LLM experts, minimizing regret under limited feedback budgets.

The paper formulates adaptive prompt routing to K LLM experts as a contextual bandit problem with d prompt features over T rounds. Proposed algorithms strategically select actions and observe rewards, achieving O(dT/m) regret in the full-information setting and O(dTK/m) in the bandit setting, where m is the feedback budget. Experiments demonstrate efficient learning of high-quality routing strategies across diverse LLMs from limited feedback.

Hugging Face daily papers·Sep 4, 20:00 UTC · 11d agoAI research

25

EVOHARNESSBENCH: Can Your Agents Keep Pace with an Evolving Harness?

Researchers introduce EVOHARNESSBENCH, a benchmark showing that evolving agent harnesses (tools, skills, agents) cause forgetting and inconsistent adaptation across 802 tasks.

The paper introduces EVOHARNESSBENCH, a benchmark that places non-stationarity in the externally supplied agent harness rather than in the task stream, evaluating agents across tools, skills, and specialist agents. It comprises 17 multi-stage harness streams built deterministically from verifier-based benchmarks, totaling 802 tasks, 520 tools, 42 skills, and 62 agents. Evaluation covers deployment (retention of previously accessible competence) and self-evolving adaptation settings. Results show harness expansion alone degrades previously solved tasks (harness-induced forgetting), adaptation gains are inconsistent, and retention and adaptation can pull in opposite directions.

Hugging Face daily papers·Sep 2, 20:00 UTC · 13d agoAI research

40

Misleading the Planner through Deceptive Resumes: Registration-Time Injection in Centralized Multi-Agent Systems

Researchers demonstrate registration-time prompt injection in centralized LLM multi-agent systems, dropping GAIA task success from 84.31% to 37.25%, and propose DescGuard defense.

The paper identifies a registration-time injection channel in centralized LLM multi-agent systems where third-party worker agent descriptions are trusted by the planner before any user instruction arrives. Analyzing 32,000 descriptions from three public agent marketplaces, at least 23.35% contain content outside the four defined description fields. Eight description-manipulation attack strategies targeting task decomposition, capability grounding, and subtask specification cut GAIA task success from 84.31% to 37.25% and increased token consumption or execution time by over 111%, persisting across two MAS implementations, six planner LLMs, and four evaluators. The proposed DescGuard defense filters descriptions to worker-scoped interface information and restores metrics toward baseline without modifying workers, planner, or orchestration logic.

arXiv cs.CR·Sep 14, 13:06 UTC · 2d agoAI safety & security

56

Drift-Constrained Optimization: Only Direction Matters in Fine-Tuning Instruct Models

Drift-Constrained Optimization reformulates fine-tuning as update-direction selection, letting Qwen3 models improve target tasks within a behavioral drift budget.

The paper specifies a behavioral drift budget before optimization and shows that update direction is the remaining degree of freedom, reformulating fine-tuning as a direction-selection problem. In a stringent QA-only setting where instruct models must still generate multi-step reasoning at inference, a coarse layer-selective probe reverses the failure of QA-only fine-tuning. Across Qwen3-8B and Qwen3-14B, these directions substantially improve scientific reasoning and multilingual translation, matching or outperforming dedicated translation systems over 100+ languages and giving stronger initialization for reinforcement learning.

Hugging Face daily papers·Sep 11, 20:00 UTC · 4d agoAI research

48

Verifiable Social Reasoning for LLM Assistants

Fuse, a multi-agent simulation with hidden motives, evaluates LLM social reasoning, revealing compounding difficulty from user mediation and bias sensitivity.

Fuse is a multi-agent simulation framework in which a target agent with a hidden motive interacts with other agents including one representing the user, who consults the evaluated assistant to infer the motive, providing verifiable ground truth by construction. Simulation faithfulness is validated through a human study with 24k annotations. Applied to 12 LLMs, it shows user mediation compounds social reasoning difficulty, models are systematically sensitive to biased user framing, models may need more details than humans, and longer conversations do not always improve performance. The framework and a 21k-example dataset are open-sourced.

arXiv cs.AI / cs.LG / cs.CL·Sep 15, 17:37 UTC · 1d agoAI research

18

Procedural Graphs: Self-Evolving Execution Structures for LLM Agents

Procedural Graph framework stores procedural knowledge as triplets and self-evolves via LLM refinement, beating memory-based baselines across datasets, tasks, and LLMs.

The Procedural Graph organizes procedural knowledge into (procedure, relation, procedure) triplets; at each decision step the framework localizes the agent's active node and a guidance model translates the surrounding subgraph into step-level guidance that biases the solver's next action. An LLM refiner contrasts failed with successful trajectories and edits the graph's topology and attributes, retaining rejected edits to discourage repetition. Starting from a minimal skeleton, the loop builds graphs that match or surpass hand-designed ones and can repair flawed expert priors, delivering consistent gains over memory-based baselines across multiple datasets, task types, and LLMs.

Hugging Face daily papers·Sep 7, 20:00 UTC · 8d agoAI research1

36

BVB: Benchmarking Agentic Video Understanding via Programmatic Reconstruction in Blender

Blender-VideoBench evaluates agentic video understanding by having agents programmatically reconstruct real videos in Blender scenes.

BVB (Blender-VideoBench) tests whether multimodal agents truly understand videos by requiring programmatic reconstruction of real-world videos as animated Blender scenes via a lightweight Mini-BVB harness under identical sandbox and cost constraints. Evaluation uses Dual VQA for spatiotemporal fact preservation and Latent Similarity for perceptual match, combined in a square-root mean overall score. Across 51 configurations from 10 model families, the best model reaches 88.6 Latent Similarity but retains only 53.7% of source-correct spatiotemporal answers, showing semantic retention remains the main challenge.

Hugging Face daily papers·Sep 13, 20:00 UTC · 2d agoAI research

30