中文
相关论文

相关论文: GRANITE : a Byzantine-Resilient Dynamic Gossip Lea…

200 篇论文

Distributed learning has many computational benefits but is vulnerable to attacks from a subset of devices transmitting incorrect information. This paper investigates Byzantine-resilient algorithms in a decentralized setting, where devices…

机器学习 · 计算机科学 2025-07-04 Renaud Gaucher , Aymeric Dieuleveut , Hadrien Hendrikx

Federated learning has exhibited vulnerabilities to Byzantine attacks, where the Byzantine attackers can send arbitrary gradients to a central server to destroy the convergence and performance of the global model. A wealth of robust…

机器学习 · 计算机科学 2023-06-06 Yuchen Liu , Chen Chen , Lingjuan Lyu , Fangzhao Wu , Sai Wu , Gang Chen

In this paper, we study the challenging task of Byzantine-robust decentralized training on arbitrary communication graphs. Unlike federated learning where workers communicate through a server, workers in the decentralized environment can…

机器学习 · 计算机科学 2023-04-21 Lie He , Sai Praneeth Karimireddy , Martin Jaggi

In decentralized machine learning, different devices communicate in a peer-to-peer manner to collaboratively learn from each other's data. Such approaches are vulnerable to misbehaving (or Byzantine) devices. We introduce F-RG, a general…

最优化与控制 · 数学 2025-06-12 Renaud Gaucher , Aymeric Dieuleveut , Hadrien Hendrikx

Federated learning systems that jointly preserve Byzantine robustness and privacy have remained an open problem. Robust aggregation, the standard defense for Byzantine attacks, generally requires server access to individual updates or…

密码学与安全 · 计算机科学 2021-10-07 Raj Kiriti Velicheti , Derek Xia , Oluwasanmi Koyejo

Standard federated learning algorithms are vulnerable to adversarial nodes, a.k.a. Byzantine failures. To solve this issue, robust distributed learning algorithms have been developed, which typically replace parameter averaging by robust…

机器学习 · 计算机科学 2026-02-04 Renaud Gaucher , Aymeric Dieuleveut , Hadrien Hendrikx

Peer sampling is a first-class abstraction used in distributed systems for overlay management and information dissemination. The goal of peer sampling is to continuously build and refresh a partial and local view of the full membership of a…

分布式、并行与集群计算 · 计算机科学 2022-03-09 Matthieu Pigaglio , Joachim Bruneau-Queyreix , David Bromberg , Davide Frey , Etienne Rivière , Laurent Réveillère

Federated learning is a newly emerging distributed learning framework that facilitates the collaborative training of a shared global model among distributed participants with their privacy preserved. However, federated learning systems are…

分布式、并行与集群计算 · 计算机科学 2022-10-14 Minghui Li , Wei Wan , Jianrong Lu , Shengshan Hu , Junyu Shi , Leo Yu Zhang , Man Zhou , Yifeng Zheng

Privacy and Byzantine resilience are two indispensable requirements for a federated learning (FL) system. Although there have been extensive studies on privacy and Byzantine security in their own track, solutions that consider both remain…

机器学习 · 计算机科学 2023-08-03 Zihang Xiang , Tianhao Wang , Wanyu Lin , Di Wang

Machine learning has begun to play a central role in many applications. A multitude of these applications typically also involve datasets that are distributed across multiple computing devices/machines due to either design constraints…

机器学习 · 统计学 2022-06-16 Cheng Fang , Zhixiong Yang , Waheed U. Bajwa

Augustine et al. [DISC 2022] initiated the study of distributed graph algorithms in the presence of Byzantine nodes in the congested clique model. In this model, there is a set $B$ of Byzantine nodes, where $|B|$ is less than a third of the…

分布式、并行与集群计算 · 计算机科学 2025-11-03 David Cifuentes-Núñez , Pedro Montealegre , Ivan Rapaport

Federated Learning (FL) enables heterogeneous clients to collaboratively train a shared model without centralizing their raw data, offering an inherent level of privacy. However, gradients and model updates can still leak sensitive…

Federated learning has arisen as a mechanism to allow multiple participants to collaboratively train a model without sharing their data. In these settings, participants (workers) may not trust each other fully; for instance, a set of…

机器学习 · 计算机科学 2021-07-28 Kamala Varma , Yi Zhou , Nathalie Baracaldo , Ali Anwar

This paper jointly considers privacy preservation and Byzantine-robustness in decentralized learning. In a decentralized network, honest-but-curious agents faithfully follow the prescribed algorithm, but expect to infer their neighbors'…

机器学习 · 计算机科学 2024-10-15 Haoxiang Ye , Heng Zhu , Qing Ling

We propose three new robust aggregation rules for distributed synchronous Stochastic Gradient Descent~(SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the…

分布式、并行与集群计算 · 计算机科学 2018-03-28 Cong Xie , Oluwasanmi Koyejo , Indranil Gupta

In distributed learning systems, robustness issues may arise from two sources. On one hand, due to distributional shifts between training data and test data, the trained model could exhibit poor out-of-sample performance. On the other hand,…

机器学习 · 计算机科学 2022-11-01 Guanqiang Zhou , Ping Xu , Yue Wang , Zhi Tian

The proliferation of Internet of Things devices in critical infrastructure has created unprecedented cybersecurity challenges, necessitating collaborative threat detection mechanisms that preserve data privacy while maintaining robustness…

密码学与安全 · 计算机科学 2026-01-06 Milad Rahmati , Nima Rahmati

Federated recommendation systems can provide good performance without collecting users' private data, making them attractive. However, they are susceptible to low-cost poisoning attacks that can degrade their performance. In this paper, we…

机器学习 · 计算机科学 2020-06-16 Chen Chen , Jingfeng Zhang , Anthony K. H. Tung , Mohan Kankanhalli , Gang Chen

Federated learning (FL) enables collaborative model training across distributed clients without sharing raw data, but its robustness is threatened by Byzantine behaviors such as data and model poisoning. Existing defenses face fundamental…

密码学与安全 · 计算机科学 2025-09-12 Usama Zafar , André M. H. Teixeira , Salman Toor

We study distributed optimization over networks with Byzantine agents that may send arbitrary adversarial messages. We propose \emph{Gradient Tracking with Probabilistic Edge Dropout} (GT-PD), a stochastic gradient tracking method that…

机器学习 · 计算机科学 2026-04-07 Amirhossein Dezhboro , Fateme Maleki , Arman Adibi , Erfan Amini , Jose E. Ramirez-Marquez
‹ 上一页 1 2 3 10 下一页 ›