Sakana AI's ICML double: multi-agent coordination without message-passing, and an optimizer merger nobody saw coming

Sakana AI's ICML double: multi-agent coordination without message-passing, and an optimizer merger nobody saw coming

Good morning ๐Ÿ‘‹ Sakana AI landed two papers at ICML 2026 this week, and the multi-agent one solves a coordination problem every agent-swarm builder keeps hitting.

In today's issue:

Get tomorrow's issue in your inbox.

One concise AI brief, sent after the signal clears the noise.


๐Ÿ”ญ THE ONE THING

๐Ÿงฉ Sakana AI's ICML double: multi-agent coordination without message-passing, and an optimizer merger nobody saw coming

Sakana AI got two papers into ICML 2026, and the more useful one solves a problem every agent-swarm builder has hit: agents solve their own slice of a task, then negotiate only where the pieces meet, instead of passing messages back and forth forever. On multi-agent Sudoku that's a 93% solve rate against 11% for the message-passing baseline. It also holds 86% accuracy under domain shift where a standard CNN drops to 11%, which is the number that actually matters if you're deploying anything outside a lab. The sleeper paper, same conference, same team, found that evolution strategies and consensus-based optimization are the same update rule wearing different clothes, and used that to build hybrid optimizers aimed at LLM merging. Builder read: if your agent swarms fall apart under distribution shift, read the Sheaf-ADMM paper before you reach for more message-passing bandwidth.


๐Ÿง  MODELS & RELEASES


๐Ÿ”ฌ RESEARCH HIGHLIGHTS


๐Ÿ”— QUICK LINKS


Go read the Sudoku numbers. A 93 vs. 11 split is the kind of gap hype normally can't produce.

Pradeep Perugu

Get inovAIte in your inbox.