ZeroHour
DashboardNewsCVEsExploitsIncidentsAIBriefAnalyticsEntitiesWatchlistIOCsAsk the feedSourcesFeeds & APIKiosk mode

Search: “multi-agent”

14 stories in the last 30d

Searchkeywordsmart Sortlatesthotimportancerelevance
DomainAllCyberAIWindow24h3d7d30dAllIn the wildImportant onlyShow duplicates
CategoryAllAI safety & security 20AI research 15Threat actor 13Tools 6AI tools & infra 6AI industry 4Model release 3Research 3Data breach 2Industry 2Vulnerability 1Exploit / PoC 1
SeverityAllcritical 0high 11medium 11low 0info 54

Social Laws for Multi-agent Coordination in Stochastic Environments

Researchers extend social laws to stochastic, reward-based multi-agent environments, defining alpha-robustness and a verification method via Markov decision processes.

The paper extends the concept of social laws from deterministic, goal-based settings to stochastic, reward-based multi-agent environments. It introduces alpha-robustness, a measure of the guaranteed utility each agent retains while pursuing its optimal single-agent policy assuming all agents obey the social law. Robustness verification is reduced to solving a series of Markov decision processes, with empirical evaluations on toy environments.

arXiv cs.AI / cs.LG / cs.CL · 19h agoAI research

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 · 7d agoAI research

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 · 12d agoAI research1

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 · 15d agoAI research1

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 · 7d agoAI research1

HypoEvolve: Genetic Algorithms Enable Multi-Agent LLMs to Discover Scientific Hypotheses

HypoEvolve uses a generational genetic algorithm coordinating specialized LLM agents to generate scientific hypotheses, outperforming six baselines on cancer drug repurposing.

HypoEvolve is a framework that coordinates specialized LLM agents through a generational genetic algorithm to produce, revise, and retain scientific hypotheses with explicit collaboration roles. It evaluates drug repurposing hypotheses against external evidence from DepMap and Open Targets across 34 cancer types. It achieves the highest scores against six baselines, reaching DepMap selectivity of 0.171 versus 0.115 for the strongest baseline, and gains over single-pass generation generalize to held-out cancer types.

Hugging Face daily papersupdated · 2d agofirst · 3d agoAI research 2 sources

[AINews] OpenAI reports Navier-Stokes singularity find in 88 hours using Astra-next, roughly 10,000 agents and 130B tokens (>$40M), a contender for second ever Millennium Prize awarded

OpenAI-linked accounts claim roughly 10,000 AI agents produced a Navier-Stokes singularity result in 88 hours, pending mathematical verification.

OpenAI-affiliated accounts claim a system of roughly 10,000 agents, trained over about a year with multi-agent reinforcement learning, produced a finite-time singularity result related to the Navier-Stokes Millennium Problem. The claimed 88-hour runtime and 130B-token cost circulate only via social posts, and no preprint, theorem statement, or proof artifact is available. Acceptance by the mathematics community is unresolved, so the claim's epistemic status remains unknown. The roundup also notes Cognition's $48B and Mistral's $24B fundraises, GPT Image 2.5, and Meta's Muse agent relaunch.

Latent Space · 8d agoAI research1

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 · 9d agoAI research

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 · 1d agoAI research

RSIAgent: Autonomous Exploration for Recursive Self-improvement in New Environments

RSIAgent, a training-free multi-agent framework, builds reusable environment memory enabling Kimi-K3 and GLM-5.3 to beat GPT-6.

RSIAgent is a training-free framework for recursive self-improvement through autonomous memory construction, coordinating curriculum, actor, and verifier agents. It uses broad-then-deep exploration to capture environment structures, hidden constraints, and causal dependencies, and freezes the resulting memory for direct reuse without parameter updates. On OSWorld-v2 and Agent's Last Exam it substantially improves strong open-source models, enabling Kimi-K3 and GLM-5.3 to outperform frontier closed-source models including GPT-6.

Hugging Face daily papers · 3d agoAI research2

Agora: Git as Shared Memory for Collective AutoResearch

Agora records multi-agent research as an append-only Git DAG; 13 LLM workers ran nearly 12 days on a weight-transfer problem.

Agora stores every result, hypothesis, and verification as an immutable commit in a Git-stored DAG, with a derived index exposing the frontier and verification status of claims. In a nearly 12-day run, 13 language-model workers with no assigned tasks or central planner published 1,703 contributions on initializing a frozen 119.6M-parameter attention-SSM hybrid from 141 donor models. They improved the evaluator from 3.39 to 1.899 bits per byte, closing 62% of the gap to a trained GPT-2 124M, with 165 independent reproductions posted and none failing.

Hugging Face daily papers · 1d agoAI research

Decomposition Buys Integrity, Not Yield

Study of 600 production deep-research traces finds agent-tree decomposition loses findings at rate N^(1-δ); flat architectures maximize yield.

The paper models multi-agent decomposition as a tree where an agent holding b items retains each with probability r(b); with r(b)=1/b every tree delivers exactly one finding regardless of shape. Analysis of 600 production deep-research traces estimates delta=0.34 retention decay, and 1,012 annotated traces show one brief in sixteen goes off-target per tier, giving an alignment penalty of 0.536. Depth still cuts root context exposure from N to N^(1/k) and is cheaper at scale, with a hazard model over 743,819 production tool calls showing delegation is an opening move rather than a response to filling context.

arXiv cs.AI / cs.LG / cs.CL · 1d agoAI research

Agent Harness vs Agent Framework vs MCP: Which Layer Owns the Loop, State, Tools, Permissions, and Recovery

Architecture explainer separates agent harnesses, frameworks, and MCP by which layer owns the loop, state, permissions, and recovery.

The article distinguishes agent harnesses (OpenAI Codex, Claude Agent SDK), which own the execution loop, sandbox, permission model, and recovery; frameworks (LangGraph, OpenAI Agents SDK, Microsoft Agent Framework), which supply composable primitives; and MCP, a stateless JSON-RPC wire protocol governed by the Linux Foundation's Agentic AI Foundation since December 2025. An ownership matrix maps the execution loop, state, tool transport, permissions, recovery, sandboxing, and multi-agent orchestration to each layer. The 2026-07-28 MCP specification made the protocol fully stateless, retiring the initialize handshake and session headers.

MarkTechPost · 2d agoAI research1

OmniHarness: Harnessing Generalizable Visual Generation via Symbolic Policy Learning

OmniHarness learns symbolic policies for visual generation agents, reaching a 95.0% resolve rate on ComfyBench Creative tasks, 27.5 points above the strongest baseline.

OmniHarness abstracts verified executions into symbolic policies for visual generation task families, which are instantiated, adapted, and composed for new tasks while model parameters remain fixed. Intermediate verification guides refinement and failure recovery during execution, and self-directed inquiry generates practice tasks near capability limits before downstream objectives are specified. Experiments across six benchmarks, three MLLM backbones, and three visual agent frameworks show strong performance; on ComfyBench Creative tasks it achieves a 95.0% resolve rate, exceeding the strongest baseline by 27.5 percentage points. Frozen policy snapshots improve existing visual agent systems through plug-and-play reuse.

Hugging Face daily papers · 4d agoAI research