mlsanityData to 7 Oct 2026

Robust Collaborative Inference with Vertically Split Data Over Dynamic Device Environments

arXiv 2312.16638 ↗First posted 27 Dec 2023cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

When each edge device of a network only perceives a local part of the environment, collaborative inference across multiple devices is often needed to predict global properties of the environment. In safety-critical applications, collaborative inference must be robust to significant network failures caused by environmental disruptions or extreme weather. Existing collaborative learning approaches, such as privacy-focused Vertical Federated Learning (VFL), typically assume a centralized setup or that one device never fails. However, these assumptions make prior approaches susceptible to significant network failures. To address this problem, we first formalize the problem of robust collaborative inference over a dynamic network of devices that could experience significant network faults. Then, we develop a minimalistic yet impactful method called Multiple Aggregation with Gossip Rounds and Simulated Faults (MAGS) that synthesizes simulated faults via dropout, replication, and gossiping to significantly improve robustness over baselines. We also theoretically analyze our proposed approach to explain why each component enhances robustness. Extensive empirical results validate that MAGS is robust across a range of fault rates-including extreme fault rates.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 51 references that are in the map. First posted on arXiv 27 Dec 2023.

Builds on

26 of 51 references.

References · 26

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  3. 2018Split learning for health: Distributed deep learning without sharing raw patient datacited by 391
  4. 2022Vertical Federated Learning: Concepts, Advances and Challengescited by 104
  5. 2020VAFL: a Method of Vertical Asynchronous Federated Learningcited by 87
  6. 2023Decentralized Federated Learning: A Survey and Perspectivecited by 86
  7. 2019Peer-to-peer Federated Learning on Graphscited by 85
  8. 2021CAFE: Catastrophic Data Leakage in Vertical Federated Learningcited by 76
  9. 2021Fast Federated Learning in the Presence of Arbitrary Device Unavailabilitycited by 72
  10. 2023A Unified Theory of Diversity in Ensemble Learningcited by 71
  11. 2020Towards Flexible Device Participation in Federated Learningcited by 64
  12. 2022Communication-Efficient Adaptive Federated Learningcited by 55
14 more
  1. 2021Semi-Decentralized Federated Learning with Cooperative D2D Local Model Aggregationscited by 50
  2. 2022A Unified Analysis of Federated Learning with Arbitrary Client Participationcited by 45
  3. 2020SplitNN-driven Vertical Partitioningcited by 42
  4. 2021Secure Bilevel Asynchronous Vertical Federated Learning with Backward Updatingcited by 37
  5. 2022Compressed-VFL: Communication-Efficient Learning with Vertically Partitioned Datacited by 36
  6. 2018COLA: Decentralized Linear Learningcited by 30
  7. 2023A Survey on Decentralized Federated Learningcited by 27
  8. 2020Asynchronous Federated Learning with Reduced Number of Rounds and with Differential Privacy from Less Aggregated Gaussian Noisecited by 21
  9. 2022Flexible Vertical Federated Learning with Heterogeneous Partiescited by 20
  10. 2020On Convergence and Generalization of Dropout Trainingcited by 19
  11. 2023FedVS: Straggler-Resilient and Privacy-Preserving Vertical Federated Learning for Split Modelscited by 17
  12. 2023Connectivity-Aware Semi-Decentralized Federated Learning over Time-Varying D2D Networkscited by 13
  13. 2023Robust and IP-Protecting Vertical Federated Learning against Unexpected Quitting of Partiescited by 7
  14. 2023A Multi-Token Coordinate Descent Method for Semi-Decentralized Vertical Federated Learningcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.