中文
相关论文

相关论文: DRACO: Byzantine-resilient Distributed Training vi…

200 篇论文

Network traffic prediction plays a crucial role in intelligent network operation. Traditional prediction methods often rely on centralized training, necessitating the transfer of vast amounts of traffic data to a central server. This…

机器学习 · 计算机科学 2025-05-27 Hui Ma , Kai Yang , Yang Jiao

We study Byzantine-resilient distributed multi-agent reinforcement learning (MARL), where agents must collaboratively learn optimal value functions over a compromised communication network. Existing resilient MARL approaches typically…

多智能体系统 · 计算机科学 2026-04-06 Haejoon Lee , Dimitra Panagou

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

In this paper, we propose an iterative scheme for distributed Byzantineresilient estimation of a gradient associated with a black-box model. Our algorithm is based on simultaneous perturbation, secure state estimation and two-timescale…

人工智能 · 计算机科学 2022-10-03 Alexandre Reiffers-Masson , Isabel Amigo

As the network scale increases, existing fully distributed solutions start to lag behind the real-world challenges such as (1) slow information propagation, (2) network communication failures, and (3) external adversarial attacks. In this…

机器学习 · 计算机科学 2023-07-28 Connor Mclaughlin , Matthew Ding , Denis Edogmus , Lili Su

This paper addresses federated learning (FL) in the context of malicious Byzantine attacks and data heterogeneity. We introduce a novel Robust Average Gradient Algorithm (RAGA), which uses the geometric median for aggregation and {allows…

机器学习 · 计算机科学 2025-09-30 Shiyuan Zuo , Xingrun Yan , Rongfei Fan , Han Hu , Hangguan Shan , Tony Q. S. Quek , Puning Zhao

Could a gradient aggregation rule (GAR) for distributed machine learning be both robust and fast? This paper answers by the affirmative through multi-Bulyan. Given $n$ workers, $f$ of which are arbitrary malicious (Byzantine) and $m=n-f$…

分布式、并行与集群计算 · 计算机科学 2021-02-08 El-Mahdi El-Mhamdi , Rachid Guerraoui , Sébastien Rouault

Numerous distributed tasks have to be handled in a setting where a fraction of nodes behaves Byzantine, that is, deviates arbitrarily from the intended protocol. Resilient, deterministic protocols rely on the detection of majorities to…

分布式、并行与集群计算 · 计算机科学 2025-02-10 Philipp Schneider

Federated learning is a distributed training framework vulnerable to Byzantine attacks, particularly when over 50% of clients are malicious or when datasets are highly non-independent and identically distributed (non-IID). Additionally,…

密码学与安全 · 计算机科学 2025-08-04 Haocheng Jiang , Hua Shen , Jixin Zhang , Willy Susilo , Mingwu Zhang

In this paper, we study a linear bandit optimization problem in a federated setting where a large collection of distributed agents collaboratively learn a common linear bandit model. Standard federated learning algorithms applied to this…

机器学习 · 计算机科学 2022-04-05 Ali Jadbabaie , Haochuan Li , Jian Qian , Yi Tian

We study adversary-resilient stochastic distributed optimization, in which $m$ machines can independently compute stochastic gradients, and cooperate to jointly optimize over their local objective functions. However, an $\alpha$-fraction of…

机器学习 · 计算机科学 2021-04-05 Zeyuan Allen-Zhu , Faeze Ebrahimian , Jerry Li , Dan Alistarh

We study distributed stochastic gradient descent (SGD) in the master-worker architecture under Byzantine attacks. We consider the heterogeneous data model, where different workers may have different local datasets, and we do not make any…

机器学习 · 统计学 2020-05-19 Deepesh Data , Suhas Diggavi

We consider gradient coding in the presence of an adversary controlling so-called malicious workers trying to corrupt the computations. Previous works propose the use of MDS codes to treat the responses from malicious workers as errors and…

信息论 · 计算机科学 2024-01-08 Christoph Hofmeister , Luis Maßny , Eitan Yaakobi , Rawad Bitar

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 the problem of Byzantine fault tolerance in a distributed optimization setting, where there is a group of $N$ agents communicating with a trusted centralized coordinator. Among these agents, there is a subset of $f$ agents that may…

最优化与控制 · 数学 2023-12-19 Amit Dutta , Thinh T. Doan , Jeffrey H. Reed

Recent years have witnessed a growing interest in the topic of min-max optimization, owing to its relevance in the context of generative adversarial networks (GANs), robust control and optimization, and reinforcement learning. Motivated by…

机器学习 · 计算机科学 2022-04-08 Arman Adibi , Aritra Mitra , George J. Pappas , Hamed Hassani

Recent developments and emerging use cases, such as smart Internet of Things (IoT) and Edge AI, have sparked considerable interest in the training of neural networks over fully decentralized (serverless) networks. One of the major…

机器学习 · 计算机科学 2025-01-30 Eunjeong Jeong , Marios Kountouris

The integration of edge computing in next-generation mobile networks is bringing low-latency and high-bandwidth ubiquitous connectivity to a myriad of cyber-physical systems. This will further boost the increasing intelligence that is being…

机器人学 · 计算机科学 2020-08-19 Wenshuai Zhao , Jorge Peña Queralta , Li Qingqing , Tomi Westerlund

Decentralized federated learning (DFL) enables collaborative model training without centralized trust, but it remains vulnerable to Byzantine clients that poison gradients under heterogeneous (Non-IID) data. Existing defenses face a…

机器学习 · 计算机科学 2025-12-16 Animesh Mishra

In this paper, we propose a zeroth-order resilient distributed online algorithm for networks under Byzantine edge attacks. We assume that both the edges attacked by Byzantine adversaries and the objective function are time-varying.…

最优化与控制 · 数学 2025-11-10 Yuhang Liu , Wenjun Mei