GAL: Gradient Assisted Learning for Decentralized Multi-Organization Collaborations
Enmao Diao, Jie Ding, Vahid Tarokh
Abstract
Collaborations among multiple organizations, such as financial institutions, medical centers, and retail markets in decentralized settings are crucial to providing improved service and performance. However, the underlying organizations may have little interest in sharing their local data, models, and objective functions. These requirements have created new challenges for multi-organization collaboration. In this work, we propose Gradient Assisted Learning (GAL), a new method for multiple organizations to assist each other in supervised learning tasks without sharing local data, models, and objective functions. In this framework, all participants collaboratively optimize the aggregate of local loss functions, and each participant autonomously builds its own model by iteratively fitting the gradients of the overarching objective function. We also provide asymptotic convergence analysis and practical case studies of GAL. Experimental studies demonstrate that GAL can achieve performance close to centralized learning when all data, models, and objective functions are fully disclosed. Our code is available here 1 .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 8959589f-7de7-4769-929b-de08bf202fa0Cited by top-tier papers4
- A Unified Detection Framework for Inference-Stage Backdoor DefensesXun Xian, Ganghua Wang, Jayanth Srinivasa, Ashish Kundu et al.NeurIPS 2023 · 18 citations
- Pruning Deep Neural Networks from a Sparsity PerspectiveEnmao Diao, Ganghua Wang, Jiawei Zhang, Yuhong Yang et al.ICLR 2023 · 7 citations
- VertiBench: Advancing Feature Distribution Diversity in Vertical Federated Learning BenchmarksZhaomin Wu, Junyi Hou, Bingsheng HeICLR 2024 · 7 citations
- Probe Pruning: Accelerating LLMs through Dynamic Pruning via Model-ProbingQi Le, Enmao Diao, Ziyan Wang, Xinran Wang et al.ICLR 2025
Builds on13
- Towards Evaluating the Robustness of Neural NetworksNicholas Carlini, David A. WagnerS&P 2017 · 9,786 citations
- Stealing Machine Learning Models via Prediction APIsFlorian Tramèr, Fan Zhang, Ari Juels, Michael K. Reiter et al.USENIX Security 2016 · 2,088 citations
- Manipulating Machine Learning: Poisoning Attacks and Countermeasures for Regression LearningMatthew Jagielski, Alina Oprea, Battista Biggio, Chang Liu et al.S&P 2018 · 867 citations
- On Gradient Descent Ascent for Nonconvex-Concave Minimax ProblemsTianyi Lin, Chi Jin, Michael I. JordanICML 2020 · 587 citations
- LIRA: Learnable, Imperceptible and Robust Backdoor AttacksKhoa D. Doan, Yingjie Lao, Weijie Zhao, Ping LiICCV 2021 · 313 citations
Related papers
- Assisted Learning: A Framework for Multi-Organization LearningXun Xian, Xinran Wang, Jie Ding, Reza GhanadanNeurIPS 2020 · 37 citations
- Cross-Gradient Aggregation for Decentralized Learning from Non-IID DataYasaman Esfandiari, Sin Yong Tan, Zhanhong Jiang, Aditya Balu et al.ICML 2021 · 61 citations
- Collaborative Optimization and Aggregation for Decentralized Domain Generalization and AdaptationGuile Wu, Shaogang GongICCV 2021 · 88 citations
- Federated Multi-Objective LearningHaibo Yang, Zhuqing Liu, Jia Liu, Chaosheng Dong et al.NeurIPS 2023 · 28 citations
- Fast Training Method for Stochastic Compositional Optimization ProblemsHongchang Gao, Heng HuangNeurIPS 2021 · 17 citations
