Communication Efficient Generalized Tensor Factorization for Decentralized Healthcare Networks
Not on the map. Why?
Abstract (arXiv)
Tensor factorization has been proved as an efficient unsupervised learning approach for health data analysis, especially for computational phenotyping, where the high-dimensional Electronic Health Records (EHRs) with patients' history of medical procedures, medications, diagnosis, lab tests, etc., are converted to meaningful and interpretable medical concepts. Federated tensor factorization distributes the tensor computation to multiple workers under the coordination of a central server, which enables jointly learning the phenotypes across multiple hospitals while preserving the privacy of the patient information. However, existing federated tensor factorization algorithms encounter the single-point-failure issue with the involvement of the central server, which is not only easily exposed to external attacks but also limits the number of clients sharing information with the server under restricted uplink bandwidth. In this paper, we propose CiderTF, a communication-efficient decentralized generalized tensor factorization, which reduces the uplink communication cost by leveraging a four-level communication reduction strategy designed for a generalized tensor factorization, which has the flexibility of modeling different tensor distribution with multiple kinds of loss functions. Experiments on two real-world EHR datasets demonstrate that CiderTF achieves comparable convergence with a communication reduction up to 99.99%.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 59 references that are in the map. First posted on arXiv 3 Sep 2021.
Builds on
27 of 59 references.
References · 27
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2018Local SGD Converges Fast and Communicates Littlecited by 595
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
- 2018Sparsified SGD with Memorycited by 373
- 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 361
- 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
- 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 218
- 2018Don't Use Large Mini-Batches, Use Local SGDcited by 201
- 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 179
- 2020FetchSGD: Communication-Efficient Federated Learning with Sketchingcited by 178
- 2018cpSGD: Communication-efficient and differentially-private distributed SGDcited by 157
- 2018D2: Decentralized Training over Decentralized Datacited by 140
15 more
- 2018Communication Compression for Decentralized Trainingcited by 87
- 2019Communication-Efficient Distributed Blockwise Momentum SGD with Error-Feedbackcited by 49
- 2018Global Convergence of Block Coordinate Descent in Deep Learningcited by 38
- 2018Generalized Canonical Polyadic Tensor Decompositioncited by 34
- 2020SQuARM-SGD: Communication-Efficient Momentum SGD for Decentralized Optimizationcited by 31
- 2020Moniqua: Modulo Quantized Communication in Decentralized SGDcited by 24
- 2017Federated Tensor Factorization for Computational Phenotypingcited by 20
- 2019Stochastic Gradients for Large-Scale Tensor Decompositioncited by 16
- 2017SPARTan: Scalable PARAFAC2 for Large & Sparse Datacited by 13
- 2019Block-Randomized Stochastic Proximal Gradient for Low-Rank Tensor Factorizationcited by 12
- 2019Privacy-Preserving Tensor Factorization for Collaborative Health Data Analysiscited by 9
- 2014DFacTo: Distributed Factorization of Tensorscited by 8
- 2020Spatio-Temporal Tensor Sketching via Adaptive Samplingcited by 3
- 2021Temporal Network Embedding via Tensor Factorizationcited by 3
- 2020Blockchain Assisted Decentralized Federated Learning (BLADE-FL) with Lazy Clientscited by 2
Built on by
Not cited yet.