Adaptive Verifiable Coded Computing: Towards Fast, Secure and Private Distributed Machine Learning

E. T. Jaynes, “Information theory and statistical mechanics. ii,” Physical review , vol. 108, no. 2, p. 171, 1957

1957

Earlier work this paper cites.

E. R. Berlekamp, “Non-binary bch decoding,” North Carolina State University. Dept. of Statistics, Tech. Rep., 1966

1966

Earlier work this paper cites.

R. Freivalds, “Probabilistic machines can use less running time,” in IFIP Congress , 1977

1977

Earlier work this paper cites.

I. Guyon, S. Gunn, A. B. Hur, and G. Dror, “Result analysis of the nips 2003 feature selection challenge,” in Proceedings of the 17th International Conference on Neural Information Processing Systems , ser. NIPS’04. Cambridge, MA, USA: MIT Press, 2004, p. 545–552

2004

Earlier work this paper cites.

G. Ananthanarayanan, S. Kandula, A. Greenberg, I. Stoica, Y. Lu, B. Saha, and E. Harris, “Reining in the outliers in map-reduce clusters using mantri,” in Proceedings of the 9th USENIX Conference on Operating Systems Design and Implementation , ser. OSDI’10. USA: USENIX Association, 2010, p. 265–278

2010

Earlier work this paper cites.

X. Xu, “From cloud computing to cloud manufacturing,” Robotics and computer-integrated manufacturing , vol. 28, no. 1, pp. 75–86, 2012

2012

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, 2013

2013

Earlier work this paper cites.

G. Ananthanarayanan, A. Ghodsi, S. Shenker, and I. Stoica, “Effective straggler mitigation: Attack of the clones,” in 10th { \{ USENIX } \} Symposium on Networked Systems Design and Implementation ( { \{ NSDI } \} 13) , 2013, pp. 185–198

2013

Earlier work this paper cites.

L. Suresh, M. Canini, S. Schmid, and A. Feldmann, “C3: Cutting tail latency in cloud data stores via adaptive replica selection,” in 12th { \{ USENIX } \} Symposium on Networked Systems Design and Implementation ( { \{ NSDI } \} 15) , 2015, pp. 513–527

2015

Earlier work this paper cites.

N. B. Shah, K. Lee, and K. Ramchandran, “When do redundant requests reduce latency?” IEEE Transactions on Communications , vol. 64, no. 2, pp. 715–722, 2015

2015

Earlier work this paper cites.

K. Gardner, S. Zbarsky, S. Doroudi, M. Harchol-Balter, and E. Hyytia, “Reducing latency via redundant requests: Exact analysis,” ACM SIGMETRICS Performance Evaluation Review , vol. 43, no. 1, pp. 347–360, 2015

2015

Earlier work this paper cites.

S. Gupta, A. Agrawal, K. Gopalakrishnan, and P. Narayanan, “Deep learning with limited numerical precision,” in International Conference on Machine Learning , 2015, pp. 1737–1746

2015

Earlier work this paper cites.

V. Costan and S. Devadas, “Intel sgx explained.” IACR Cryptol. ePrint Arch. , vol. 2016, no. 86, pp. 1–118, 2016

2016

Earlier work this paper cites.

P. Blanchard, E. M. El Mhamdi, R. Guerraoui, and J. Stainer, “Machine learning with adversaries: Byzantine tolerant gradient descent,” in Proceedings of the 31st International Conference on Neural Information Processing Systems , 2017, pp. 118–128

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 Transactions on Information Theory , vol. 64, no. 3, pp. 1514–1529, 2017

2017

Cited alongside, same era.

Q. Yu, M. A. Maddah-Ali, and S. Avestimehr, “Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,” in NIPS , 2017

2017

Cited alongside, same era.

Z. Ghodsi, T. Gu, and S. Garg, “Safetynets: Verifiable execution of deep neural networks on an untrusted cloud,” Advances in Neural Information Processing Systems , vol. 30, 2017

2017

Cited alongside, same era.

L. Chen, H. Wang, Z. Charles, and D. Papailiopoulos, “Draco: Byzantine-resilient distributed training via redundant gradients,” in International Conference on Machine Learning . PMLR, 2018, pp. 903–912

2018

Cited alongside, same era.

S. Sahraei, S. Avestimehr, and R. E. Ali, “Infocommit: Information-theoretic polynomial commitment and verification,” arXiv preprint arXiv:2002.00559 , 2020

Original

2020

Later among the works it cites.

R. E. Ali, J. So, and A. S. Avestimehr, “On polynomial approximations for privacy-preserving and verifiable relu networks,” arXiv preprint arXiv:2011.05530 , 2020

Original

2020

Later among the works it cites.

J. So, B. Guler, and A. S. Avestimehr, “Byzantine-resilient secure federated learning,” arXiv preprint arXiv:2007.11115 , 2020

Original

2020

Later among the works it cites.

S. Prakash and A. S. Avestimehr, “Mitigating byzantine attacks in federated learning,” arXiv preprint arXiv:2010.07541 , 2020

Original

2020

Later among the works it cites.