Towards Explainable Multi-Party Learning: A Contrastive Knowledge Sharing Framework
Not on the map. Why?
Abstract (arXiv)
Multi-party learning provides solutions for training joint models with decentralized data under legal and practical constraints. However, traditional multi-party learning approaches are confronted with obstacles such as system heterogeneity, statistical heterogeneity, and incentive design. How to deal with these challenges and further improve the efficiency and performance of multi-party learning has become an urgent problem to be solved. In this paper, we propose a novel contrastive multi-party learning framework for knowledge refinement and sharing with an accountable incentive mechanism. Since the existing naive model parameter averaging method is contradictory to the learning paradigm of neural networks, we simulate the process of human cognition and communication, and analogy multi-party learning as a many-to-one knowledge sharing problem. The approach is capable of integrating the acquired explicit knowledge of each client in a transparent manner without privacy disclosure, and it reduces the dependence on data distribution and communication environments. The proposed scheme achieves significant improvement in model performance in a variety of scenarios, as we demonstrated through experiments on several real-world datasets.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 31 of its 53 references that are in the map. First posted on arXiv 14 Apr 2021.
Builds on
31 of 53 references.
References · 31
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2018Federated Optimization in Heterogeneous Networkscited by 2,971
- 2020Supervised Contrastive Learningcited by 2,803
- 2016Deep Learning with Differential Privacycited by 2,682
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,531
- 2018Federated Learning with Non-IID Datacited by 1,099
- 2019Deep Leakage from Gradientscited by 1,004
- 2020What Makes for Good Views for Contrastive Learning?cited by 843
- 2019Towards Federated Learning at Scale: System Designcited by 826
- 2018LEAF: A Benchmark for Federated Settingscited by 780
- 2020Ensemble Distillation for Robust Model Fusion in Federated Learningcited by 678
19 more
- 2018Local SGD Converges Fast and Communicates Littlecited by 595
- 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 558
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2018Object Detection with Deep Learning: A Reviewcited by 524
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 479
- 2019FedMD: Heterogenous Federated Learning via Model Distillationcited by 454
- 2019Robust and Communication-Efficient Federated Learning from Non-IID Datacited by 415
- 2018Adaptive Federated Learning in Resource Constrained Edge Computing Systemscited by 408
- 2018Analyzing Federated Learning through an Adversarial Lenscited by 346
- 2018Federated Learning via Over-the-Air Computationcited by 215
- 2019Contrastive Learning of Structured World Modelscited by 206
- 2017Revisiting Distributed Synchronous SGDcited by 142
- 2019Federated Learning for Wireless Communications: Motivation, Opportunities and Challengescited by 128
- 2019Communication-Efficient Federated Deep Learning with Asynchronous Model Update and Temporally Weighted Aggregationcited by 99
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2019Federated Learning for Edge Networks: Resource Optimization and Incentive Mechanismcited by 75
- 2017Contrastive Learning for Image Captioningcited by 54
- 2018Addressing the Item Cold-start Problem by Attribute-driven Active Learningcited by 33
- 2018On Multi-Layer Basis Pursuit, Efficient Algorithms and Convolutional Neural Networkscited by 20
Built on by
Not cited yet.