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 501–600 of 827
Creating Robust Deep Neural Networks with Coded Distributed Computing for IoT
Hadidi, R., Cao, J., Asgari, B., & Kim, H. (2023) · IEEE International Conference on Edge Computing and Communications (EDGE) · doi:10.1109/edge60047.2023.00029 · Cited by 4
Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off
Bitar, R., Egger, M., Wachter-Zeh, A., & Xhemrishi, M. (2024) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2024.3394256 · Cited by 4
Fault-Tolerant Parallel Integer Multiplication
Nissim, R., Schwartz, O., & Spiizer, Y. (2024) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3626183.3659961 · Cited by 4
Fully Robust Federated Submodel Learning in a Distributed Storage System
Wang, Z., & Ulukuş, Ş. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3506990 · Cited by 5
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers
Jinan, R., Badita, A., Sarvepalli, P. K., & Parag, P. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3152182 · Cited by 4
Secure Linear MDS Coded Matrix Inversion
Charalambides, N., Pilancı, M., & Hero, A. O. (2022) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton49937.2022.9929386 · Cited by 4
Pliable Data Shuffling for On-device Distributed Learning
Jiang, T., Yang, K., & Shi, Y. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8682270 · Cited by 4
Tegin, B., Hernandez, E. E., Rini, S., & Duman, T. M. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3118350 · Cited by 4
TACC: Topology-Aware Coded Computing for Distributed Graph Processing
Güler, B., Avestimehr, A. S., & Ortega, A. (2020) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2020.2998223 · Cited by 4
Distributed Averaging Methods for Randomized Second Order OptimizationPreprint
Bartan, B., & Pilancı, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.06540 · Cited by 4
Zhang, F., Han, G., Liu, L., Jiang, J., Li, A., & Zhu, S. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3506595 · Cited by 3
Zhou, Y., Ye, Q., & Huang, H. (2025) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2025.3614383 · Cited by 3
Retracted: Moving toward an intelligent edge: Machine Learning and Wireless Communication
Patil, P. P., Perez-Mendoza, A., Joshi, K. K., Shah, H., Pillai, B. G., & Chakravarthi, M. K. (2023) · International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE) · doi:10.1109/icacite57410.2023.10182477 · Cited by 3
RetractedTwo-Stage Coded Distributed Learning: A Dynamic Partial Gradient Coding Perspective
Wang, X., Zhong, X., Ning, J., Yang, T., Yang, Y., Tang, G., & Liu, F. (2023) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs57875.2023.00020 · Cited by 3
2D-SAZD: A Novel 2D Coded Distributed Computing Framework for Matrix-Matrix Multiplication
Dai, M., Zhang, Z., Zheng, Z., Zhang, Z., Lin, X., & Wang, H. (2024) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2024.3395931 · Cited by 3
An Efficient Secure Coded Edge Computing Scheme Using Orthogonal Vector
Zhou, W., Wang, J., Li, L., Wang, J., Lu, K., & Zhou, X. (2019) · IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) · doi:10.1109/ispa-bdcloud-sustaincom-socialcom48970.2019.00025 · Cited by 3
An Online Mean Field Approach for Hybrid Edge Server Provision
Wang, Z., Ye, J., & Lui, J. C. S. (2021) · ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing (MobiHoc) · doi:10.1145/3466772.3467042 · Cited by 3
Optimize Coding and Node Selection for Coded Distributed Computing over Wireless Edge Networks
Nguyen, C. T., Nguyen, D. N., Hoang, D. T., Pham, H.-A., & Dutkiewicz, E. (2022) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc51071.2022.9771781 · Cited by 3
Local Re-Encoding for Coded Matrix Multiplication
Su, X., Parker, J., Zhong, X., Fan, X., & Li, J. (2022) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2022.3194130 · Cited by 3
Computational Code-Based Privacy in Coded Federated Learning
Xhemrishi, M., Amat, A. G. I., Rosnes, E., & Wachter-Zeh, A. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834802 · Cited by 3
Transition Waste Optimization for Coded Elastic Computing
Dau, S. H., Gabrys, R., Huang, Y.-C., Feng, C., Luu, Q.-H., Alzahrani, E. J., & Tari, Z. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3247860 · Cited by 3
Fast and Straggler-Tolerant Distributed SGD with Reduced Computation Load
Egger, M., Hanna, S. K., & Bitar, R. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206449 · Cited by 3
Coded Parallelism for Distributed Deep Learning
Ji, S., Zhang, Z., Yang, Z., Jin, R., & Yang, Q. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206933 · Cited by 3
Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance
Egger, M., Xhemrishi, M., Wachter-Zeh, A., & Bitar, R. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206979 · Cited by 3
Dynamic Power Control for Delay-Optimal Coded Edge Computing
Geng, D., He, X., Jin, R., & Dai, H. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3307140 · Cited by 3
Securely Aggregated Coded Matrix Inversion
Charalambides, N., Pilancı, M., & Hero, A. O. (2023) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2023.3312233 · Cited by 3
Coded Distributed Multiplication for Matrices of Different Sparsity Levels
Lin, J.-A., Huang, Y.-C., Lee, M., & Chen, P. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3326193 · Cited by 3
Matrix Multiplication with Straggler Tolerance in Coded Elastic Computing via Lagrange Code
Zhong, X., Kliewer, J., & Ji, M. (2023) · International Conference on Communications · doi:10.1109/icc45041.2023.10279134 · Cited by 3
Coded Matrix Computation in Wireless Network
Son, K., & Choi, W. (2023) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2023.3331263 · Cited by 3
Latency Minimization for Split Federated Learning
Guo, J., Xu, C., Ling, Y., Liu, Y., & Yu, Q. (2023) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2023-fall60731.2023.10333442 · Cited by 3
Partial Decode and Compare: An Efficient Verification Scheme for Coded Edge Computing
Wang, J., Jiang, W., Zhou, J., Lu, Z., Lu, K., & Wang, J. (2024) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2024.3370834 · Cited by 3
Sparsity-Preserving Encodings for Straggler-Optimal Distributed Matrix Computations at the Edge
Das, A. B., Ramamoorthy, A., Love, D. J., & Brinton, C. G. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3442012 · Cited by 3
On Decentralized Linearly Separable Computation With the Minimum Computation Cost
Chen, H., Cheng, M., Zhang, Z., Liang, K., Huang, Z., & Wu, Y. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619632 · Cited by 3
Perfect Subset Privacy in Polynomial Computation
Deng, Z., Ramkumar, V., & Raviv, N. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619107 · Cited by 3
Redundancy Management for Fast Service (Rates) in Edge Computing Systems
Peng, P., & Soljanin, E. (2024) · IEEE Transactions on Networking · doi:10.1109/tnet.2024.3507372 · Cited by 3
Approximated Coded Computing: Towards Fast, Private and Secure Distributed Machine Learning
Qiu, H., Zhu, K., Luong, N. C., & Niyato, D. T. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3562192 · Cited by 3
Systematic Matrix Multiplication Codes
Jeong, H., Yang, Y. L., & Grover, P. (2019) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2019.8849811 · Cited by 3
Straggler Remission for Federated Learning via Decentralized Redundant Cayley Tree
Tao, Y., & Zhou, J. (2020) · IEEE Latin-American Conference on Communications · doi:10.1109/latincom50620.2020.9282334 · Cited by 3
Secure Coded Matrix Multiplication Against Cooperative Attack in Edge Computing
Zhu, L., Wang, J., Shi, L., Zhou, J., Lu, K., & Wang, J. (2020) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom50675.2020.00079 · Cited by 3
Cache-Aided Matrix Multiplication Retrieval
Wan, K., Sun, H., Ji, M., Tuninetti, D., & Caire, G. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9518042 · Cited by 3
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation
Das, A. B., & Ramamoorthy, A. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw48936.2021.9611400 · Cited by 3
Distributed Decoding for Coded Distributed Computing
Yazdanialahabadi, A., & Ardakani, M. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2021.3138855 · Cited by 3
PolyDot Coded Privacy Preserving Multi-Party Computation at the Edge
Vedadi, E., Keshtkarjahromi, Y., & Seferoğlu, H. (2022) · IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc51304.2022.9833997 · Cited by 3
Impact of Redundancy on Resilience in Distributed Optimization and Learning
Liu, S., Gupta, N., & Vaidya, N. H. (2023) · International Conference on Distributed Computing and Networking (ICDCN) · doi:10.1145/3571306.3571393 · Cited by 3
Distributed Matrix Computations with Low-weight Encodings
Das, A. B., Ramamoorthy, A., Love, D. J., & Brinton, C. G. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206445 · Cited by 3
On expanding the toolkit of locality-based coded computation to the coordinates of inputs
Rudow, M., Guruswami, V., & Rashmi, K. V. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206923 · Cited by 3
3D Coded SUMMA: Communication-Efficient and Robust Parallel Matrix Multiplication
Jeong, H., Yang, Y. L., Gupta, V., Engelmann, C., Low, T. M., Cadambe, V. R., Ramchandran, K., & Grover, P. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-57675-2_25 · Cited by 3
Self-citationStraggler Mitigation through Unequal Error Protection for Distributed Matrix Multiplication
Tegin, B., Hernandez, E. E., Rini, S., & Duman, T. M. (2021) · International Conference on Communications · doi:10.1109/icc42927.2021.9500264 · Cited by 3
Variants on Block Design Based Gradient Codes for Adversarial Stragglers
Sakorikar, A., & Wang, L. (2021) · International Symposium on Turbo Codes and Iterative Information Processing · doi:10.1109/istc49272.2021.9594170 · Cited by 3
Secure Coded Computation for Efficient Distributed Learning in Mobile IoT
Yang, Y., D’Oliveira, R. G. L., Rouayheb, S. E., Yang, X. Y., Seferoğlu, H., & Chen, Y. J. (2021) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/secon52354.2021.9491589 · Cited by 3
DSAG: A Mixed Synchronous-Asynchronous Iterative Method for Straggler-Resilient Learning
Severinson, A., Rosnes, E., Rouayheb, S. E., & Amat, A. G. I. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3227286 · Cited by 3
Straggler-Resilient Secure Aggregation for Federated Learning
Schlegel, R., Kumar, S., Rosnes, E., & Amat, A. G. I. (2022) · European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco55093.2022.9909849 · Cited by 5
Timely Updates in Distributed Computation Systems with Stragglers
Buyukates, B., & Ulukuş, Ş. (2020) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf51394.2020.9443379 · Cited by 3
An Umbrella Converse for Data Exchange: Applied to Caching, Computing, Shuffling & Rebalancing
Krishnan, P., Natarajan, L. P., & Lalitha, V. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw46852.2021.9457640 · Cited by 3
Anytime Stochastic Gradient Descent: A Time to Hear from all the WorkersPreprint
Ferdinand, N. S., & Draper, S. C. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.02976 · Cited by 3
Cuboid Partitioning for Hierarchical Coded Matrix MultiplicationPreprint
Kiani, S., Ferdinand, N. S., & Draper, S. C. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.08819 · Cited by 3
GCSA Codes with Noise Alignment for Secure Coded Multi-Party Batch Matrix MultiplicationPreprint
Chen, Z., Jia, Z., Wang, Z., & Jafar, S. A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.07750 · Cited by 3
Load balancing policies with server-side cancellation of replicas.Preprint
Jinan, R., Badita, A., Bodas, T., & Parag, P. (2020) · arXiv (Cornell University) · Cited by 3
Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and BeyondPreprint
Yun, C., Rajput, S., & Sra, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.10342 · Cited by 3
Guo, Z., Ji, X., You, W., Guo, H., Zhang, Y., Zhao, Y., Xu, M., & Bai, Y. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111381 · Cited by 2
Communication-Efficient Semi-Decentralized Federated Learning in the Presence of Stragglers
Li, C., Xiao, M., & Skoglund, M. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3605479 · Cited by 2
CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication
Hofmeister, C., Bitar, R., & Wachter-Zeh, A. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195364 · Cited by 2
Liu, H., Fan, Z., Zhang, Y., Hu, Q., Wu, Z., & Shahidehpour, M. (2026) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2026.3670902 · Cited by 2
TiBroco: A Fast and Secure Distributed Learning Framework for Tiered Wireless Edge Networks
Han, D.-J., Sohn, J.-Y., & Moon, J. J. (2021) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom42981.2021.9488860 · Cited by 2
Two-layer Coded Gradient Aggregation with Straggling Communication Links
Liang, K., & Wu, Y. (2021) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw46852.2021.9457626 · Cited by 2
Balanced Nonadaptive Redundancy Scheduling
Behrouzi-Far, A., & Soljanin, E. (2022) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2022.3197675 · Cited by 2
Fully private and secure coded matrix multiplication with colluding workers
Kim, M., Yang, H., & Lee, J. (2023) · ICT Express · doi:10.1016/j.icte.2023.02.002 · Cited by 2
A Time-Series Model for Varying Worker Ability in Heterogeneous Distributed Computing Systems
Kim, D., Lee, S., & Jung, H. (2023) · Applied Sciences · doi:10.3390/app13084993 · Cited by 2
Information Recycling Assisted Collaborative Edge Computing for Distributed Learning
Liang, W., Li, T., & He, X. (2023) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infocomwkshps57453.2023.10226033 · Cited by 2
Sequence-Aware Coding for Leveraging Stragglers in Coded Matrix Multiplication
Fan, X., Soto, P., Zou, Y., Su, X., & Li, J. (2023) · International Conference on Communications · doi:10.1109/icc45041.2023.10279320 · Cited by 2
Wireless Distributed Matrix-Vector Multiplication Using Over-the-Air Computation and Analog Coding
Choi, J. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3366547 · Cited by 2
On the Parameters of Codes for Data Access
Kılıç, A. B., Ravagnani, A., & Soljanin, E. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619288 · Cited by 2
Linear Operator Approximate Message Passing: Power Method with Partial and Stochastic Updates
Rossetti, R., Nazer, B., & Reeves, G. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619189 · Cited by 2
Local Decoding in Distributed Approximate Computing
Yuan, D., Guo, T., Huang, Z., & Jin, S. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619658 · Cited by 2
Coded Computing for Multi-Cluster Distributed Computations
Wu, Y., Li, C., Hu, H., Song, X., Ma, S., & Shi, Y. (2024) · IEEE Transactions on Communications · doi:10.1109/tcomm.2024.3446641 · Cited by 2
Thompson Sampling and Proportional-Greedy Algorithm for Uncertain Coded Edge Computing
Kong, L., Sung, C. W., & Shum, K. W. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3493105 · Cited by 2
Generalized Multivariate Polynomial Codes for Distributed Matrix-Matrix Multiplication
Gómez-Vilardebó, J., Hasırcıoglu, B., & Gündüz, D. (2024) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw61385.2024.10807016 · Cited by 2
Differentially Private Secure Multiplication with Erasures and Adversaries
Hu, H., & Cadambe, V. R. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195249 · Cited by 2
Non-Linear Function Computation Broadcast
Salehi, M. R. D., Purakkal, V. K. K., & Malak, D. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195361 · Cited by 1
Linear operator approximate message passing (OpAMP)
Rossetti, R., Nazer, B., & Reeves, G. (2025) · Information and Inference A Journal of the IMA · doi:10.1093/imaiai/iaaf032 · Cited by 2
A Topology-aware Coding Framework for Distributed Graph Processing
Guler, B., Avestimehr, A. S., & Ortega, A. (2019) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2019.8682227 · Cited by 2
Private Edge Computing for Linear Inference Based on Secret Sharing
Schlegel, R., Kumar, S., Rosnes, E., & Amat, A. G. I. (2020) · Globecom · doi:10.1109/globecom42002.2020.9348077 · Cited by 2
Storage and Computation: A Tradeoff in Secure Distributed Computing
Chen, J., Sung, C. W., & Chan, T. (2020) · International Conference on Communications · doi:10.1109/icc40277.2020.9149183 · Cited by 2
Deep Learning on Healthcare Ecosystem using Blockchain Based Security System
Nishanthini, R., Srimathi, B., Kumaran, R. S., & Yamuna, I. (2021) · IEEE Mysore Sub Section International Conference (MysuruCon) · doi:10.1109/mysurucon52639.2021.9641620 · Cited by 2
Optimization-based Block Coordinate Gradient Coding
Wang, Q., Cui, Y., Li, C., Zou, J., & Xiong, H. (2021) · Globecom · doi:10.1109/globecom46510.2021.9685858 · Cited by 2
Polar Coded Computing: The Role of the Scaling Exponent
Fathollahi, D., & Mondelli, M. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834712 · Cited by 2
Practical interactive scheme for extremum computation in distributed networks
Torabi, S., Ren, J., & Walsh, J. M. (2016) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2016.7541467 · Cited by 2
A Short Survey at the Intersection of Reliability and Security in Processor Architecture Designs
Bu, L., Mark, M., & Kinsy, M. A. (2018) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi.2018.00031 · Cited by 2
Scheduling Stochastic Real-Time Jobs In Unreliable Workers
Hsu, Y.-P., Huang, Y.-C., & Shieh, S.-L. (2020) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc45663.2020.9120733 · Cited by 2
Byzantine Resilient Distributed Clustering with Redundant Data Assignment
Bulusu, S., Gandikota, V., Mazumdar, A., Rawat, A. S., & Varshney, P. K. (2021) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit45174.2021.9517819 · Cited by 2
Asymptotic Frame Theory for Analog Coding
Haikin, M., Gavish, M., Mixon, D. G., & Zamir, R. (2021) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000125 · Cited by 2
Linear Coded Federated Learning under Multiple Stragglers over Heterogeneous Clients
Yang, Y., Wang, J., & Gu, F. (2022) · International Conference on Computer Supported Cooperative Work in Design (CSCWD) · doi:10.1109/cscwd54268.2022.9776309 · Cited by 2
Byzantine Attack Identification in Distributed Matrix Multiplication via locally testable codes
Hong, S., Yang, H., & Lee, J. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834271 · Cited by 2
Computing Resource Allocation for Heterogeneous Coded Distributed Computing
Dai, M., Yuan, J., Tong, Y., Wang, L., & Lin, X. (2022) · Wireless and Optical Communications Conference · doi:10.1109/wocc55104.2022.9880592 · Cited by 2
Distributed Computations with Layered Resolution
Esfahanizadeh, H., Cohen, A., Médard, M., & Shamai, S. S. (2022) · IEEE International Conference on Cloud Networking · doi:10.1109/cloudnet55617.2022.9978858 · Cited by 2
Xu, X., Lin, X., & Duan, L. (2022) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2022.3228322 · Cited by 2
Data Allocation for Approximate Gradient Coding in Edge Networks
Li, H., Chen, Y., Shum, K. W., & Sung, C. W. (2023) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit54713.2023.10206830 · Cited by 2
Coding-Aware Rate Splitting for Distributed Coded Edge Learning
Li, T., Zhang, J., & He, X. (2023) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infocomwkshps57453.2023.10226011 · Cited by 2
Fundamental Limits of Topology-Aware Shared-Cache Networks
Parrinello, E., Bazco-Nogueras, A., & Elia, P. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3321918 · Cited by 2
Load balancing policies without feedback using timed replicas
Jinan, R., Badita, A., Bodas, T., & Parag, P. (2023) · Performance Evaluation · doi:10.1016/j.peva.2023.102381 · Cited by 2
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
