Fetching the paper…
Reading the bibliography…
Federated learning is a distributed framework for training machine learning models over the data residing at mobile devices, while protecting the privacy of individual users.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association , vol. 58, no. 301, pp. 13–30, 1963
1963
Earlier work this paper cites.
W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Trans. on Inf. Theory , vol. 22, no. 6, pp. 644–654, 1976
1976
Earlier work this paper cites.
A. Shamir, “How to share a secret,” Communications of the ACM , vol. 22, no. 11, pp. 612–613, 1979
1979
Earlier work this paper cites.
A. C. Yao, “Protocols for secure computations,” in IEEE Ann. Symp. on Foundations of Comp. Sci. , 1982, pp. 160–164
1982
Earlier work this paper cites.
M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” in ACM Symposium on Theory of Computing . ACM, 1988, pp. 1–10
1988
Earlier work this paper cites.
L. Dalcín, R. Paz, and M. Storti, “MPI for Python,” Journal of Parallel and Dist. Comp. , vol. 65, no. 9, pp. 1108–1115, 2005
2005
Earlier work this paper cites.
C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Theory of Crypto. Conf. Springer, 2006, pp. 265–284
2006
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) . USA: Wiley-Interscience, 2006
2006
Earlier work this paper cites.
Z. Beerliová-Trubíniová and M. Hirt, “Perfectly-secure MPC with linear communication complexity,” in Theory of Cryptography Conference . Springer, 2008, pp. 213–230
2008
Earlier work this paper cites.
C. Gentry and D. Boneh, A fully homomorphic encryption scheme . Stanford University, Stanford, 2009, vol. 20, no. 09
2009
Earlier work this paper cites.
M. Burkhart, M. Strasser, D. Many, and X. Dimitropoulos, “Sepia: Privacy-preserving aggregation of multi-domain network events and statistics,” Network , vol. 1, no. 101101, 2010
2010
Earlier work this paper cites.
V. Rastogi and S. Nath, “Differentially private aggregation of distributed time-series with transformation and encryption,” in ACM SIGMOD Int. Conf. on Management of data , 2010, pp. 735–746
2010
Earlier work this paper cites.
A. Beimel, “Secret-sharing schemes: a survey,” in Int. Conf. on Coding and Cryptology . Springer, 2011, pp. 11–46
2011
Earlier work this paper cites.
S. Halevi, Y. Lindell, and B. Pinkas, “Secure computation on the web: Computing without simultaneous interaction,” in Annual Cryptology Conf. Springer, 2011, pp. 132–150
2011
Earlier work this paper cites.
G. Ács and C. Castelluccia, “I have a dream! (differentially private smart metering),” in International Workshop on Information Hiding . Springer, 2011, pp. 118–132
2011
Earlier work this paper cites.
K. S. Kedlaya and C. Umans, “Fast polynomial factorization and modular composition,” SIAM Journal on Computing , vol. 40, no. 6, pp. 1767–1802, 2011
2011
Earlier work this paper cites.
I. Damgård, V. Pastro, N. Smart, and S. Zakarias, “Multiparty computation from somewhat homomorphic encryption,” in Annual Cryptology Conf. Springer, 2012, pp. 643–662
2012
Earlier work this paper cites.
I. Leontiadis, K. Elkhiyaoui, and R. Molva, “Private and dynamic time-series data aggregation with trust relaxation,” in International Conference on Cryptology and Network Security . Springer, 2014, pp. 305–320
2014
Earlier work this paper cites.
K. Bonawitz, V. Ivanov, B. Kreuter, A. Marcedone, H. B. McMahan, S. Patel, D. Ramage, A. Segal, and K. Seth, “Practical secure aggregation for federated learning on user-held data,” Conference on Neural Information Processing Systems , 2016
2016
Earlier work this paper cites.
J. Konečný, H. B. McMahan, F. X. Yu, P. Richtarik, A. T. Suresh, and D. Bacon, “Federated learning: Strategies for improving communication efficiency,” in Conference on Neural Information Processing Systems: Workshop on Private Multi-Party Machine Learning , 2016
2016
Cited alongside, same era.
H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Int. Conf. on Artificial Int. and Stat. (AISTATS) , 2017, pp. 1273–1282
2017
Cited alongside, same era.
——, “Practical secure aggregation for privacy-preserving machine learning,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 1175–1191
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
X. Lian, C. Zhang, H. Zhang, C.-J. Hsieh, W. Zhang, and J. Liu, “Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent,” in Advances in Neural Information Processing Systems , 2017, pp. 5330–5340
2017
Cited alongside, same era.
V. Smith, C.-K. Chiang, M. Sanjabi, and A. S. Talwalkar, “Federated multi-task learning,” in Advances in Neural Information Processing Systems , 2017, pp. 4424–4434
2017
Cited alongside, same era.
E. Syta, P. Jovanovic, E. K. Kogias, N. Gailly, L. Gasser, I. Khoffi, M. J. Fischer, and B. Ford, “Scalable bias-resistant distributed randomness,” in 2017 IEEE Symposium on Security and Privacy (SP) , 2017, pp. 444–460
2017
Cited alongside, same era.
2018
Cited alongside, same era.
H. B. McMahan, D. Ramage, K. Talwar, and L. Zhang, “Learning differentially private recurrent language models,” Int. Conf. on Learning Representations (ICLR) , 2018
2018
Cited alongside, same era.
D. Evans, V. Kolesnikov, M. Rosulek et al. , “A pragmatic introduction to secure multi-party computation,” Foundations and Trends in Priv. and Sec. , vol. 2, no. 2-3, pp. 70–246, 2018
2018
Cited alongside, same era.
L. He, A. Bian, and M. Jaggi, “Cola: Decentralized linear learning,” in Advances in Neural Information Processing Systems , 2018, pp. 4536–4546
2018
Cited alongside, same era.
Y. Li, M. Yu, S. Li, S. Avestimehr, N. S. Kim, and A. Schwing, “Pipe-sgd: A decentralized pipelined sgd framework for distributed deep net training,” in Advances in Neural Information Processing Systems , 2018, pp. 8045–8056
2018
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2020
Closest in time.
T. Li, A. K. Sahu, A. Talwalkar, and V. Smith, “Federated learning: Challenges, methods, and future directions,” IEEE Signal Processing Magazine , vol. 37, no. 3, pp. 50–60, 2020
2020
Closest in time.
K. Wei, J. Li, M. Ding, C. Ma, H. H. Yang, F. Farokhi, S. Jin, T. Q. Quek, and H. V. Poor, “Federated learning with differential privacy: Algorithms and performance analysis,” IEEE Transactions on Information Forensics and Security , 2020
2020
Closest in time.
J. So, B. Guler, and A. S. Avestimehr, “A scalable approach for privacy-preserving collaborative machine learning,” in Advances in Neural Information Processing Systems , 2020
2020
Closest in time.
2020
Closest in time.
J. So, B. Güler, and A. S. Avestimehr, “Byzantine-resilient secure federated learning,” IEEE Journal on Selected Areas in Communications , 2020
2020
Closest in time.
C. He, S. Avestimehr, and M. Annavaram, “Group knowledge transfer: Collaborative training of large cnns on the edge,” Advances in Neural Information Processing Systems , 2020
2020
Closest in time.
J. So, B. Güler, and A. S. Avestimehr, “Turbo-aggregate: Breaking the quadratic aggregation barrier in secure federated learning,” IEEE Journal on Selected Areas in Information Theory , 2021
2021
Closest in time.