Randomized Kaczmarz in Adversarial Distributed Setting

arXiv:2302.14615v2 Announce Type: replace-cross
Abstract: Developing large-scale distributed methods that are robust to the presence of adversarial or corrupted workers is an important part of making such methods practical for real-world problems. In this paper, we propose an iterative approach that is adversary-tolerant for convex optimization problems. By leveraging simple statistics, our method ensures convergence and is capable of adapting to adversarial distributions. Additionally, the efficiency of the proposed methods for solving convex problems is shown in simulations with the …

adversarial adversary arxiv cs.cr cs.lg cs.na distributed important large making math.na math.oc optimization presence problems real scale simple statistics workers world