Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learning
원문 초록
In distributed learning agents aim at collaboratively solving a global learning problem. It becomes more and more likely that individual agents are malicious or faulty with an increasing size of the network. This leads to a degeneration or complete breakdown of the learning process. Classical aggregation schemes are prone to breakdown at small contamination rates, therefore robust aggregation schemes are sought for. While robust aggregation schemes can generally tolerate larger contamination rates, many have been shown to be susceptible to carefully crafted malicious attacks. In this work, we show how the sensitivity curve (SC), a classical tool from robust statistics, can be used to systematically derive optimal attack patterns against arbitrary robust aggregators, in most cases rendering them ineffective. We show the effectiveness of the proposed attack in multiple simulations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Generative Latent Kernel Modeling for Blind Motion Deblurring
Differentially Private Relational Learning with Entity-level Privacy Guarantees
EtiCor++: Towards Understanding Etiquettical Bias in LLMs
Fragility in Average Treatment Effect on the Treated under Limited Covariate Support
Assessing parameter identifiability of a hemodynamics PDE model using spectral surrogates and dimension reduction
ACCESS DENIED INC: The First Benchmark Environment for Sensitivity Awareness
토론
이 논문과 연결된 포럼 글이 아직 없습니다.