Fetching the paper…
Reading the bibliography…
Federated Learning (FL) has been an emerging trend in machine learning and artificial intelligence.
1901
Earlier work this paper cites.
Tin Kam Ho, “Random decision forests,” in Proceedings of 3rd International Conference on Document Analysis and Recognition , vol. 1, 1995, pp. 278–282 vol.1
1995
Earlier work this paper cites.
L. Breiman, “Bagging predictors,” Machine Learning , vol. 24, no. 2, pp. 123–140, 1996
1996
Earlier work this paper cites.
Y. Lindell and B. Pinkas, “Privacy preserving data mining,” in Advances in Cryptology — CRYPTO 2000 , M. Bellare, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 36–54
2000
Earlier work this paper cites.
C. Dwork, “Differential privacy: A survey of results,” in Theory and Applications of Models of Computation: 5th International Conference, TAMC 2008, Xi’an, China, April 25-29, 2008. Proceedings 5 . Springer, 2008, pp. 1–19
2008
Earlier work this paper cites.
Intel, “Software Guard Extensions (Intel SGX) Programming Reference,” 2013, https://software.intel.com/sites/default/files/managed/48/88/329298-002.pdf
2013
Earlier work this paper cites.
2016
Earlier work this paper cites.
T. Chen and C. Guestrin, “Xgboost: A scalable tree boosting system,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , 2016
2016
Earlier work this paper cites.
M. Abadi, A. Chu, I. Goodfellow, H. B. McMahan, I. Mironov, K. Talwar, and L. Zhang, “Deep learning with differential privacy,” in Proceedings of the 2016 ACM SIGSAC conference on computer and communications security , 2016, pp. 308–318
2016
Earlier work this paper cites.
S. Wang, L. Huang, P. Wang, H. Deng, H. Xu, and W. Yang, “Private weighted histogram aggregation in crowdsourcing,” in Wireless Algorithms, Systems, and Applications: 11th International Conference, WASA 2016, Bozeman, MT, USA, August 8-10, 2016. Proceedings 11 . Springer, 2016, pp. 250–261
2016
Earlier work this paper cites.
Z. Karnin, K. Lang, and E. Liberty, “Optimal quantile approximation in streams,” in 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) , 2016, pp. 71–78
2016
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,” 2016
2016
Earlier work this paper cites.
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Proceedings of the 20th International Conference on Artificial Intelligence and Statistics , 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, and T.-Y. Liu, “Lightgbm: A highly efficient gradient boosting decision tree,” Advances in neural information processing systems , vol. 30, 2017
2017
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 privacy-preserving machine learning,” in proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 1175–1191
2017
Earlier work this paper cites.
V. Kolesnikov, N. Matania, B. Pinkas, M. Rosulek, and N. Trieu, “Practical multi-party private set intersection from symmetric-key techniques,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , 2017, pp. 1257–1272
2017
Cited alongside, same era.
P. Mohassel and Y. Zhang, “Secureml: A system for scalable privacy-preserving machine learning,” in 2017 IEEE Symposium on Security and Privacy (SP) , May 2017, pp. 19–38
2017
Cited alongside, same era.
J. Liu, M. Juuti, Y. Lu, and N. Asokan, “Oblivious neural network predictions via minionn transformations,” in Proceedings of the 2017 ACM SIGSAC conference on computer and communications security , 2017, pp. 619–631
2017
Cited alongside, same era.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” 2017
2017
Cited alongside, same era.
F. Fu, J. Jiang, Y. Shao, and B. Cui, “An experimental evaluation of large scale gbdt systems,” Proc. VLDB Endow. , vol. 12, no. 11, p. 1357–1370, Jul. 2019. [Online]. Available: https://doi.org/10.14778/3342263.3342273
2019
Later among the works it cites.
2020
Closest in time.
KPMG, “Fighting fraud with a model of models.” 2020, https://www.nets.eu/solutions/fraud-and-dispute-services/Documents/Nets-KPMG-Fighting-Fraud-with-a-model-of-models-whitepaper-2020.pdf
2020
Closest in time.
M. Abspoel, D. Escudero, and N. Volgushev, “Secure training of decision trees with continuous attributes,” IACR Cryptol. ePrint Arch. , vol. 2020, p. 1130, 2020. [Online]. Available: https://eprint.iacr.org/2020/1130
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. U. Stich, “Local sgd converges fast and communicates little,” 2018
2018
Cited alongside, same era.
T. Chen, G. B. Giannakis, T. Sun, and W. Yin, “Lag: Lazily aggregated gradient for communication-efficient distributed learning,” 2018
2018
Cited alongside, same era.
J. Jiang, B. Cui, C. Zhang, and F. Fu, “Dimboost: Boosting gradient boosting decision tree to higher dimensions,” in Proceedings of the 2018 International Conference on Management of Data , ser. SIGMOD ’18. Association for Computing Machinery, 2018, p. 1363–1376
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J. Van Bulck, M. Minkin, O. Weisse, D. Genkin, B. Kasikci, F. Piessens, M. Silberstein, T. F. Wenisch, Y. Yarom, and R. Strackx, “Foreshadow: Extracting the keys to the intel sgx kingdom with transient out-of-order execution,” in Proceedings fo the 27th USENIX Security Symposium . USENIX Association, 2018
2018
Cited alongside, same era.
M. Assran, N. Loizou, N. Ballas, and M. Rabbat, “Stochastic gradient push for distributed deep learning,” in International Conference on Machine Learning . PMLR, 2019, pp. 344–353
2019
Cited alongside, same era.
2019
Cited alongside, same era.
M. Mohri, G. Sivek, and A. T. Suresh, “Agnostic federated learning,” in International Conference on Machine Learning . PMLR, 2019, pp. 4615–4625
2019
Cited alongside, same era.
Y. Wu, S. Cai, X. Xiao, G. Chen, and B. C. Ooi, “Privacy preserving vertical federated learning for tree-based models,” Proc. VLDB Endow. , vol. 13, no. 11, pp. 2090–2103, 2020. [Online]. Available: http://www.vldb.org/pvldb/vol13/p2090-wu.pdf
2020
Closest in time.
Q. Li, Z. Wu, Z. Wen, and B. He, “Privacy-preserving gradient boosting decision trees,” in Proceedings of the AAAI Conference on Artificial Intelligence , vol. 34, no. 01, 2020, pp. 784–791
2020
Closest in time.
Andrew Law, Chester Leung, Rishabh Poddar, Raluca Ada Popa, Chenyu Shi, Octavian Sima, Chaofan Yu, Xingmeng Zhang, and Wenting Zheng, “Secure collaborative training and inference for xgboost,” in Workshop on Privacy-Preserving Machine Learning in Practice (PPMLP’ 20) , 2020
2020
Closest in time.
Q. Li, Z. Wen, and B. He, “Practical federated gradient boosting decision trees,” in Proceedings of the AAAI conference on artificial intelligence , vol. 34, no. 04, 2020, pp. 4642–4649
2020
Closest in time.
J. H. Bell, K. A. Bonawitz, A. Gascón, T. Lepoint, and M. Raykova, “Secure single-server aggregation with (poly) logarithmic overhead,” in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security , 2020, pp. 1253–1269
2020
Closest in time.
F. Fu, Y. Shao, L. Yu, J. Jiang, H. Xue, Y. Tao, and B. Cui, “Vf 2 {}^{\mbox{2}} boost: Very fast vertical federated gradient boosting for cross-enterprise learning,” in SIGMOD ’21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021 , 2021
2021
Closest in time.
2021
Closest in time.
H. Zhu, R. Wang, Y. Jin, and K. Liang, “Pivodl: Privacy-preserving vertical federated learning over distributed labels,” IEEE Transactions on Artificial Intelligence , 2021
2021
Closest in time.
D. L. Shadravan., “Understanding the differentiating capabilities and unique features of salesforce einstein discovery within the machine learning space.” 2022
2022
Closest in time.
Z. Huang, W.-j. Lu, C. Hong, and J. Ding, “Cheetah: Lean and fast secure { \{ Two-Party } \} deep neural network inference,” in 31st USENIX Security Symposium (USENIX Security 22) , 2022, pp. 809–826
2022
Closest in time.
Wikipedia, “tc (linux),” 2023, https://en.wikipedia.org/wiki/Tc_(Linux)
2023
Closest in time.
H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” 2023
2023
Closest in time.