Trial and Trust: Addressing Byzantine Attacks with Comprehensive Defense Strategy

Recent advancements in machine learning have improved performance while also increasing computational demands. While federated and distributed setups address these issues, their structure is vulnerable to malicious influences. In this paper, we address a specific threat, Byzantine attacks, where compromised clients inject adversarial updates to derail global convergence. We combine the trust scores concept with trial function methodology to dynamically filter outliers. Our methods address the critical limitations of previous approaches, allowing functionality even when Byzantine nodes are in the majority. Moreover, our algorithms adapt to widely used scaled methods like Adam and RMSProp, as well as practical scenarios, including local training and partial participation. We validate the robustness of our methods by conducting extensive experiments on both synthetic and real ECG data collected from medical institutions. Furthermore, we provide a broad theoretical analysis of our algorithms and their extensions to aforementioned practical setups. The convergence guarantees of our methods are comparable to those of classical algorithms developed without Byzantine interference.

@article{molodtsov2025_2505.07614,
  title={ Trial and Trust: Addressing Byzantine Attacks with Comprehensive Defense Strategy },
  author={ Gleb Molodtsov and Daniil Medyakov and Sergey Skorik and Nikolas Khachaturov and Shahane Tigranyan and Vladimir Aletov and Aram Avetisyan and Martin Takáč and Aleksandr Beznosikov },
  journal={arXiv preprint arXiv:2505.07614},
  year={ 2025 }
}