The DOI matches its Crossref record; 122 of the 122 references it cites were found in a registry or an index.
Speeding Up Distributed Machine Learning Using Codes
Open accessAbstract
Codes are widely used in many engineering applications to offerrobustnessagainstnoise. In large-scale systems, there are several types of noise that can affect the performance of distributed machine learning algorithms—straggler nodes, system failures, or communication bottlenecks—but there has been little interaction cutting across codes, machine learning, and distributed systems. In this paper, we provide theoretical insights on howcodedsolutions can achieve significant gains compared with uncoded ones. We focus on two of the most basic building blocks of distributed learning algorithms:matrix multiplicationanddata shuffling. For matrix multiplication, we use codes to alleviate the effect of stragglers and show that if the number of homogeneous workers is$n$, and the runtime of each subtask has an exponential tail, coded computation can speed up distributed matrix multiplication by a factor of$\log n$. For data shuffling, we use codes to reduce communication bottlenecks, exploiting the excess in storage. We show that when a constant fraction$\alpha $of the data matrix can be cached at each worker, and$n$is the number of workers,coded shufflingreduces the communication cost by a factor of$\left({\alpha + \frac {1}{n}}\right)\gamma (n)$compared with uncoded shuffling, where$\gamma (n)$is the ratio of the cost of unicasting$n$messages to$n$users to multicasting a common message (of the same size) to$n$users. For instance,$\gamma (n) \simeq n$if multicasting a message to$n$users is as cheap as unicasting a message to one user. We also provide experimental results, corroborating our theoretical gains of the coded algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Data poisoning attacks may occur in two ways such as clean-label attack (adversary can poison correct class of data sample) and dirty-label attack (adversary try to misclassify the target label of training dataset) [147], [148].”
From Challenges, Applications and Design Aspects of Federated Learning: A Survey (2021) · cites this paper as [148]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 37,139
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shift
Ioffe, S., & Szegedy, C. (2015) · arXiv · doi:10.48550/arxiv.1502.03167 · Cited by 27,818
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 24,190
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate ShiftPreprint
Ioffe, S. (2024) · arXiv (Cornell University) · doi:10.57702/o9raffed · Cited by 15,273
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,917
Smith, D. K., & Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 12,385
(2010) · Cited by 4,411
Flagged first, then by citations
Research works printed but not linked: 3
- 10.1109/ISIT.2016.7541478 · DOI
- 2015, StarCluster
- 2015, Open MPI Open Source High Performance Computing
Cited by
Sorted by citations
Items 201–300 of 827
Latency Analysis for Distributed Coded Storage Systems
Badita, A., Parag, P., & Chamberland, J. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2909868 · Cited by 21
Optimal Server Selection for Straggler Mitigation
Badita, A., Parag, P., & Aggarwal, V. (2020) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2020.2973224 · Cited by 21
Wan, K., Sun, H., Ji, M., & Caire, G. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3107432 · Cited by 21
Tai, H., Khairalseed, M., & Hoyt, K. (2020) · Ultrasound in Medicine & Biology · doi:10.1016/j.ultrasmedbio.2020.06.001 · Cited by 21
Coded Stochastic ADMM for Decentralized Consensus Optimization With Edge Computing
Chen, H., Ye, Y., Xiao, M., Skoglund, M., & Poor, H. V. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3058116 · Cited by 21
Incentive Mechanism Design for Distributed Coded Machine Learning
Ding, N., Fang, Z., Duan, L., & Huang, J. (2021) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom42981.2021.9488672 · Cited by 21
Secure Batch Matrix Multiplication From Grouping Lagrange Encoding
Zhu, J., & Tang, X. (2020) · IEEE Communications Letters · doi:10.1109/lcomm.2020.3044727 · Cited by 20
Distributed asynchronous learning for multipath data transmission based on P-DDQN
Liu, K., Quan, W., Deyun Gao, A., Yu, C., Liu, M., & Zhang, Y. (2021) · China Communications · doi:10.23919/jcc.2021.08.005 · Cited by 20
Nguyen, C. T., Nguyen, D. N., Hoang, D. T., Phan, K. T., Niyato, D. T., Pham, H.-A., & Dutkiewicz, E. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3213256 · Cited by 21
Toward Byzantine-Robust Distributed Learning for Sentiment Classification on Social Media Platform
Zhang, H., Wu, J., Pan, Q., Bashir, A. K., & Omar, M. (2024) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2024.3361465 · Cited by 20
Coded Computing for Distributed Graph Analytics
Prakash, S., Reisizadeh, A., Pedarsani, R., & Avestimehr, A. S. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2999675 · Cited by 20
Self-citationNumerically Stable Binary Gradient Coding
Charalambides, N., Mahdavifar, H., & Hero, A. O. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174512 · Cited by 20
Non-Colluding Attacks Identification in Distributed Computing
Solanki, A., Cardone, M., & Mohajer, S. (2019) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw44776.2019.8989337 · Cited by 20
Heterogeneous Coded Computation across Heterogeneous Workers
Sun, Y., Zhao, J., Zhou, S., & Gündüz, D. (2019) · Globecom · doi:10.1109/globecom38437.2019.9014006 · Cited by 20
Bivariate Polynomial Coding for Efficient Distributed Matrix Multiplication
Hasircioglu, B., Gomez-Vilardebo, J., & Gündüz, D. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3105365 · Cited by 20
Two-layer accumulated quantized compression for communication-efficient federated learning: TLAQC
Ren, Y., Cao, Y., Ye, C., & Cheng, X. (2023) · Scientific Reports · doi:10.1038/s41598-023-38916-x · Cited by 19
Cascaded Coded Distributed Computing Schemes Based on Placement Delivery Arrays
Jiang, J., & Qu, L. (2020) · IEEE Access · doi:10.1109/access.2020.3043825 · Cited by 19
Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound
Hofmeister, C., Bitar, R., Xhemrishi, M., & Wachter-Zeh, A. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2022.3180941 · Cited by 18
Online job scheduling for distributed machine learning in optical circuit switch networks
Liu, L., Yu, H., Sun, G., Zhou, H., Li, Z., & Luo, S. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2020.106002 · Cited by 19
Job scheduling for distributed machine learning in optical WAN
Liu, L., Yu, H., Sun, G., Luo, L., Jin, Q., & Luo, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.06.007 · Cited by 19
Approximate Weighted C R Coded Matrix Multiplication
Charalambides, N., Pilancı, M., & Hero, A. O. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9413800 · Cited by 19
ϵ-Approximate Coded Matrix Multiplication Is Nearly Twice as Efficient as Exact Multiplication
Jeong, H., Devulapalli, A., Cadambe, V. R., & Calmon, F. P. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3099811 · Cited by 19
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy
Peng, P., Soljanin, E., & Whiting, P. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3127920 · Cited by 19
Secure Coded Multi-Party Computation for Massive Matrix OperationsPreprint
Nodehi, H. A., & Maddah-Ali, M. A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.04255 · Cited by 19
Private Secure Coded Computation
Kim, M., & Lee, J. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849252 · Cited by 18
Data Encoding Methods for Byzantine-Resilient Distributed Optimization
Data, D., Song, L., & Diggavi, S. N. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849857 · Cited by 18
Coded Computation Across Shared Heterogeneous Workers With Communication Delay
Sun, Y., Zhang, F., Zhao, J., Zhou, S., Niu, Z., & Gündüz, D. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3185905 · Cited by 18
Delay-Optimal Coded Offloading for Distributed Edge Computing in Fading Environments
He, X., Li, T., Jin, R., & Dai, H. (2022) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2022.3187427 · Cited by 18
Stochastic Resource Optimization for Wireless Powered Hybrid Coded Edge Computing Networks
Ng, W. C., Lim, W. Y. B., Xiong, Z., Niyato, D. T., Poor, H. V., Shen, X., & Miao, C. (2023) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2023.3246994 · Cited by 18
Location Privacy-Aware and Energy-Efficient Offloading for Distributed Edge Computing
He, Y., He, X., Jin, R., & Dai, H. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3257197 · Cited by 18
Masterless Coded Computing: A Fully-Distributed Coded FFT Algorithm
Jeong, H., Low, T. M., & Grover, P. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636047 · Cited by 18
Straggler Mitigation With Tiered Gradient Codes
Sasi, S., Lalitha, V., Aggarwal, V., & Rajan, B. S. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.2992721 · Cited by 18
Distributed Online Optimization over a Heterogeneous Network with Any-Batch Mirror Descent
Eshraghi, N., & Liang, B. (2020) · International Conference on Machine Learning · Cited by 18
Stochastic Gradient Coding for Flexible Straggler Mitigation in Distributed Learning
Bitar, R., Wootters, M. K., & Rouayheb, S. E. (2019) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw44776.2019.8989328 · Cited by 17
Cross-Iteration Coded Computing
Haddadpour, F., Yang, Y. L., Cadambe, V. R., & Grover, P. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8635933 · Cited by 17
Straggler Resilient Serverless Computing Based on Polar Codes
Bartan, B., & Pilancı, M. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919767 · Cited by 17
Erasure Coding for Distributed Matrix Multiplication for Matrices With Bounded Entries
Tang, L., Konstantinidis, K., & Ramamoorthy, A. (2018) · IEEE Communications Letters · doi:10.1109/lcomm.2018.2880213 · Cited by 17
CodedSketch: Coded Distributed Computation of Approximated Matrix Multiplication
Jahani-Nezhad, T., & Maddah-Ali, M. A. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849370 · Cited by 17
Liu, L., Jin, Q., Wang, D., Yu, H., Sun, G., & Luo, S. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2020.01.004 · Cited by 17
Adaptive Distributed Stochastic Gradient Descent for Minimizing Delay in the Presence of Stragglers
Hanna, S. K., Bitar, R., Parag, P., Dasari, V. R., & Rouayheb, S. E. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9053961 · Cited by 17
A Fundamental Storage-Communication Tradeoff for Distributed Computing With Straggling Nodes
Yan, Q., Wigger, M., Yang, S., & Tang, X. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2020.3020549 · Cited by 17
Coded Distributed Computing: Performance Limits and Code Designs
Jamali, M. V., Soleymani, M., & Mahdavifar, H. (2019) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw44776.2019.8989097 · Cited by 17
RaSA: Robust and Adaptive Secure Aggregation for Edge-Assisted Hierarchical Federated Learning
Wang, L., Huang, M., Zhang, Z., Li, M., Wang, J., & Gai, K. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3559411 · Cited by 17
Heterogeneity-Aware Gradient Coding for Tolerating and Leveraging Stragglers
Wang, H., Guo, S., Tang, B., Li, R., Yang, Y., Qu, Z., & Wang, Y. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3063180 · Cited by 17
Gradient Coding With Dynamic Clustering for Straggler-Tolerant Distributed Learning
Buyukates, B., Özfatura, E., Ulukuş, Ş., & Gündüz, D. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3166902 · Cited by 16
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation
Das, A. B., & Ramamoorthy, A. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2022.3186908 · Cited by 16
Latency Optimization for Luby Transform Coded Computation in Wireless Networks
Fang, B., Han, K., Wang, Z., & Chen, L. (2022) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2022.3189497 · Cited by 16
Robust Semi-Decentralized Federated Learning via Collaborative Relaying
Yemini, M., Saha, R., Özfatura, E., Gündüz, D., & Goldsmith, A. J. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3342095 · Cited by 16
Siren+: Robust Federated Learning With Proactive Alarming and Differential Privacy
Guo, H., Wang, H., Song, T., Yang, H., Ma, R., Jin, X., Xue, Z., & Guan, H. (2024) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2024.3362534 · Cited by 17
Fundamental Limits of Distributed Data Shuffling
Wan, K., Tuninetti, D., Ji, M., & Piantanida, P. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8635882 · Cited by 16
Lagrange Coded Computing with Sparsity Constraints
Fahim, M., & Cadambe, V. R. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919966 · Cited by 16
Computing in the air: An open airborne computing platform
Wang, B., Xie, J., Li, S., Wan, Y., Gu, Y., Fu, S., & Lu, K. (2019) · IET Communications · doi:10.1049/iet-com.2019.0515 · Cited by 16
Coding for Heterogeneous UAV-Based Networked Airborne Computing
Wang, B., Xie, J., Lu, K., Wan, Y., & Fu, S. (2019) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps45667.2019.9024694 · Cited by 16
Coded Elastic Computing on Machines With Heterogeneous Storage and Computation Speed
Woolsey, N., Chen, R., & Ji, M. (2021) · IEEE Transactions on Communications · doi:10.1109/tcomm.2021.3056089 · Cited by 16
Collaborative Decoding of Polynomial Codes for Distributed Computation
Subramaniam, A. M., Heidarzadeh, A., & Narayanan, K. R. (2019) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw44776.2019.8989254 · Cited by 16
Wireless Map-Reduce Distributed Computing with Full-Duplex Radios and Imperfect CSI
Ha, S., Zhang, J., Simeone, O., & Kang, J. (2019) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2019.8815393 · Cited by 16
Gradient Coding via the Stochastic Block ModelPreprint
Charles, Z., & Papailiopoulos, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.10378 · Cited by 16
Self-citationWireless for Machine LearningPreprint
Hellström, H., da Silva, J. M. D., Fodor, V., & Fischione, C. (2020) · arXiv.org · doi:10.48550/arxiv.2008.13492 · Cited by 19
Stochastic Coded Federated Learning with Convergence and Privacy Guarantees
Sun, Y., Shao, J., Li, S., Mao, Y., & Zhang, J. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834445 · Cited by 16
Byzantine Fault Tolerant Distributed Stochastic Gradient Descent Based on Over-the-Air Computation
Park, S., & Choi, W. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3162576 · Cited by 15
Nguyen, C.-H., Saputra, Y. M., Hoang, D. T., Nguyen, D. N., Nguyen, V., Xiao, Y. L., & Dutkiewicz, E. (2024) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2024.3365815 · Cited by 15
A Storage-Computation-Communication Tradeoff for Distributed Computing
Yan, Q., Yang, S., & Wigger, M. (2018) · International Symposium on Wireless Communication Systems · doi:10.1109/iswcs.2018.8491052 · Cited by 15
Locally Recoverable Coded Matrix Multiplication
Jeong, H., Ye, F., & Grover, P. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636019 · Cited by 15
On the Capacity of Computation Broadcast
Sun, H., & Jafar, S. A. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2959760 · Cited by 15
On the Fundamental Limits of Coded Data Shuffling for Distributed Machine Learning
Elmahdy, A., & Mohajer, S. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.2964547 · Cited by 15
Liu, L., Wang, R., Xie, C., Yang, P., Sudirman, S., Wang, F., & Li, R. (2019) · IEEE International Conference on Industrial Informatics (INDIN) · doi:10.1109/indin41052.2019.8972026 · Cited by 15
Bivariate Hermitian Polynomial Coding for Efficient Distributed Matrix Multiplication
Hasırcıoglu, B., Gómez-Vilardebó, J., & Gündüz, D. (2020) · Globecom · doi:10.1109/globecom42002.2020.9322629 · Cited by 15
A Coded Distributed Computing Framework for Task Offloading from Multi-UAV to Edge Servers
Guo, Y., Gu, S., Zhang, Q., Zhang, N., & Xiang, W. (2021) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc49053.2021.9417305 · Cited by 15
Coded sparse matrix computation schemes that leverage partial stragglers
Das, A. B., & Ramamoorthy, A. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518059 · Cited by 15
Adaptive Task Offloading in Coded Edge Computing: A Deep Reinforcement Learning Approach
Van, N. T. T., Hieu, N. Q., Van, N. T. T., Luong, N. C., Niyato, D. T., & Kim, D. I. (2021) · IEEE Communications Letters · doi:10.1109/lcomm.2021.3116036 · Cited by 15
Dynamics in Coded Edge Computing for IoT: A Fractional Evolutionary Game Approach
Han, Y., Niyato, D. T., Leung, C., Miao, C., & Kim, D. I. (2022) · IEEE Internet of Things Journal · doi:10.1109/jiot.2022.3143229 · Cited by 15
Generalized Lagrange Coded Computing: A Flexible Computation-Communication Tradeoff
Zhu, J., & Li, S. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834535 · Cited by 15
Optimal Task Allocation and Coding Design for Secure Coded Edge Computing
Cao, C., Wang, J., Wang, J., Lu, K., Zhou, J., Jukan, A., & Zhao, W. (2019) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2019.00111 · Cited by 15
Hierarchical Group Testing for Byzantine Attack Identification in Distributed Matrix Multiplication
Hong, S., Yang, H., & Lee, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3142364 · Cited by 15
The benefit of being flexible in distributed computation
Song, L., Srinivasavaradhan, S. R., & Fragouli, C. (2017) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2017.8278019 · Cited by 15
Stochastic Coded Federated Learning: Theoretical Analysis and Incentive Mechanism Design
Sun, Y., Shao, J., Mao, Y., Li, S., & Zhang, J. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3334732 · Cited by 16
MDS Variable Generation and Secure Summation With User Selection
Zhao, Y., & Sun, H. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3541551 · Cited by 22
Data Encoding for Byzantine-Resilient Distributed Gradient Descent
Data, D., Song, L., & Diggavi, S. N. (2018) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2018.8636017 · Cited by 14
Le Taureau: Deconstructing the Serverless Landscape & A Look Forward
Khandelwal, A., Kejariwal, A., & Ramasamy, K. (2020) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3318464.3383130 · Cited by 19
MDS Coded Task Offloading in Stochastic Wireless Edge Computing Networks
Ko, D., Chae, S. H., & Choi, W. (2021) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2021.3109448 · Cited by 14
Coding for Straggler Mitigation in Federated Learning
Kumar, S., Schlegel, R., Rosnes, E., & Amat, A. G. I. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9838986 · Cited by 14
Resilient Communication for Dynamic First Responder Teams in Disaster Management
Ramakrishnan, K. K., Yüksel, M., Seferoğlu, H., Chen, J., & Blalock, R. (2022) · IEEE Communications Magazine · doi:10.1109/mcom.003.2200015 · Cited by 14
Successive Approximation Coding for Distributed Matrix Multiplication
Kiani, S., & Draper, S. C. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2022.3190859 · Cited by 14
Coded Computing for Secure Boolean Computations
Yang, C.-S., & Avestimehr, A. S. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3055341 · Cited by 15
Bivariate Polynomial Codes for Secure Distributed Matrix Multiplication
Hasırcıoglu, B., Gómez-Vilardebó, J., & Gündüz, D. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3142355 · Cited by 14
Straggler-Resilient and Communication-Efficient Distributed Iterative Linear SolverPreprint
Haddadpour, F., Yang, Y. L., Chaudhari, M., Cadambe, V. R., & Grover, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.06140 · Cited by 14
Private and rateless adaptive coded matrix-vector multiplication
Bitar, R., Xing, Y., Keshtkarjahromi, Y., Dasari, V. R., Rouayheb, S. E., & Seferoğlu, H. (2021) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-020-01887-y · Cited by 13
Shi, Y., Yang, K., Yang, Z., & Zhou, Y. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-823817-2.00013-9 · Cited by 13
Accelerating Federated Learning on Non-IID Data Against Stragglers
Zhang, Y., Duan, L., & Cheung, N. M. (2022) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/seconworkshops56311.2022.9926402 · Cited by 13
Wang, B., Xie, J., Lu, K., Wan, Y., & Fu, S. (2022) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2022.3231179 · Cited by 13
Straggler- and Adversary-Tolerant Secure Distributed Matrix Multiplication Using Polynomial Codes
Byrne, E., Gnilke, O. W., & Kliewer, J. (2023) · Entropy · doi:10.3390/e25020266 · Cited by 13
Byzantine fault tolerance in distributed machine learning: a survey
Bouhata, D., Moumen, H., Mazari, J. A., & Bounceur, A. (2024) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/0952813x.2024.2391778 · Cited by 16
Hierarchical coded matrix multiplication
Kiani, S., Ferdinand, N. S., & Draper, S. C. (2019) · Canadian Workshop on Information Theory (CWIT) · doi:10.1109/cwit.2019.8929896 · Cited by 13
Block-Division-Based Wireless Coded Computation
Chen, L., Han, K., Du, Y., & Wang, Z. (2021) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2021.3125983 · Cited by 13
Price of Precision in Coded Distributed Matrix Multiplication: A Dimensional Analysis
Wang, J., Jia, Z., & Jafar, S. A. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw48936.2021.9611384 · Cited by 13
Speeding Up Private Distributed Matrix Multiplication via Bivariate Polynomial Codes
Hasırcıoglu, B., Gómez-Vilardebó, J., & Gündüz, D. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517739 · Cited by 12
Fan, L., Zhang, X., Zhao, Y., Sood, K., & Yu, S. (2023) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2023.3326331 · Cited by 12
Coded Federated Learning for Communication-Efficient Edge Computing: A Survey
Zhang, Y., Gao, T., Li, C., & Tan, C. W. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3423362 · Cited by 14
Jahani-Nezhad, T., Maddah-Ali, M. A., & Caire, G. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3577019 · Cited by 17
Exploiting Computation Replication in Multi-User Multi-Server Mobile Edge Computing Networks
Li, K., Tao, M., & Chen, Z. (2018) · Globecom · doi:10.1109/glocom.2018.8648075 · Cited by 12
Metadata
- Authors
- Lee, K., Lam, M., Pedarsani, R., Papailiopoulos, D., & Ramchandran, K.
- Affiliations
- Korea Advanced Institute of Science and Technology (KR)
- University of California, Berkeley (US)
- University of California, Santa Barbara (US)
- University of Wisconsin–Madison (US)
- Venue
- IEEE Transactions on Information Theory
- Published
- 2018-03
- Volume
- 64
- Issue
- 3
- Pages
- 1514-1529
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2268702383
- Cited by
- 829
- References
- 122
- Citations by year
- 2026: 24 · 2025: 56 · 2024: 79 · 2023: 101 · 2022: 111 · 2021: 148 · 2020: 130 · 2019: 105 · 2018: 48
- FWCI
- 54.46
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Information Theory (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Institute for Information & communications Technology Promotion(IITP) grant
- Korea government(MSIT) (2017-0-00694)
- Brain Korea 21 Plus Project, and NSF CIF grant (1703678)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Data Storage Technologies
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
- Keywords
- distributed learning, coded computing, straggler nodes, distributed matrix multiplication, data shuffling, communication bottleneck, multicast, caching
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
