Vibeleaderboard
← All Intel
Intel / post

Sheaf-ADMM: agents with partial views negotiate to a correct global answer

Source
Sakana AI
Date
Sakana AI@SakanaAILabs
Thread · 4 parts

Excited to share our paper, “Learning Multi-Agent Coordination via Sheaf-ADMM” to be presented at #ICML2026 Blog: https://t.co/F5CVepgivO 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: 1. Local Guesses: Every agent looks at its limited view and proposes a solution. 2. 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. 3. 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. Read our full paper: https://t.co/RoOHfekjQE Code:

Learning Multi-Agent Coordination via Sheaf-ADMM https://t.co/dC6Tbng0AV

Official JAX/Flax implementation of Learning Multi-Agent Coordination via Sheaf-ADMM (ICML 2026). https://t.co/r0cRFMTORi

"Learning Multi-Agent Coordination via Sheaf-ADMM" will be presented at #ICML2026 Paper: https://t.co/VjerqefBYo Blog: https://t.co/F5CVepfKGg We propose a differentiable framework where agents solve local convex subproblems and coordinate via ADMM, with a network sheaf specifying which parts of neighboring solutions must agree. Agents with individually insufficient local views coordinate to produce correct global outputs, with improved robustness to distribution shift. https://t.co/OerPjpjkO5

Terms in this piece · Glossary
  • AI agent — An AI system that doesn't just answer once but works toward a goal in a loop — taking actions, reading the results, and deciding what to do next.
  • multi-agent — Using several AI agents on one problem — splitting work in parallel, checking each other, or filling different roles like planner and reviewer.
Why it matters

A concrete recipe for coordinating agents that each see only part of a problem, with released JAX code and a large margin over parameter-matched message-passing baselines.

More from Sakana AI
Recommended reads
Comments

Checking sign-in…

Loading comments…