Self-Duplicating Random Walks for Resilient Decentralized Learning on Graphs
<|reference_start|>Self-Duplicating Random Walks for Resilient Decentralized Learning on Graphs: Consider the setting of multiple random walks (RWs) on a graph executing a certain computational task. For instance, in decentralized learning via RWs, a model is updated at each iteration based on the local data of the visited node and then passed to a randomly chosen neighbor. RWs can fail due to node or link failures. The goal is to maintain a desired number of RWs to ensure failure resilience. Achieving this is challenging due to the lack of a central entity to track which RWs have failed to replace them with new ones by forking (duplicating) surviving ones. Without duplications, the number of RWs will eventually go to zero, causing a catastrophic failure of the system. We propose a decentralized algorithm called DECAFORK that can maintain the number of RWs in the graph around a desired value even in the presence of arbitrary RW failures. Nodes continuously estimate the number of surviving RWs by estimating their return time distribution and fork the RWs when failures are likely to happen. We present extensive numerical simulations that show the performance of DECAFORK regarding fast detection and reaction to failures. We further present theoretical guarantees on the performance of this algorithm.<|reference_end|>
@article{egger2024self-duplicating,
    title={Self-Duplicating Random Walks for Resilient Decentralized Learning on
  Graphs},
    author={Maximilian Egger, Ghadir Ayache, Rawad Bitar, Antonia Wachter-Zeh,
  Salim El Rouayheb},
    journal={arXiv preprint arXiv:2407.11762},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.11762},
    primaryClass={cs.LG cs.DC cs.IT math.IT stat.AP}
}