Fetching the paper…
Reading the bibliography…
Federated learning algorithms are developed both for efficiency reasons and to ensure the privacy and confidentiality of personal and business data, respectively.
L. S. Shapley, “A value for n-person games,” Contributions to the Theory of Games , 1953
1953
Earlier work this paper cites.
IMDB, “The Good, the Bad and the Ugly,” 1966, https://www.imdb.com/title/tt0060196/
1966
Earlier work this paper cites.
D. Harville, “Extension of the gauss-markov theorem to include the estimation of random effects,” The Annals of Statistics , 1976
1976
Earlier work this paper cites.
P. Diaconis and R. L. Graham, “Spearman’s footrule as a measure of disarray,” Journal of the Royal Statistical Society: Series B (Methodological) , 1977
1977
Earlier work this paper cites.
D. L. Chaum, “Untraceable electronic mail, return addresses, and digital pseudonyms,” Communications of the ACM , 1981
1981
Earlier work this paper cites.
L. Sweeney, “k-anonymity: A model for protecting privacy,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , 2002
2002
Earlier work this paper cites.
L. C. Ludeman, Random processes: filtering, estimation, and detection . John Wiley & Sons, Inc., 2003
2003
Earlier work this paper cites.
I. Dinur and K. Nissim, “Revealing information while preserving privacy,” in Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems . ACM, 2003
2003
Earlier work this paper cites.
S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina, “Incentives for combatting freeriding on p2p networks,” in European Conference on Parallel Processing . Springer, 2003
2003
Earlier work this paper cites.
J. H. Zar, “Spearman rank correlation,” Encyclopedia of Biostatistics , 2005
2005
Earlier work this paper cites.
C. Gentry et al. , A fully homomorphic encryption scheme . Stanford university Stanford, 2009
2009
Earlier work this paper cites.
J. Castro, D. Gómez, and J. Tejada, “Polynomial calculation of the shapley value based on sampling,” Computers & Operations Research , 2009
2009
Earlier work this paper cites.
E.-P. Lim, V.-A. Nguyen, N. Jindal, B. Liu, and H. W. Lauw, “Detecting product review spammers using rating behaviors,” in Proceedings of the 19th ACM international conference on Information and knowledge management , 2010
2010
Earlier work this paper cites.
P. Van Mieghem, “Human psychology of common appraisal: The reddit score,” IEEE Transactions on Multimedia , 2011
2011
Earlier work this paper cites.
L. Deng, “The mnist database of handwritten digit images for machine learning research [best of the web],” IEEE Signal Processing Magazine , 2012
2012
Earlier work this paper cites.
S. Arora, E. Hazan, and S. Kale, “The multiplicative weights update method: a meta-algorithm and applications,” Theory of Computing , 2012
2012
Earlier work this paper cites.
A. Krizhevsky, V. Nair, and G. Hinton, “The cifar-10 dataset,” online: http://www. cs. toronto. edu/kriz/cifar. html , 2014
2014
Earlier work this paper cites.
R. Cramer, I. B. Damgård et al. , Secure multiparty computation . Cambridge University Press, 2015
2015
Earlier work this paper cites.
M. Fredrikson, S. Jha, and T. Ristenpart, “Model inversion attacks that exploit confidence information and basic countermeasures,” in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security , 2015
2015
Earlier work this paper cites.
2016
Cited alongside, same era.
F. Tramèr, F. Zhang, A. Juels, M. K. Reiter, and T. Ristenpart, “Stealing machine learning models via prediction apis,” in 25th USENIX Security Symposium (USENIX Security 16) , 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
C. Batini, M. Scannapieco et al. , “Data and information quality,” Cham, Switzerland: Springer International Publishing. Google Scholar , 2016
2016
Cited alongside, same era.
T. Wang, J. Rausch, C. Zhang, R. Jia, and D. Song, “A principled approach to data valuation for federated learning,” in Federated Learning . Springer, 2020
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2016
Cited alongside, same era.
R. Shokri, M. Stronati, C. Song, and V. Shmatikov, “Membership inference attacks against machine learning models,” in 2017 IEEE Symposium on Security and Privacy (SP) . IEEE, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
L. Thomas, J. Crook, and D. Edelman, Credit scoring and its applications . SIAM, 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
2018
Cited alongside, same era.
B. Pejo, Q. Tang, and G. Biczok, “Together or alone: The price of privacy in collaborative learning,” Proceedings on Privacy Enhancing Technologies , 2019
2019
Cited alongside, same era.
L. Zhu, Z. Liu, and S. Han, “Deep leakage from gradients,” in Advances in Neural Information Processing Systems , 2019
2019
Cited alongside, same era.
J. Huang, R. Talbi, Z. Zhao, S. Boucchenak, L. Y. Chen, and S. Roos, “An exploratory analysis on users’ contributions in federated learning,” in 2020 Second IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) . IEEE, 2020
2020
Closest in time.
A. Ghorbani, M. Kim, and J. Zou, “A distributional framework for data valuation,” in International Conference on Machine Learning . PMLR, 2020
2020
Closest in time.
2020
Closest in time.
M. Xu, L. van der Maaten, and A. Hannun, “Data appraisal without data sharing,” 2020
2020
Closest in time.
2021
Closest in time.
Y. Fraboni, R. Vidal, and M. Lorenzi, “Free-rider attacks on model aggregation in federated learning,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
L. Nagalapatti and R. Narayanam, “Game of gradients: Mitigating irrelevant clients in federated learning,” in Proceedings of the AAAI Conference on Artificial Intelligence , 2021
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
B. Pejó, G. Biczók, and G. Ács, “Measuring contributions in privacy-preserving federated learning,” ERCIM NEWS , p. 35, 2021
2021
Closest in time.
2021
Closest in time.
2022
Closest in time.
C. Yang, J. Liu, H. Sun, T. Li, and Z. Li, “Wtdp-shapley: Efficient and effective incentive mechanism in federated learning for intelligent safety inspection,” IEEE Transactions on Big Data , 2022
2022
Closest in time.