×
Feb 28, 2022 · We propose an iterative approach that is adversary-tolerant for least-squares problems. The algorithm utilizes simple statistics to guarantee convergence.
Feb 24, 2023 · In this paper, we propose an iterative approach that is adversary-tolerant for convex optimization problems.
Our goal is to develop a variant of the randomized Kaczmarz (RK) method [30] for adversarial workers to solve the linear system A x = b . For the reader's ...
Apr 18, 2022 · The algorithm utilizes simple statistics to guarantee convergence and is capable of learning the adversarial distributions. Additionally, the ...
Developing large-scale distributed methods that are robust to the presence of adversarial or corrupted workers ... This work analyzes the case where the Kaczmarz ...
Jun 27, 2024 · adversarial workers with high accuracy and tolerate varying levels of adversary rates. Key words. Randomized Kaczmarz, Adversarial Optimization, ...
The Kaczmarz method (KZ) and its variants, which are types of stochastic gradient descent (SGD) methods, have been extensively studied due to their simplicity ...
Co-authors ; Distributed randomized Kaczmarz for the adversarial workers. X Li, L Huang, D Needell. arXiv preprint arXiv:2203.00095, 2022. 2, 2022.
Developing large-scale distributed methods that are robust to the presence of adversarial or corrupted workers is an important part of making such methods ...
Sep 7, 2023 · ... distributed computing environments. This talk will focus on results in three areas, all related or applicable to the Kaczmarz methods ...
Missing: adversarial workers.