Random Walk Learning and the Pac-Man Attack
Xingran Chen, Parimal Parag, Rohit Bhagat, Zonghong Liu, Salim El Rouayheb

TL;DR
This paper identifies a new adversarial attack on random walk-based decentralized learning called the Pac-Man attack and proposes a decentralized duplication algorithm to mitigate it, ensuring convergence and robustness.
Contribution
The paper introduces the Pac-Man attack threat and the Average Crossing (AC) algorithm, providing theoretical guarantees and empirical validation for robust decentralized learning.
Findings
AC keeps RW population bounded under attack
RW-based stochastic gradient descent converges with AC despite attack
Phase transition observed in extinction probability as duplication threshold varies
Abstract
Random walk (RW)-based algorithms have long been popular in distributed systems due to low overheads and scalability, with recent growing applications in decentralized learning. However, their reliance on local interactions makes them inherently vulnerable to malicious behavior. In this work, we investigate an adversarial threat that we term the ``Pac-Man'' attack, in which a malicious node probabilistically terminates any RW that visits it. This stealthy behavior gradually eliminates active RWs from the network, effectively halting the learning process without triggering failure alarms. To counter this threat, we propose the Average Crossing (AC) algorithm--a fully decentralized mechanism for duplicating RWs to prevent RW extinction in the presence of Pac-Man. Our theoretical analysis establishes that (i) the RW population remains almost surely bounded under AC and (ii) RW-based…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
