Fetching the paper…
Reading the bibliography…
Along with the blooming of AI and Machine Learning-based applications and services, data privacy and security have become a critical challenge.
Interpretable machine learning: definitions, methods, and applications
Murdoch, W.J., Singh, C., Kumbier, K., Abbasi-Asl, R., Yu, B., 2019 · 1901
Earlier work this paper cites.
Towards federated learning at scale: System design
Bonawitz, K., Eichner, H., Grieskamp, W., Huba, D., Ingerman, A., Ivanov, V., Kiddon, C., Konečnỳ, J., Mazzocchi, S., McMahan, H.B., et al., 2019 · 1902
Earlier work this paper cites.
Decentralized stochastic optimization and gossip algorithms with compressed communication
Koloskova, A., Stich, S.U., Jaggi, M., 2019 · 1902
Earlier work this paper cites.
A survey on bias and fairness in machine learning
Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., Galstyan, A., 2019 · 1908
Earlier work this paper cites.
Advances and open problems in federated learning
Kairouz, P., McMahan, H.B., Avent, B., Bellet, A., Bennis, M., Bhagoji, A.N., Bonawitz, K., Charles, Z., Cormode, G., Cummings, R., et al., 2019 · 1912
Earlier work this paper cites.
How to share a secret
Shamir, A., 1979 · 1979
Earlier work this paper cites.
Verifiable secret sharing and achieving simultaneity in the presence of faults, in: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), IEEE. pp. 383–395
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B., 1985 · 1985
Earlier work this paper cites.
Learning internal representations by error propagation
Rumelhart, D.E., Hinton, G.E., Williams, R.J., 1985 · 1985
Earlier work this paper cites.
How to generate and exchange secrets, in: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), IEEE. pp. 162–167
Yao, A.C., 1986 · 1986
Earlier work this paper cites.
Some ideal secret sharing schemes, in: Workshop on the Theory and Application of of Cryptographic Techniques, Springer. pp. 468–475
Brickell, E.F., 1989 · 1989
Earlier work this paper cites.
Direct bulk-synchronous parallel algorithms
Gerbessiotis, A.V., Valiant, L.G., 1994 · 1994
Earlier work this paper cites.
Adaptively secure multi-party computation, in: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pp. 639–648
Canetti, R., Feige, U., Goldreich, O., Naor, M., 1996 · 1996
Earlier work this paper cites.
Secure multi-party computation
Goldreich, O., 1998 · 1998
Earlier work this paper cites.
On the momentum term in gradient descent learning algorithms
Qian, N., 1999 · 1999
Earlier work this paper cites.
General secure multi-party computation from any linear secret-sharing scheme, in: International Conference on the Theory and Applications of Cryptographic Techniques, Springer. pp. 316–334
Cramer, R., Damgård, I., Maurer, U., 2000 · 2000
Earlier work this paper cites.
Privacy preserving data mining, in: Annual International Cryptology Conference, Springer. pp. 36–54
Lindell, Y., Pinkas, B., 2000 · 2000
Earlier work this paper cites.
k-anonymity: A model for protecting privacy
Sweeney, L., 2002 · 2002
Earlier work this paper cites.
Inverting gradients–how easy is it to break privacy in federated learning?
Geiping, J., Bauermeister, H., Dröge, H., Moeller, M., 2020 · 2003
Earlier work this paper cites.
Privacy-preserving multivariate statistical analysis: Linear regression and classification, in: Proceedings of the 2004 SIAM international conference on data mining, SIAM. pp. 222–233
Du, W., Han, Y.S., Chen, S., 2004 · 2004
Earlier work this paper cites.
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data, in: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pp. 593–599
Jagannathan, G., Wright, R.N., 2005 · 2005
Earlier work this paper cites.
Our data, ourselves: Privacy via distributed noise generation, in: Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer. pp. 486–503
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M., 2006 · 2006
Earlier work this paper cites.
Anytime minibatch: Exploiting stragglers in online distributed optimization
Ferdinand, N., Al-Lawati, H., Draper, S.C., Nokleby, M., 2020 · 2006
Earlier work this paper cites.
t-closeness: Privacy beyond k-anonymity and l-diversity, in: 2007 IEEE 23rd International Conference on Data Engineering, IEEE. pp. 106–115
Li, N., Li, T., Venkatasubramanian, S., 2007 · 2007
Earlier work this paper cites.
l-diversity: Privacy beyond k-anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M., 2007 · 2007
Earlier work this paper cites.
Ldp-fl: Practical private aggregation in federated learning with local differential privacy
Sun, L., Qian, J., Chen, X., Yu, P.S., 2020 · 2007
Earlier work this paper cites.
Differential privacy: A survey of results, in: International conference on theory and applications of models of computation, Springer. pp. 1–19
Dwork, C., 2008 · 2008
Earlier work this paper cites.
Robust de-anonymization of large sparse datasets, in: 2008 IEEE Symposium on Security and Privacy (sp 2008), IEEE. pp. 111–125
Narayanan, A., Shmatikov, V., 2008 · 2008
Earlier work this paper cites.
Privacy-preserving logistic regression, in: Advances in neural information processing systems, pp. 289–296
Chaudhuri, K., Monteleoni, C., 2009 · 2009
Earlier work this paper cites.
A fully homomorphic encryption scheme. volume 20
Gentry, C., Boneh, D., 2009 · 2009
Earlier work this paper cites.
Asynchronous gossip algorithms for stochastic optimization, in: Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference, IEEE. pp. 3581–3586
Ram, S.S., Nedić, A., Veeravalli, V.V., 2009 · 2009
Earlier work this paper cites.
Large-scale machine learning with stochastic gradient descent, in: Proceedings of COMPSTAT’2010. Springer, pp. 177–186
Bottou, L., 2010 · 2010
Earlier work this paper cites.
Data mining with differential privacy, in: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 493–502
Friedman, A., Schuster, A., 2010 · 2010
Earlier work this paper cites.
Privacy-preserving data publishing: A survey of recent developments
Fung, B.C., Wang, K., Chen, R., Yu, P.S., 2010 · 2010
Earlier work this paper cites.
Computing arbitrary functions of encrypted data
Gentry, C., 2010 · 2010
Earlier work this paper cites.
Multiparty differential privacy via aggregation of locally trained classifiers, in: Advances in Neural Information Processing Systems, pp. 1876–1884
Pathak, M., Rane, S., Raj, B., 2010 · 2010
Earlier work this paper cites.
Differentially private empirical risk minimization
Chaudhuri, K., Monteleoni, C., Sarwate, A.D., 2011 · 2011
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
Duchi, J., Hazan, E., Singer, Y., 2011 · 2011
Earlier work this paper cites.
Implementing gentry’s fully-homomorphic encryption scheme, in: Annual international conference on the theory and applications of cryptographic techniques, Springer. pp. 129–148
Gentry, C., Halevi, S., 2011 · 2011
Earlier work this paper cites.
Hogwild: A lock-free approach to parallelizing stochastic gradient descent, in: Advances in neural information processing systems, pp. 693–701
Recht, B., Re, C., Wright, S., Niu, F., 2011 · 2011
Earlier work this paper cites.
Poisoning attacks against support vector machines, in: 29th International Conference on Machine Learning, ArXiv e-prints. pp. 1807–1814
Biggio, B., Nelson, B., Laskov, P., 2012 · 2012
Earlier work this paper cites.
Large scale distributed deep networks, in: Advances in neural information processing systems, pp. 1223–1231
Dean, J., Corrado, G., Monga, R., Chen, K., Devin, M., Mao, M., Ranzato, M., Senior, A., Tucker, P., Yang, K., et al., 2012 · 2012
Earlier work this paper cites.
Learning in a large function space: Privacy-preserving mechanisms for svm learning
Rubinstein, B.I., Bartlett, P.L., Huang, L., Taft, N., 2012 · 2012
Earlier work this paper cites.
Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude
Tieleman, T., Hinton, G., 2012 · 2012
Cited alongside, same era.
More effective distributed ml via a stale synchronous parallel parameter server, in: Advances in neural information processing systems, pp. 1223–1231
Ho, Q., Cipar, J., Cui, H., Lee, S., Kim, J.K., Gibbons, P.B., Gibson, G.A., Ganger, G., Xing, E.P., 2013 · 2013
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction, in: Advances in neural information processing systems, pp. 315–323
Johnson, R., Zhang, T., 2013 · 2013
Cited alongside, same era.
Signal processing and machine learning with differential privacy: Algorithms and challenges for continuous data
Sarwate, A.D., Chaudhuri, K., 2013 · 2013
Cited alongside, same era.
Stochastic gradient descent with differentially private updates, in: 2013 IEEE Global Conference on Signal and Information Processing, IEEE. pp. 245–248
Secureml: A system for scalable privacy-preserving machine learning, in: 2017 IEEE Symposium on Security and Privacy (SP), IEEE. pp. 19–38
Mohassel, P., Zhang, Y., 2017 · 2017
Later among the works it cites.
Membership inference attacks against machine learning models, in: 2017 IEEE Symposium on Security and Privacy (SP), IEEE. pp. 3–18
Shokri, R., Stronati, M., Song, C., Shmatikov, V., 2017 · 2017
Later among the works it cites.
Federated multi-task learning, in: Advances in Neural Information Processing Systems 30. Curran Associates, Inc., pp. 4424–4434
Smith, V., Chiang, C.K., Sanjabi, M., Talwalkar, A.S., 2017 · 2017
Later among the works it cites.
Why a right to explanation of automated decision-making does not exist in the general data protection regulation
Wachter, S., Mittelstadt, B., Floridi, L., 2017 · 2017
Later among the works it cites.
Private, yet practical, multiparty deep learning, in: 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS), IEEE. pp. 1442–1452
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Song, S., Chaudhuri, K., Sarwate, A.D., 2013 · 2013
Cited alongside, same era.
Private empirical risk minimization: Efficient algorithms and tight error bounds, in: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, IEEE. pp. 464–473
Bassily, R., Smith, A., Thakurta, A., 2014 · 2014
Cited alongside, same era.
Big data deep learning: challenges and perspectives
Chen, X.W., Lin, X., 2014 · 2014
Cited alongside, same era.
Project adam: Building an efficient and scalable deep learning training system, in: 11th { \{ USENIX } \} Symposium on Operating Systems Design and Implementation ( { \{ OSDI } \} 14), pp. 571–582
Chilimbi, T., Suzue, Y., Apacible, J., Kalyanaraman, K., 2014 · 2014
Cited alongside, same era.
The algorithmic foundations of differential privacy
Dwork, C., Roth, A., et al., 2014 · 2014
Cited alongside, same era.
Generative adversarial nets, in: Advances in neural information processing systems, pp. 2672–2680
Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y., 2014 · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
Kingma, D.P., Ba, J., 2014 · 2014
Cited alongside, same era.
Stochastic backpropagation and approximate inference in deep generative models
Rezende, D.J., Mohamed, S., Wierstra, D., 2014 · 2014
Cited alongside, same era.
Zhang, X., Ji, S., Wang, H., Wang, T., 2017 · 2017
Later among the works it cites.
A survey on homomorphic encryption schemes: Theory and implementation
Acar, A., Aksu, H., Uluagac, A.S., Conti, M., 2018 · 2018
Later among the works it cites.
Seeing without knowing: Limitations of the transparency ideal and its application to algorithmic accountability
Ananny, M., Crawford, K., 2018 · 2018
Later among the works it cites.
Protection against reconstruction and its applications in private federated learning
Bhowmick, A., Duchi, J., Freudiger, J., Kapoor, G., Rogers, R., 2018 · 2018
Later among the works it cites.
Draco: Byzantine-resilient distributed training via redundant gradients
Chen, L., Wang, H., Charles, Z., Papailiopoulos, D., 2018 · 2018
Later among the works it cites.
Gossipgrad: Scalable deep learning using gossip communication based asynchronous gradient descent
Daily, J., Vishnu, A., Siegel, C., Warfel, T., Amatya, V., 2018 · 2018
Later among the works it cites.
Mitigating sybils in federated learning poisoning
Fung, C., Yoon, C.J., Beschastnikh, I., 2018 · 2018
Later among the works it cites.
Property inference attacks on fully connected neural networks using permutation invariant representations, in: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 619–633
Ganju, K., Wang, Q., Yang, W., Gunter, C.A., Borisov, N., 2018 · 2018
Later among the works it cites.
Weighing the impact of gdpr
Greengard, S., 2018 · 2018
Later among the works it cites.
Cola: Decentralized linear learning, in: Advances in Neural Information Processing Systems, pp. 4536–4546
He, L., Bian, A., Jaggi, M., 2018 · 2018
Later among the works it cites.
Manipulating machine learning: Poisoning attacks and countermeasures for regression learning, in: 2018 IEEE Symposium on Security and Privacy (SP), IEEE. pp. 19–35
Jagielski, M., Oprea, A., Biggio, B., Liu, C., Nita-Rotaru, C., Li, B., 2018 · 2018
Later among the works it cites.
Asynchronous decentralized parallel stochastic gradient descent, in: International Conference on Machine Learning, PMLR. pp. 3043–3052
Lian, X., Zhang, W., Zhang, C., Liu, J., 2018 · 2018
Later among the works it cites.
Inference attacks against collaborative learning
Melis, L., Song, C., De Cristofaro, E., Shmatikov, V., 2018 · 2018
Later among the works it cites.
The hidden vulnerability of distributed learning in byzantium
Mhamdi, E.M.E., Guerraoui, R., Rouault, S., 2018 · 2018
Later among the works it cites.
Nasr, M., Shokri, R., Houmansadr, A., 2018 · 2018
Later among the works it cites.
Privacy-preserving deep learning via additively homomorphic encryption
Phong, L.T., Aono, Y., Hayashi, T., Wang, L., Moriai, S., 2018 · 2018
Later among the works it cites.
Applied federated learning: Improving google keyboard query suggestions
Yang, T., Andrew, G., Eichner, H., Sun, H., Li, W., Kong, N., Ramage, D., Beaufays, F., 2018 · 2018
Later among the works it cites.
Federated learning with non-iid data
Zhao, Y., Li, M., Lai, L., Suda, N., Civin, D., Chandra, V., 2018 · 2018
Later among the works it cites.
Distributed asynchronous optimization with unbounded delays: How slow can you go?, in: International Conference on Machine Learning, PMLR. pp. 5970–5979
Zhou, Z., Mertikopoulos, P., Bambos, N., Glynn, P., Ye, Y., Li, L.J., Fei-Fei, L., 2018 · 2018
Later among the works it cites.
Demystifying parallel and distributed deep learning: An in-depth concurrency analysis
Ben-Nun, T., Hoefler, T., 2019 · 2019
Later among the works it cites.
Analyzing federated learning through an adversarial lens, in: International Conference on Machine Learning, pp. 634–643
Bhagoji, A.N., Chakraborty, S., Mittal, P., Calo, S., 2019 · 2019
Later among the works it cites.
Making ai forget you: Data deletion in machine learning, in: Advances in Neural Information Processing Systems, pp. 3518–3531
Ginart, A., Guan, M., Valiant, G., Zou, J.Y., 2019 · 2019
Later among the works it cites.
Exploiting unintended feature leakage in collaborative learning, in: 2019 IEEE Symposium on Security and Privacy (SP), IEEE. pp. 691–706
Melis, L., Song, C., De Cristofaro, E., Shmatikov, V., 2019 · 2019
Later among the works it cites.
Agnostic federated learning, in: 36th International Conference on Machine Learning, ICML 2019, International Machine Learning Society (IMLS). pp. 8114–8124
Mohri, M., Sivek, G., Suresh, A.T., 2019 · 2019
Later among the works it cites.
Comprehensive privacy analysis of deep learning: Passive and active white-box inference attacks against centralized and federated learning, in: 2019 IEEE Symposium on Security and Privacy (SP), IEEE. pp. 739–753
Nasr, M., Shokri, R., Houmansadr, A., 2019 · 2019
Later among the works it cites.
Robust and communication-efficient collaborative learning, in: Advances in Neural Information Processing Systems, pp. 8388–8399
Reisizadeh, A., Taheri, H., Mokhtari, A., Hassani, H., Pedarsani, R., 2019 · 2019
Later among the works it cites.
Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead
Rudin, C., 2019 · 2019
Later among the works it cites.
Utilizing transfer learning and homomorphic encryption in a privacy preserving and secure biometric recognition system
Salem, M., Taheri, S., Yuan, J.S., 2019 · 2019
Later among the works it cites.
Gdpr-compliant personal data management: A blockchain-based solution
Truong, N.B., Sun, K., Lee, G.M., Guo, Y., 2019 · 2019
Later among the works it cites.
Beyond inferring class representatives: User-level privacy leakage from federated learning, in: IEEE INFOCOM 2019-IEEE Conference on Computer Communications, IEEE. pp. 2512–2520
Wang, Z., Song, M., Zhang, Z., Song, Y., Wang, Q., Qi, H., 2019b · 2019
Later among the works it cites.
How to backdoor federated learning, in: International Conference on Artificial Intelligence and Statistics, pp. 2938–2948
Bagdasaryan, E., Veit, A., Hua, Y., Estrin, D., Shmatikov, V., 2020 · 2020
Closest in time.
Interpretable and differentially private predictions., in: AAAI, pp. 4083–4090
Harder, F., Bauer, M., Park, M., 2020 · 2020
Closest in time.
On the responsible use of digital data to tackle the covid-19 pandemic
Ienca, M., Vayena, E., 2020 · 2020
Closest in time.
Federated learning: Challenges, methods, and future directions
Li, T., Sahu, A.K., Talwalkar, A., Smith, V., 2020 · 2020
Closest in time.
Interpretable Machine Learning
Molnar, C., 2020 · 2020
Closest in time.
Convergence of edge computing and deep learning: A comprehensive survey
Wang, X., Han, Y., Leung, V.C., Niyato, D., Yan, X., Chen, X., 2020 · 2020
Closest in time.
Federated learning with differential privacy: Algorithms and performance analysis
Wei, K., Li, J., Ding, M., Ma, C., Yang, H.H., Farokhi, F., Jin, S., Quek, T.Q., Poor, H.V., 2020 · 2020
Closest in time.