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 401–500 of 827
Identifying Reliable Machines for Distributed Matrix-Vector Multiplication
Jain, S., Cardone, M., & Mohajer, S. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834447 · Cited by 7
Coding for Large-Scale Distributed Machine Learning
Xiao, M., & Skoglund, M. (2022) · Entropy · doi:10.3390/e24091284 · Cited by 7
Cascaded Coded Distributed Computing Schemes Based on Symmetric Designs
Jiang, J., Wang, W., & Zhou, L. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3211932 · Cited by 7
Wang, Q., Cui, Y., Li, C., Zou, J., & Xiong, H. (2023) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2023.3244084 · Cited by 7
Modular Polynomial Codes for Secure and Robust Distributed Matrix Multiplication
Karpuk, D., & Tajeddine, R. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3380738 · Cited by 7
Coding for Private and Secure Multiparty Computing
Yu, Q., Raviv, N., & Avestimehr, A. S. (2018) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2018.8613443 · Cited by 7
Coded State Machine -- Scaling State Machine Execution under Byzantine Faults
Li, S., Sahraei, S., Yu, M., Avestimehr, S., Kannan, S., & Viswanath, P. (2019) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3293611.3331573 · Cited by 7
Local Re-encoding for Coded Matrix Multiplication
Su, X., Zhong, X., Fan, X., & Li, J. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174041 · Cited by 7
Distributed Computation: Privacy, Straggler Mitigation, and Security Against Colluding Workers
Vaidya, K., & Rajan, B. S. (2020) · Globecom · doi:10.1109/globecom42002.2020.9322092 · Cited by 7
Byzantine-Tolerant Distributed Coordinate Descent
Data, D., & Diggavi, S. N. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849217 · Cited by 7
Serverless Straggler Mitigation using Local Error-Correcting CodesPreprint
Gupta, V., Carrano, D., Yang, Y. L., Shankar, V., Courtade, T. A., & Ramchandran, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2001.07490 · Cited by 7
Self-citationCoded Distributed Computing With Partial Recovery
Özfatura, E., Ulukuş, Ş., & Gündüz, D. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3133791 · Cited by 6
Kim, D., Park, H., Niyato, D. T., & Choi, J. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2022.3201550 · Cited by 6
Confidential Computing in Edge- Cloud Hierarchy
Alaverdyan, Y., Poghosyan, S., & Poghosyans, V. (2023) · International Journal of Computer Science and Information Technology · doi:10.5121/ijcsit.2023.15302 · Cited by 6
Group-Wise Verifiable Coded Computing Under Byzantine Attacks and Stragglers
Hong, S., Yang, H., Yoon, Y., & Lee, J. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3377929 · Cited by 6
Qiu, H., Zhu, K., & Niyato, D. T. (2024) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2024.3415165 · Cited by 6
Coded Decentralized Learning With Gradient Descent for Big Data Analytics
Yue, J., & Xiao, M. (2019) · IEEE Communications Letters · doi:10.1109/lcomm.2019.2930513 · Cited by 6
MDS coding is better than replication for job completion times
Duffy, K. R., & Shneer, S. (2020) · Operations Research Letters · doi:10.1016/j.orl.2020.11.010 · Cited by 6
Ng, J. S., Lim, W. Y. B., Xiong, Z., Garg, S., Niyato, D. T., & Leung, C. (2021) · IEEE International Conference on Communications workshops · doi:10.1109/iccworkshops50388.2021.9473796 · Cited by 6
Bartan, B., & Pilancı, M. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3247559 · Cited by 6
Rook Coding for Batch Matrix Multiplication
Soto, P., Fan, X., Saldivia, A., & Li, J. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3165201 · Cited by 6
Soft BIBD and Product Gradient Codes
Sakorikar, A., & Wang, L. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2022.3182943 · Cited by 6
Accelerating Distributed GNN Training by Codes
Wang, Y., Guan, T., Niu, D., Zou, Q., Zheng, H., Shi, C. ‐. R., & Xie, Y. (2023) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2023.3295184 · Cited by 6
Zhang, H., Wang, B., Wu, R., Xie, J., Wan, Y., Fu, S., & Lu, K. (2023) · Unmanned Systems · doi:10.1142/s2301385024420056 · Cited by 6
Product Lagrange Coded Computing
Subramaniam, A. M., Heidarzadeh, A., Pradhan, A. K., & Narayanan, K. R. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174440 · Cited by 6
Multi-Agent Reinforcement Learning Based Coded Computation for Mobile Ad Hoc Computing
Wang, B., Xie, J., Lu, K., Wan, Y., & Fu, S. (2021) · International Conference on Communications · doi:10.1109/icc42927.2021.9500600 · Cited by 6
Sequential Gradient Coding for Packet-Loss Networks
Krishnan, M. N., Hosseini, E., & Khisti, A. J. (2021) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2021.3102853 · Cited by 6
Opportunistic Coded Distributed Computing: An Evolutionary Game Approach
Han, Y., Niyato, D. T., Leung, C., & Kim, D. I. (2021) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc51323.2021.9498947 · Cited by 6
A locality-based lens for coded computation
Rudow, M., Rashmi, K. V., & Guruswami, V. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518056 · Cited by 6
Hierarchical Coded Matrix Multiplication in Heterogeneous Multihop Networks
Zhu, H., Chen, L., Zhao, N., Chen, Y., Wang, W., & Yu, F. R. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3164056 · Cited by 6
Rateless Sum-Recovery Codes For Distributed Non-Linear Computations
Mallick, A., & Joshi, G. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965760 · Cited by 6
Distributed Matrix Computations With Low-Weight Encodings
Das, A. B., Ramamoorthy, A., Love, D. J., & Brinton, C. G. (2023) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2023.3308768 · Cited by 6
Architectures for coded mobile edge computing
Li, S., Maddah-Ali, M. A., & Avestimehr, A. S. (2017) · IEEE Fog World Congress (FWC) · doi:10.1109/fwc.2017.8368530 · Cited by 6
Low Complexity Distributed Computing via Binary Matrices with Extension to Stragglers
Agrawal, S., & Krishnan, P. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174080 · Cited by 6
Regulating Workers in Federated Learning by Yardstick Competition
Sarikaya, Y., & Erçetin, Ö. (2020) · International ICST Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS) · doi:10.1145/3388831.3388843 · Cited by 6
Synergy via Redundancy: Adaptive Replication Strategies and Fundamental Limits
Joshi, G., & Kaushal, D. (2021) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2020.3047513 · Cited by 6
Single-Forking of Coded Subtasks for Straggler Mitigation
Badita, A., Parag, P., & Aggarwal, V. (2021) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2021.3075377 · Cited by 6
Coded FFT and Its Communication OverheadPreprint
Jeong, H., Low, T. M., & Grover, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.09891 · Cited by 6
Collage Inference: Tolerating Stragglers in Distributed Neural Network Inference using Coding.Preprint
Narra, K. G., Lin, Z., Ananthanarayanan, G., Avestimehr, S., & Annavaram, M. (2019) · arXiv (Cornell University) · Cited by 6
$C^{3}LES$: Codes for Coded Computation that Leverage StragglersPreprint
Das, A. B., Tang, L., & Ramamoorthy, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1809.06242 · Cited by 6
Rateless Codes for Private Distributed Matrix-Matrix MultiplicationPreprint
Bitar, R., Xhemrishi, M., & Wachter-Zeh, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.12925 · Cited by 6
Task-Aware Service Placement for Distributed Learning in Wireless Edge Networks
Cong, R., Zhao, Z., Wang, M., Min, G., Liu, J., & Mo, J. (2025) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2025.3539620 · Cited by 5
Network Coding Approaches for Distributed Computation over Lossy Wireless Networks
Fan, B., Tang, B., Qu, Z., & Ye, B. (2023) · Entropy · doi:10.3390/e25030428 · Cited by 5
Multiple-Task Coded Computing for Distributed Computation Framework: Modeling and Delay Analysis
Ji, Z., Chen, L., Fu, H., Zhao, X., Xu, J., Meng, L., & Liu, J. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3381711 · Cited by 5
Approximately Optimal Distributed Data Shuffling
Attia, M. A., & Tandon, R. (2018) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2018.8437325 · Cited by 5
Energy-Adaptive Error Correcting for Dynamic and Heterogeneous Networks
Jeong, H., & Grover, P. (2019) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2898366 · Cited by 5
Jangseung: A Guardian for Machine Learning Algorithms to Protect Against Poisoning Attacks
Wolf, S., Gamboa, W., & Borowczak, M. (2021) · IEEE International Smart Cities Conference (ISC2) · doi:10.1109/isc253183.2021.9562816 · Cited by 5
UAV-assisted Wireless Power Charging for Efficient Hybrid Coded Edge Computing Network
Ng, J. S., Ng, W. C., Lim, W. Y. B., Xiong, Z., Niyato, D. T., Leung, C., & Miao, C. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9838931 · Cited by 5
Fault-Tolerant Neuromorphic Computing on Nanoscale Crossbar Architectures
Roth, R. M. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965851 · Cited by 5
Decode-and-Compare: An Efficient Verification Scheme for Coded Distributed Edge Computing
Wang, J., Lu, Z., Fu, M., Wang, J., Lu, K., & Jukan, A. (2022) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2022.3228243 · Cited by 5
Straggler-Exploiting Fully Private Distributed Matrix Multiplication With Chebyshev Polynomials
Hong, S., Yang, H., Yoon, Y., & Lee, J. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3236385 · Cited by 5
Multi-User Distributed Computing Via Compressed Sensing
Khalesi, A., Daei, S., Kountouris, M., & Elia, P. (2023) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw55543.2023.10160241 · Cited by 5
Efficient Coded Multi-Party Computation at Edge Networks
Vedadi, E., Keshtkarjahromi, Y., & Seferoğlu, H. (2023) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2023.3326970 · Cited by 5
Iterative Sketching for Secure Coded Regression
Charalambides, N., Mahdavifar, H., Pilancı, M., & Hero, A. O. (2024) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2024.3384395 · Cited by 5
Qiu, H., Zhu, K., Luong, N. C., Niyato, D. T., & Wu, Q. (2024) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2024.3391317 · Cited by 5
Gradient Coding With Iterative Block Leverage Score Sampling
Charalambides, N., Pilancı, M., & Hero, A. O. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3420222 · Cited by 5
Access-Redundancy Tradeoffs in Quantized Linear Computations
Ramkumar, V., Raviv, N., & Tamo, I. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3425808 · Cited by 5
Algebraic Geometric Rook Codes for Coded Distributed Computing
Matthews, G. L., & Soto, P. (2024) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw61385.2024.10807041 · Cited by 5
Mapping Heterogeneity Does Not Affect Wireless Coded MapReduce
Lampiris, E., Zorrilla, D. J., & Elia, P. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849492 · Cited by 5
Homomorphic Computation in Reed-Muller Codes
Cho, J., Kim, Y.-S., & No, J. (2020) · IEEE Access · doi:10.1109/access.2020.3001120 · Cited by 5
Straggler-free Coding for Concurrent Matrix Multiplications
Soto, P., & Li, J. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174239 · Cited by 5
Horii, S. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174132 · Cited by 5
Decode-and-Compare: An Efficient Verification Scheme for Coded Edge Computing
Fu, M., Wang, J., Wang, J., Lu, K., Jukan, A., & Gu, F. (2020) · International Workshop on Quality of Service · doi:10.1109/iwqos49365.2020.9212828 · Cited by 5
Improved Private and Secure Distributed Matrix Multiplication
Li, J., & Hollanti, C. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517825 · Cited by 5
Rateless Codes for Distributed Non-linear Computations
Mallick, A., Smith, S. H., & Joshi, G. (2021) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc49272.2021.9594268 · Cited by 5
Toward Large-Scale Hybrid Edge Server Provision: An Online Mean Field Learning Approach
Wang, Z., Ye, J., & Lui, J. C. S. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3180781 · Cited by 5
Generalized Fractional Repetition Codes for Binary Coded Computations
Charalambides, N., Mahdavifar, H., & Hero, A. O. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3529680 · Cited by 5
Redundancy Scheduling in Systems with Bi-Modal Job Service Time Distributions
Behrouzi-Far, A., & Soljanin, E. (2019) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2019.8919929 · Cited by 5
Staleness and Stagglers in Distibuted Deep Image Analytics
Ravikumar, A., & Sriraman, H. (2021) · International Conference on Artificial Intelligence and Smart Energy (ICAIS) · doi:10.1109/icais50930.2021.9395782 · Cited by 5
Private and Secure Coded Computation in Straggler-Exploiting Distributed Matrix Multiplication
Yang, H., Hong, S., & Lee, J. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517789 · Cited by 5
Communication-Aware Scheduling of Serial Tasks for Dispersed ComputingPreprint
Yang, C.-S., Pedarsani, R., & Avestimehr, A. S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.06468 · Cited by 5
Self-citationPrivate Secure Coded ComputationPreprint
Kim, M., & Lee, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.00167 · Cited by 5
Parity-Checked Strassen AlgorithmPreprint
Wang, H.-P., & Duursma, I. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.15082 · Cited by 5
Verifiable Coded Computing: Towards Fast, Secure and Private Distributed Machine Learning.Preprint
Tang, T., Ali, R. E., Hashemi, H., Gangwani, T., Avestimehr, S., & Annavaram, M. (2021) · arXiv (Cornell University) · Cited by 5
Numerically Stable Binary Coded Computations.Preprint
Charalambides, N., Mahdavifar, H., & Hero, A. O. (2021) · arXiv (Cornell University) · Cited by 5
Enabling Low-Redundancy Proactive Fault Tolerance for Stream Machine Learning via Erasure Coding
Cheng, Z., Tang, L., Huang, Q., & Lee, P. P. C. (2021) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds53918.2021.00019 · Cited by 4
A Family of Binary Locally Repairable Codes for Coded Distributed Computing
Qharabagh, M. F., & Ardakani, M. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3322174 · Cited by 4
Zhu, J., Tang, H., Li, S., & Chang, Y. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3492071 · Cited by 4
Staleness Analysis in Asynchronous Optimization
Al-Lawati, H., & Draper, S. C. (2022) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2022.3163931 · Cited by 4
Straggler-Resilient Differentially-Private Decentralized Learning
Yakimenka, Y., Weng, C.-W., Lin, H.-Y., Rosnes, E., & Kliewer, J. (2022) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw54588.2022.9965898 · Cited by 6
Coded Distributed Computing for Sparse Functions With Structured Support
Brunero, F., Wan, K., Caire, G., & Elia, P. (2023) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw55543.2023.10160235 · Cited by 4
Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations
Das, A. B., Ramamoorthy, A., Love, D. J., & Brinton, C. G. (2023) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton58177.2023.10313473 · Cited by 4
Zhou, Y., Ye, Q., & Huang, H. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3394714 · Cited by 4
Censor-Hillel, K., Machino, Y., & Soto, P. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-60603-8_9 · Cited by 4
Jiang, Y., Ye, Q., Fapi, E. T., Sun, W., & Li, F. (2024) · IEEE Internet of Things Magazine · doi:10.1109/iotm.001.2300247 · Cited by 4
Speeding Up Distributed Learning via Sparse and Flexible Coded Computing
Zhang, J., He, X., & Dai, H. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3510293 · Cited by 4
Byzantine-Resilient Gradient Coding Through Local Gradient Computations
Hofmeister, C., Maßny, L., Yaakobi, E., & Bitar, R. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3542896 · Cited by 4
Cost-Efficient Distributed Learning via Combinatorial Multi-Armed Bandits
Egger, M., Bitar, R., Wachter-Zeh, A., & Gündüz, D. (2025) · Entropy · doi:10.3390/e27050541 · Cited by 4
Reliable Distributed Clustering with Redundant Data Assignment
Gandikota, V., Mazumdar, A., & Rawat, A. S. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174299 · Cited by 4
ASYNC: A Cloud Engine with Asynchrony and History for Distributed Machine Learning
Soori, S., Can, B., Gürbüzbalaban, M., & Dehnavi, M. M. (2020) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps47924.2020.00052 · Cited by 4
Chebyshev Polynomial Codes: Task Entanglement-based Coding for Distributed Matrix Multiplication
Hong, S., Yang, H., Yoon, Y., Cho, T. H., & Lee, J. (2021) · International Conference on Machine Learning · Cited by 4
Coded Matrix Chain Multiplication
Fan, X., Saldivia, A., Soto, P., & Li, J. (2021) · International Workshop on Quality of Service · doi:10.1109/iwqos52092.2021.9521282 · Cited by 4
Coding for Distributed Multi-Agent Reinforcement Learning
Wang, B., Xie, J., & Atanasov, N. (2021) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/icra48506.2021.9561645 · Cited by 4
Code-based Computation Offloading in Vehicular Fog Networks
Chen, F., Gao, Z., Liu, Z., Huang, L., & Tang, Y. (2021) · International Conference on Communications, Computing, Cybersecurity, and Informatics (CCCI) · doi:10.1109/ccci52664.2021.9583208 · Cited by 4
Adaptive Gap Entangled Polynomial Coding for Multi-Party Computation at the Edge
Vedadi, E., Keshtkarjahromi, Y., & Seferoğlu, H. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834594 · Cited by 4
POCache: Toward robust and configurable straggler tolerance with parity-only caching
Zhang, M., Wang, Q., Shen, Z., & Lee, P. P. C. (2022) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2022.05.004 · Cited by 4
Chen, W., & Tian, C. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834469 · Cited by 4
An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations
Das, A. B., & Ramamoorthy, A. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834346 · Cited by 4
Coded Matrix Computations for D2D-Enabled Linearized Federated Learning
Das, A. B., Ramamoorthy, A., Love, D. J., & Brinton, C. G. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095450 · Cited by 4
Coded matrix computation with gradient coding
Son, K., & Ramamoorthy, A. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206996 · Cited by 4
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
