Fetching the paper…
Reading the bibliography…
Large matrix multiplications are central to large-scale machine learning applications.
A. Shamir, “How to share a secret,” Communications of the ACM , vol. 22, no. 11, pp. 612–613, Nov. 1979
1979
Earlier work this paper cites.
K.-H. Huang and J. A. Abraham, “Algorithm-based fault tolerance for matrix operations,” IEEE Trans. on Computers , vol. 100, no. 6, pp. 518–528, Jun. 1984
1984
Earlier work this paper cites.
B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, “Private information retrieval,” in Proceedings of IEEE 36th Annual Foundations of Computer Science . IEEE, 1995, pp. 41–50
1995
Earlier work this paper cites.
W. Gasarch, “A survey on private information retrieval,” Bulletin of the EATCS , vol. 82, no. 113, pp. 72–107, Feb. 2004
2004
Earlier work this paper cites.
H.-T. Kung, Fast evaluation and interpolation . Carnegie Mellon University, Tech. Rep., 2009
2009
Earlier work this paper cites.
S. Yekhanin, “Private information retrieval,” Commun. ACM , vol. 53, no. 4, pp. 68–73, Apr. 2010
2010
Earlier work this paper cites.
F. Ricci, L. Rokach, and B. Shapira, Introduction to recommender systems handbook . Springer, 2011
2011
Earlier work this paper cites.
J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM , vol. 56, no. 2, pp. 74–80, Feb. 2013
2013
Earlier work this paper cites.
M. Li, D. G. Andersen, J. W. Park, A. J. Smola, A. Ahmed, V. Josifovski, J. Long, E. J. Shekita, and B.-Y. Su, “Scaling distributed machine learning with the parameter server.” in Proc. of the 11th USENIX Conference on Operating Systems Design and Implementation, OSDI , vol. 14, Oct. 2014, pp. 583–598
2014
Earlier work this paper cites.
S. M. Ross, Introduction to Probability Models . Academic Press, 2014
2014
Earlier work this paper cites.
2015
Earlier work this paper cites.
D. Wang, G. Joshi, and G. Wornell, “Using straggler replication to reduce latency in large-scale parallel computing,” ACM SIGMETRICS Performance Evaluation Review , vol. 43, no. 3, pp. 7–11, Dec. 2015
2015
Earlier work this paper cites.
G. Joshi, E. Soljanin, and G. Wornell, “Efficient redundancy techniques for latency reduction in cloud systems,” ACM Transactions on Modeling and Performance Evaluation of Computing Systems (TOMPECS) , vol. 2, no. 2, pp. 12:1–12:30, Apr. 2017
2017
Earlier work this paper cites.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Trans. on Inform. Theory , vol. 64, no. 3, pp. 1514–1529, Aug. 2017
2017
Earlier work this paper cites.
Q. Yu, M. Maddah-Ali, and S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” in Proc. Advances in Neural Inform. Processing Systems , Dec. 2017, pp. 4403–4413
2017
Earlier work this paper cites.
S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,” IEEE Trans. on Inform. Theory , vol. 64, no. 1, pp. 109–128, Sep. 2017
2017
Cited alongside, same era.
M. Fahim, H. Jeong, F. Haddadpour, S. Dutta, V. Cadambe, and P. Grover, “On the optimal recovery threshold of coded matrix multiplication,” in Proc. 55th Allerton Conf. Commun., Control, Comput., IL, USA , Oct. 2017, pp. 1264–1270
2017
Cited alongside, same era.
K. Lee, C. Suh, and K. Ramchandran, “High-dimensional coded matrix multiplication,” in Proc. IEEE Intern. Symp. Inform. Theory (ISIT) , Jun. 2017, pp. 2418–2422
2017
Cited alongside, same era.
H. Sun and S. A. Jafar, “The capacity of private information retrieval,” IEEE Trans. on Inform. Theory , vol. 63, no. 7, pp. 4075–4088, Jul. 2017
2017
Cited alongside, same era.
M. Aliasgari, O. Simeone, and J. Kliewer, “Distributed and private coded matrix computation with flexible communication load,” in Proc. IEEE Intern. Symp. Inform. Theory (ISIT) , Jul. 2019, pp. 1092–1096
2019
Closest in time.
M. Aliasgari, J. Kliewer, and O. Simeone, “Coded computation against processing delays for virtualized cloud-based channel decoding,” IEEE Trans. on Commun. , vol. 67, no. 1, pp. 28–38, Jan. 2019
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Freij-Hollanti, O. W. Gnilke, C. Hollanti, and D. A. Karpuk, “Private information retrieval from coded databases with colluding servers,” SIAM J. Appl. Algebra Geom. , vol. 1, no. 1, pp. 647–664, Nov. 2017
2017
Cited alongside, same era.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Trans. on Inform. Theory , vol. 64, no. 3, pp. 1514–1529, Mar. 2017
2017
Cited alongside, same era.
——, “Coded computation against straggling decoders for network function virtualization,” in Proc. IEEE Intern. Symp. Inform. Theory (ISIT) , Jun. 2018, pp. 711–715
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
H. A. Nodehi and M. A. Maddah-Ali, “Limited-sharing multi-party computation for massive matrix operations,” in Proc. IEEE Intern. Symp. on Inform. Theory (ISIT) , Jun. 2018, pp. 1231–1235
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J. Kakar, S. Ebadifar, and A. Sezgin, “On the capacity and straggler-robustness of distributed secure matrix multiplication,” IEEE Access , vol. 7, pp. 45 783–45 799, Apr. 2019
2019
Closest in time.
H. Yang and J. Lee, “Secure distributed computing with straggling servers using polynomial codes,” IEEE Trans. on Inform. Forensics and Secur. , vol. 14, no. 1, pp. 141–150, Jan. 2019
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
F. Kazemi, E. Karimi, A. Heidarzadeh, and A. Sprintson, “Single-server single-message online private information retrieval with side information,” in Proc. IEEE Intern. Symp. Inform. Theory (ISIT) , Jul. 2019, pp. 350–354
2019
Closest in time.
2019
Closest in time.
M. Kim and J. Lee, “Private secure coded computation,” arXiv preprint, arXiv:1902.00167 , 2019
2019
Closest in time.
2019
Closest in time.
2019
Closest in time.
S. Ha, J. Zhang, O. Simeone, and J. Kang, “Coded federated computing in wireless networks with straggling devices and imperfect CSI,” in Proc. IEEE Intern. Symp. Inform. Theory (ISIT) , Jul. 2019, pp. 2649–2653
2019
Closest in time.