IN THIS BREAKDOWN · 10 SECTIONS
You can read 20% of this breakdown.
The paper in one minute
A multimodal agent reads instructions, looks at images, retrieves things from a memory bank and calls tools. Earlier work showed a single crafted input can make one such model misbehave. This ICML 2024 paper from Sea AI Lab asks what happens when many of these agents talk to each other and share memory.
The authors treat the group as a population process, the same mathematical shape as a textbook disease model. Agents are randomly paired each round, content can move from one agent's memory into another's, and each affected agent has some chance to return to normal each round. They place one bad input into a single agent's memory, among up to a million, and simulate.
The affected share rises along an S-shaped curve to a stable level. The key fact is the timing: the rounds needed to reach a given share grow with the logarithm of the group size, not linearly. A one-at-a-time attacker would have to act on each agent in turn, O(N) work; here the attacker acts once and waits O(log N) rounds. They also prove a clean threshold: the process persists if the spread rate exceeds twice the recovery rate, and otherwise decays to zero. A practical defense that forces the system below that threshold is left as an open problem.
Research notes: the problem, approach and results
rounds for one affected agent to reach a target share of the group, vs O(N) for a one-at-a-time attacker
the paper's provable condition: spread persists above this threshold, dies out at or below it
agents simulated; largely affected before round 32 from a single starting agent
Multimodal agents with shared memory and tools are deployed in groups, and nobody had measured what one compromised agent does to the rest.
Model a group of agents as a population process: pairs exchange content, one agent's memory can seed another's, and agents recover at some rate. Simulate up to one million agents to see whether one bad input spreads.
It spreads like an epidemic. When the spread rate beta exceeds twice the recovery rate gamma, the affected share rises to a stable level, and from one agent in N the group is largely affected in a number of rounds that grows with log N.
Why it matters to an FDE
The point is not the specific input. It is that shared memory turns one compromised agent into a system-wide problem, and the attacker's cost stops growing with the number of agents.
Memory is a propagation channel. When agents write to and read from a shared store, a single bad entry can move through the group. The question for any multi-agent design is simple: if one agent takes in something bad, what can it write that another agent will later read and act on?
Bigger fleets are not safer. Because spread is logarithmic in group size, a design that behaves well with three agents can behave very differently with three hundred.
The fix is structural. The paper's own condition is about recovery outrunning spread. In practice that means limiting which agents can write to shared memory, keeping provenance on every entry, and being able to quarantine or roll back, rather than scanning an input once.
Understand the mechanism. Try it on a real problem.
Unlock this breakdown and 157 more papers.
Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.
6 months · One payment · No auto-renewal
- ◇1 architecture diagram
- </>1 runnable code experiment
- ▦2 results tables
- ?5 interview questions with answers
- 03Key takeaways
The model, the threshold, the scaling, the baselines and three misreadings
Free account - 04How it works
The population equation, the threshold, and the proof-of-concept setup
Premium - 05The numbers that matter
The threshold, the scaling, the alignment baseline and the milestones
Premium - 06Try it yourself
Recompute the threshold, the limit, the log-N round count and the alignment baseline
Premium - 07Where it breaks
Simulation assumptions, homogeneity, the open defense, and a slip
Premium - 08Using it on a deployment
Containing one bad agent in a multi-agent system with shared memory
Premium - 09Interview angles
Five questions this paper prepares you for, with answer hints
Premium - 10Read next
Where to go from here on this site
Premium
