Fetching the paper…
Reading the bibliography…
We consider a scenario involving computations over a massive dataset stored distributedly across multiple workers, which is at the core of distributed learning algorithms.
E. Berlekamp, “Nonbinary bch decoding (abstr.),” IEEE Transactions on Information Theory
1968
Earlier work this paper cites.
J. Massey, “Shift-register synthesis and bch decoding,” IEEE Transactions on Information Theory
1969
Earlier work this paper cites.
A. Shamir, “How to share a secret,” Commun. ACM
1979
Earlier work this paper cites.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” in Proceedings of the twentieth annual ACM symposium on Theory of computing
1988
Earlier work this paper cites.
M. Sudan, “Notes on an efficient solution to the rational function interpolation problem,” Avaliable from http://people.csail.mit.edu/madhu/FT01/notes/rational.ps
1999
Earlier work this paper cites.
M. Rosenblum, “A fast algorithm for rational function approximations,” Avaliable from http://people.csail.mit.edu/madhu/FT01/notes/rosenblum.ps
1999
Earlier work this paper cites.
V. Y. Pan, “Matrix structures of vandermonde and cauchy types and polynomial and rational computations,” in Structured Matrices and Polynomials
2001
Earlier work this paper cites.
Cambridge University Press, 2006
R. Roth, Introduction to coding theory · 2006
Earlier work this paper cites.
D. Bogdanov, S. Laur, and J. Willemson, “Sharemind: A framework for fast privacy-preserving computations,” in Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
2008
Earlier work this paper cites.
K. S. Kedlaya and C. Umans, “Fast polynomial factorization and modular composition,” SIAM Journal on Computing
2011
Earlier work this paper cites.
J. Dean and L. A. Barroso, “The tail at scale,” Communications of the ACM
2013
Earlier work this paper cites.
Cambridge University Press, 2013
P. Renteln, Manifolds, Tensors, and Forms: An Introduction for Mathematicians and Physicists · 2013
Earlier work this paper cites.
M. Li, D. G. Andersen, A. Smola, and K. Yu, “Communication efficient distributed machine learning with the parameter server,” in Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 1
2014
Earlier work this paper cites.
M. Li, D. G. Andersen, A. J. Smola, and K. Yu, “Communication efficient distributed machine learning with the parameter server,” in Advances in Neural Information Processing Systems
2014
Earlier work this paper cites.
Cambridge university press, 2014
S. Shalev-Shwartz and S. Ben-David, Understanding machine learning: From theory to algorithms · 2014
Earlier work this paper cites.
New York, NY, USA: Cambridge University Press, 1st ed., 2015
R. Cramer, I. B. Damgrd, and J. B. Nielsen, Secure Multiparty Computation and Secret Sharing · 2015
Earlier work this paper cites.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” NIPS Workshop on Machine Learning Systems
2015
Cited alongside, same era.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Coded MapReduce,” in Proceedings of the 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
2015
Cited alongside, same era.
M. Abadi, P. Barham, J. Chen, Z. Chen, A. Davis, J. Dean, M. Devin, S. Ghemawat, G. Irving, M. Isard, et al
2016
Cited alongside, same era.
N. J. Yadwadkar, B. Hariharan, J. E. Gonzalez, and R. Katz, “Multi-task learning for straggler avoiding predictive job scheduling,” Journal of Machine Learning Research
2016
Cited alongside, same era.
S. Dutta, V. Cadambe, and P. Grover, “Short-dot: Computing large linear transforms distributedly using coded short dot products,” in Advances In Neural Information Processing Systems
PhD thesis, California Institute of Technology, 2017
W. Huang, Coding for Security and Reliability in Distributed Systems · 2017
Later among the works it cites.
K. Lee, M. Lam, R. Pedarsani, D. Papailiopoulos, and K. Ramchandran, “Speeding up distributed machine learning using codes,” IEEE Transactions on Information Theory
2018
Closest in time.
R. K. Maity, A. S. Rawat, and A. Mazumdar, “Robust gradient descent via moment encoding with ldpc codes,” SysML Conference
2018
Closest in time.
2018
Closest in time.
S. Li, M. A. Maddah-Ali, Q. Yu, and A. S. Avestimehr, “A fundamental tradeoff between computation and communication in distributed computing,” IEEE Transactions on Information Theory
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
P. Blanchard, R. Guerraoui, J. Stainer, et al
2017
Cited alongside, same era.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding: Avoiding stragglers in distributed learning,” in Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017
2017
Cited alongside, same era.
C. Karakus, Y. Sun, S. Diggavi, and W. Yin, “Straggler mitigation in distributed optimization through data encoding,” in Advances in Neural Information Processing Systems
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2017
Cited alongside, same era.
Q. Yu, S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “How to optimally allocate resources for coded distributed computing?,” in 2017 IEEE International Conference on Communications (ICC)
2017
Cited alongside, same era.
Closest in time.
2018
Closest in time.
H. A. Nodehi and M. A. Maddah-Ali, “Limited-sharing multi-party computation for massive matrix operations,” in 2018 IEEE International Symposium on Information Theory (ISIT)
2018
Closest in time.
L. Chen, Z. Charles, D. Papailiopoulos, et al
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
2018
Closest in time.
K. Konstantinidis and A. Ramamoorthy, “Leveraging Coding Techniques for Speeding up Distributed Computing,” ArXiv e-prints
2018
Closest in time.
2018
Closest in time.