cd /news/machine-learning/learning-multi-agent-coordination-vi… · home topics machine-learning article
[ARTICLE · art-48309] src=sakana.ai ↗ pub= topic=machine-learning verified=true sentiment=↑ positive

Learning Multi-Agent Coordination via Sheaf-ADMM

Researchers introduced Sheaf-ADMM, a framework for multi-agent coordination that divides complex tasks into overlapping pieces assigned to individual agents. In tests, it achieved a 93% solve rate on multi-agent Sudoku versus 11% for a baseline, and retained 86% accuracy on MNIST under domain shift where a standard CNN dropped to 11%. The framework makes coordination transparent by having agents negotiate through local guesses, conflict resolution, and memory of disagreements.

read2 min views9 publishedJul 4, 2026
Learning Multi-Agent Coordination via Sheaf-ADMM
Image: Sakana (auto-discovered)

Excited to share our paper, “Learning Multi-Agent Coordination via Sheaf-ADMM” to be presented at ICML 2026.

Most AI models process information as one giant, monolithic block. But in nature, intelligence often comes from a group of individuals working together, where each individual only has a limited view of the world.

We built a framework called Sheaf-ADMM to study how this kind of collective problem-solving works. We divide a complex task into smaller overlapping pieces, and assign one agent to each piece.

To solve the global puzzle, the agents negotiate in three simple steps:

Local Guesses: Every agent looks at its limited view and proposes a solution.

Finding Common Ground: Agents communicate with their direct neighbors to smooth out conflicts. They do not need to agree on everything, but they must agree on the boundaries where their tasks overlap.

Remembering Disagreements: If neighbors cannot agree, they keep a memory of that conflict. This memory forces them to try harder to compromise in the next round.

We tested this on problems where no single agent has enough information to succeed alone:

Multi-Agent Sudoku: Each agent sees only a single row, column, or 3x3 box. The framework achieved a 93% solve rate, while a parameter-matched message-passing baseline scored 11%.

Image Classification: When we tested canvas-size domain shifts, a standard CNN dropped to 11% accuracy on MNIST, while our method retained 86%.

Maze Pathfinding: Sheaf-ADMM matches a message-passing baseline’s accuracy while agents communicate over a 5-dimensional channel, 8x smaller than that required of the baseline (42).

Traditional message-passing networks hide their reasoning inside opaque hidden states. Our framework makes coordination completely transparent. You can watch exactly how local agents debate, compromise, and eventually reach a global consensus.

Sheaf-ADMM draws inspiration from two fields with long histories in distributed consensus: ADMM from distributed optimization, and sheaves from applied topology. We think these perspectives may offer insights for the distributed, multi-agent AI systems increasingly being built today.

── more in #machine-learning 4 stories · sorted by recency
── more on @sheaf-admm 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/learning-multi-agent…] indexed:0 read:2min 2026-07-04 ·