Fetching the paper…
Reading the bibliography…
We consider the setting of a Master server, M, who possesses confidential data (e.g., personal, genomic or medical data) and wants to run intensive computations on it, as part of a machine learning algorithm for example.
A. Rényi, “On the theory of order statistics,” Acta Mathematica Academiae Scientiarum Hungarica
1953
Earlier work this paper cites.
A. Shamir, “How to share a secret,” Communications of the ACM
1979
Earlier work this paper cites.
R. J. McEliece and D. V. Sarwate, “On sharing secrets and reed-solomon codes,” Communications of the ACM
1981
Earlier work this paper cites.
J. Dean and S. Ghemawat, “Mapreduce: simplified data processing on large clusters,” Communications of the ACM
2008
Earlier work this paper cites.
M. Zaharia, A. Konwinski, A. D. Joseph, R. H. Katz, and I. Stoica, “Improving mapreduce performance in heterogeneous environments.,” in Osdi
2008
Earlier work this paper cites.
M. J. Atallah and K. B. Frikken, “Securely outsourcing linear algebra computations,” in Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
2010
Earlier work this paper cites.
G. Ananthanarayanan, S. Kandula, A. G. Greenberg, I. Stoica, Y. Lu, B. Saha, and E. Harris, “Reining in the outliers in map-reduce clusters using mantri.,” in OSDI
2010
Earlier work this paper cites.
B. Recht, C. Re, S. Wright, and F. Niu, “Hogwild: A lock-free approach to parallelizing stochastic gradient descent,” in Advances in Neural Information Processing Systems
2011
Earlier work this paper cites.
R. Hall, S. E. Fienberg, and Y. Nardi, “Secure multiple linear regression based on homomorphic encryption,” Journal of Official Statistics
2011
Earlier work this paper cites.
B. Recht, C. Re, J. Tropp, and V. Bittorf, “Factoring nonnegative matrices with linear programs,” in Advances in Neural Information Processing Systems
2012
Earlier work this paper cites.
J. Dean, G. Corrado, R. Monga, K. Chen, M. Devin, M. Mao, A. Senior, P. Tucker, K. Yang, Q. V. Le, et al
2012
Earlier work this paper cites.
L. Huang, S. Pawar, H. Zhang, and K. Ramchandran, “Codes can reduce queueing delay in data centers,” in IEEE International Symposium on Information Theory (ISIT)
2012
Earlier work this paper cites.
G. Joshi, Y. Liu, and E. Soljanin, “Coding for fast content download,” in 50th Annual Allerton Conference on Communication, Control, and Computing
2012
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.
S. Narayanamurthy, M. Weimer, D. Mahajan, T. Condie, S. Sellamanickam, and S. S. Keerthi, “Towards resource-elastic machine learning,” in NIPS 2013 BigLearn Workshop
2013
Earlier work this paper cites.
Y. Zhuang, W.-S. Chin, Y.-C. Juan, and C.-J. Lin, “A fast parallel sgd for matrix factorization in shared memory systems,” in Proceedings of the 7th ACM conference on Recommender systems
2013
Cited alongside, same era.
J. Duchi, M. I. Jordan, and B. McMahan, “Estimation, optimization, and parallelism when data is sparse,” in Advances in Neural Information Processing Systems
2013
Cited alongside, same era.
L. Kamm, D. Bogdanov, S. Laur, and J. Vilo, “A new way to protect privacy in large-scale genome-wide association studies,” Bioinformatics
2013
Cited alongside, same era.
Z. Brakerski and V. Vaikuntanathan, “Efficient fully homomorphic encryption from (standard) LWE,” SIAM Journal on Computing
2014
Cited alongside, same era.
G. Liang and U. C. Kozat, “TOFEC: Achieving optimal throughput-delay trade-off of cloud storage using erasure codes,” in IEEE International Conference on Computer Communications
W. Huang, M. Langberg, J. Kliewer, and J. Bruck, “Communication efficient secret sharing,” IEEE Transactions on Information Theory
2016
Later among the works it cites.
2016
Later among the works it cites.
I. Mitliagkas, C. Zhang, S. Hadjis, and C. Ré, “Asynchrony begets momentum, with an application to deep learning,” in Communication, Control, and Computing (Allerton), 2016 54th Annual Allerton Conference on
2016
Later among the works it cites.
R. Tandon, Q. Lei, A. G. Dimakis, and N. Karampatziakis, “Gradient coding,” in 29 29 th Conference on Neural Information Processing Systems (NIPS)
2016
Later among the works it cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “A unified coding framework for distributed computing with straggling servers,” in Globecom Workshops (GC Wkshps), 2016 IEEE
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
H. Yun, H.-F. Yu, C.-J. Hsieh, S. Vishwanathan, and I. Dhillon, “Nomad: Non-locking, stochastic multi-machine algorithm for asynchronous and decentralized matrix completion,” Proceedings of the VLDB Endowment
2014
Cited alongside, same era.
Y.-x. Wang, V. Sadhanala, W. Dai, W. Neiswanger, S. Sra, and E. P. Xing, “Asynchronous parallel block-coordinate frank-wolfe,” stat
2014
Cited alongside, same era.
T. M. Chilimbi, Y. Suzue, J. Apacible, and K. Kalyanaraman, “Project adam: Building an efficient and scalable deep learning training system.,” in OSDI
2014
Cited alongside, same era.
2015
Cited alongside, same era.
J. Liu, S. J. Wright, C. Ré, V. Bittorf, and S. Sridhar, “An asynchronous parallel stochastic coordinate descent algorithm.,” Journal of Machine Learning Research
2015
Cited alongside, same era.
C.-J. Hsieh, H.-F. Yu, and I. S. Dhillon, “Passcode: Parallel asynchronous stochastic dual co-ordinate descent.,” in ICML
2015
Cited alongside, same era.
2015
Cited alongside, same era.
2016
Later among the works it cites.
S. Li, M. A. Maddah-Ali, and A. S. Avestimehr, “Fundamental tradeoff between computation and communication in distributed computing,” in IEEE International Symposium on Information Theory (ISIT)
2016
Later among the works it cites.
H. Takabi, E. Hesamifard, and M. Ghasemi, “Privacy preserving multi-party machine learning with homomorphic encryption,” in 29 29 th Annual Conference on Neural Information Processing Systems (NIPS)
2016
Later among the works it cites.
E. Learned-Miller, G. B. Huang, A. Roy Chowdhury, H. Li, and G. Hua, “Labeled faces in the wild: A survey,” in Advances in face detection and facial image analysis
2016
Later among the works it cites.
R. Bitar, P. Parag, and S. El Rouayheb, “Minimizing latency for secure distributed computing,” in International Symposium on Information Theory (ISIT)
2017
Later among the works it cites.
R. Bitar and S. El Rouayheb, “Staircase codes for secret sharing with optimal communication and read overheads,” IEEE Transactions on Information Theory
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
Y. Yang, P. Grover, and S. Kar, “Computing linear transformations with unreliable components,” IEEE Transactions on Information Theory
2017
Later among the works it cites.
S. Gade and N. H. Vaidya, “Private learning on networks: Part ii,” arXiv preprint arXiv:1703.09185
2017
Later among the works it cites.