Fetching the paper…
Reading the bibliography…
We consider the problem of training a $d$ dimensional model with distributed differential privacy (DP) where secure aggregation (SecAgg) is used to ensure that the server only sees the noisy sum of $n$ model updates in every training round.
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., D’Oliveira, R. G. L., Eichner, H., Rouayheb, S. E., Evans, D., Gardner, J., Garrett, Z., Gascón, A., Ghazi, B., Gibbons, P. B., Gruteser, M., Harchaoui, Z., He, C., He, L., Huo, Z., Hutchinson, B., Hsu, J., Jaggi, M., Javidi, T., Joshi, G., Khodak, M., Konecný, J., Korolova, A., Koushanfar, F., Koyejo, S., Lepoint, T., Liu, Y., Mittal, P., Mohri, M., Nock, R., Özgür, A., Pagh, R., Qi, H., Ramage, D., Raskar, R., Raykova, M., Song, D., Song, W., Stich, S. U., Sun, Z., Suresh, A. T., Tramèr, F., Vepakomma, P., Wang, J., Xiong, L., Xu, Z., Yang, Q., Yu, F. X., Yu, H., and Zhao, S · 1935
Earlier work this paper cites.
Some methods of speeding up the convergence of iteration methods
Polyak, B. T · 1964
Earlier work this paper cites.
Randomized response: A survey technique for eliminating evasive answer bias
Warner, S. L · 1965
Earlier work this paper cites.
Regression shrinkage and selection via the lasso
Tibshirani, R · 1996
Earlier work this paper cites.
Privacy preserving mining of association rules
Evfimievski, A., Srikant, R., Agrawal, R., and Gehrke, J · 2004
Earlier work this paper cites.
Cryptography from anonymity
Ishai, Y., Kushilevitz, E., Ostrovsky, R., and Sahai, A · 2006
Earlier work this paper cites.
Restricted eigenvalue properties for correlated gaussian designs
Raskutti, G., Wainwright, M. J., and Yu, B · 2010
Earlier work this paper cites.
What can we learn privately?
Kasiviswanathan, S. P., Lee, H. K., Nissim, K., Raskhodnikova, S., and Smith, A · 2011
Earlier work this paper cites.
Local privacy and statistical minimax rates
Duchi, J. C., Jordan, M. I., and Wainwright, M. J · 2013
Earlier work this paper cites.
Stochastic gradient descent with differentially private updates
Song, S., Chaudhuri, K., and Sarwate, A. D · 2013
Earlier work this paper cites.
Private empirical risk minimization: Efficient algorithms and tight error bounds
Bassily, R., Smith, A., and Thakurta, A · 2014
Earlier work this paper cites.
Sparser johnson-lindenstrauss transforms
Kane, D. M. and Nelson, J · 2014
Earlier work this paper cites.
Practical secure aggregation for federated learning on user-held data
Bonawitz, K., Ivanov, V., Kreuter, B., Marcedone, A., McMahan, H. B., Patel, S., Ramage, D., Segal, A., and Seth, K · 2016
Earlier work this paper cites.
Concentrated differential privacy: Simplifications, extensions, and lower bounds
Bun, M. and Steinke, T · 2016
Earlier work this paper cites.
Discrete distribution estimation under local privacy
Kairouz, P., Bonawitz, K., and Ramage, D · 2016
Earlier work this paper cites.
Sparse communication for distributed gradient descent
Aji, A. F. and Heafield, K · 2017
Earlier work this paper cites.
Qsgd: Communication-efficient sgd via gradient quantization and encoding
Alistarh, D., Grubic, D., Li, J., Tomioka, R., and Vojnovic, M · 2017
Earlier work this paper cites.
Prochlo: Strong privacy for analytics in the crowd
Bittau, A., Erlingsson, Ú., Maniatis, P., Mironov, I., Raghunathan, A., Lie, D., Rudominer, M., Kode, U., Tinnes, J., and Seefeld, B · 2017
Earlier work this paper cites.
Differentially private federated learning: A client level perspective
Geyer, R. C., Klein, T., and Nabi, M · 2017
Cited alongside, same era.
Deep gradient compression: Reducing the communication bandwidth for distributed training
Lin, Y., Han, S., Mao, H., Wang, Y., and Dally, W. J · 2017
Cited alongside, same era.
Rényi differential privacy
Mironov, I · 2017
Cited alongside, same era.
Membership inference attacks against machine learning models
Shokri, R., Stronati, M., Song, C., and Shmatikov, V · 2017
Cited alongside, same era.
Distributed mean estimation with limited communication
Suresh, A. T., Yu, F. X., Kumar, S., and McMahan, H. B · 2017
Cited alongside, same era.
Gradient sparsification for communication-efficient distributed optimization
High-dimensional statistics: A non-asymptotic viewpoint , volume 48
Wainwright, M. J · 2019
Later among the works it cites.
A better bound gives a hundred rounds: Enhanced privacy guarantees via f-divergences
Asoodeh, S., Liao, J., Calmon, F. P., Kosut, O., and Sankar, L · 2020
Later among the works it cites.
Separating local & shuffled differential privacy via histograms
Balcer, V. and Cheu, A · 2020
Later among the works it cites.
Private summation in the multi-message shuffle model
Balle, B., Bell, J., Gascón, A., and Nissim, K · 2020
Later among the works it cites.
Lower bounds for learning distributions under communication constraints via fisher information
Barnes, L. P., Han, Y., and Ozgur, A · 2020
Later among the works it cites.
Secure single-server aggregation with (poly) logarithmic overhead
Bell, J. H., Bonawitz, K. A., Gascón, A., Lepoint, T., and Raykova, M · 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Wangni, J., Wang, J., Liu, J., and Zhang, T · 2017
Cited alongside, same era.
cpsgd: Communication-efficient and differentially-private distributed sgd
Agarwal, N., Suresh, A. T., Yu, F. X. X., Kumar, S., and McMahan, B · 2018
Cited alongside, same era.
signsgd: Compressed optimisation for non-convex problems
Bernstein, J., Wang, Y.-X., Azizzadenesheli, K., and Anandkumar, A · 2018
Cited alongside, same era.
Leaf: A benchmark for federated settings
Caldas, S., Duddu, S. M. K., Wu, P., Li, T., Konečnỳ, J., McMahan, H. B., Smith, V., and Talwalkar, A · 2018
Cited alongside, same era.
Minimal random code learning: Getting bits back from compressed model parameters
Havasi, M., Peharz, R., and Hernández-Lobato, J. M · 2018
Cited alongside, same era.
The privacy blanket of the shuffle model
Balle, B., Bell, J., Gascón, A., and Nissim, K · 2019
Cited alongside, same era.
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
Cited alongside, same era.
Later among the works it cites.
The discrete gaussian for differential privacy
Canonne, C. L., Kamath, G., and Steinke, T · 2020
Later among the works it cites.
Breaking the communication-privacy-accuracy trilemma
Chen, W.-N., Kairouz, P., and Ozgur, A · 2020
Later among the works it cites.
Pure differentially private summation from anonymous messages
Ghazi, B., Golowich, N., Kumar, R., Manurangsi, P., Pagh, R., and Velingker, A · 2020
Later among the works it cites.
Fedsketch: Communication-efficient and private federated learning via sketching
Haddadpour, F., Karimi, B., Li, P., and Li, X · 2020
Later among the works it cites.
A primer on private statistics
Kamath, G. and Ullman, J · 2020
Later among the works it cites.
Fetchsgd: Communication-efficient federated learning with sketching
Rothchild, D., Panda, A., Ullah, E., Ivkin, N., Stoica, I., Braverman, V., Gonzalez, J., and Arora, R · 2020
Later among the works it cites.
The skellam mechanism for differentially private federated learning
Agarwal, N., Kairouz, P., and Liu, Z · 2021
Later among the works it cites.
Differentially private learning with adaptive clipping
Andrew, G., Thakkar, O., McMahan, B., and Ramaswamy, S · 2021
Later among the works it cites.
Connecting robust shuffle privacy and pan-privacy
Balcer, V., Cheu, A., Joseph, M., and Mao, J · 2021
Later among the works it cites.
On the power of multiple anonymous messages
Ghazi, B., Golowich, N., Kumar, R., Pagh, R., and Velingker, A · 2021
Later among the works it cites.
Shuffled model of federated learning: Privacy, accuracy and communication trade-offs
Girgis, A. M., Data, D., Diggavi, S., Kairouz, P., and Suresh, A. T · 2021
Later among the works it cites.
Iterative sketching and its application to federated learning
Anonymous · 2022
Closest in time.