Fetching the paper…
Reading the bibliography…
Federated learning is an emerging decentralized machine learning scheme that allows multiple data owners to work collaboratively while ensuring data privacy.
1912
Earlier work this paper cites.
N. Metropolis and S. Ulam, “The monte carlo method,” Journal of the American statistical association , vol. 44, no. 247, pp. 335–341, 1949
1949
Earlier work this paper cites.
L. Shapley, “A value for n-person games,” RAND CORP SANTA MONICA CA, Tech. Rep., 1952
1952
Earlier work this paper cites.
J. H. Zar, “Significance testing of the spearman rank correlation coefficient,” Journal of the American Statistical Association , vol. 67, no. 339, pp. 578–580, 1972
1972
Earlier work this paper cites.
F. R. Hampel, “The influence curve and its role in robust estimation,” Journal of the american statistical association , vol. 69, no. 346, pp. 383–393, 1974
1974
Earlier work this paper cites.
P. Dubey, “On the uniqueness of the shapley value,” International Journal of Game Theory , vol. 4, no. 3, pp. 131–139, 1975
1975
Earlier work this paper cites.
F. Gul, “Bargaining foundations of shapley value,” Econometrica: Journal of the Econometric Society , pp. 81–95, 1989
1989
Earlier work this paper cites.
L. L. Pipino, Y. W. Lee, and R. Y. Wang, “Data quality assessment,” Communications of the ACM , vol. 45, no. 4, pp. 211–218, 2002
2002
Earlier work this paper cites.
S. Cohen, E. Ruppin, and G. Dror, “Feature selection based on the shapley value,” In other words , vol. 1, p. 98Eqr, 2005
2005
Earlier work this paper cites.
——, “Spearman rank correlation,” Encyclopedia of biostatistics , vol. 7, 2005
2005
Earlier work this paper cites.
G. A. Liebchen and M. Shepperd, “Data sets and data quality in software engineering,” in Proceedings of the 4th international workshop on Predictor models in software engineering , 2008, pp. 39–44
2008
Earlier work this paper cites.
A. Krizhevsky, “Learning multiple layers of features from tiny images,” Tech. Rep., 2009
2009
Earlier work this paper cites.
Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer , vol. 42, no. 8, pp. 30–37, 2009
2009
Earlier work this paper cites.
A. Krizhevsky, G. Hinton et al. , “Learning multiple layers of features from tiny images,” 2009
2009
Earlier work this paper cites.
E. Strumbelj and I. Kononenko, “An efficient explanation of individual classifications using game theory,” The Journal of Machine Learning Research , vol. 11, pp. 1–18, 2010
2010
Earlier work this paper cites.
Y. LeCun and C. Cortes, “MNIST handwritten digit database,” 2010. [Online]. Available: http://yann.lecun.com/exdb/mnist/
2010
Earlier work this paper cites.
——, “Querymarket demonstration: Pricing for online data markets,” Proceedings of the VLDB Endowment , vol. 5, no. 12, pp. 1962–1965, 2012
2012
Earlier work this paper cites.
R. H. Keshavan, Efficient algorithms for collaborative filtering . Stanford University, 2012
2012
Earlier work this paper cites.
——, “Toward practical query pricing with querymarket,” in proceedings of the 2013 ACM SIGMOD international conference on management of data , 2013, pp. 613–624
2013
Earlier work this paper cites.
R. Zemel, Y. Wu, K. Swersky, T. Pitassi, and C. Dwork, “Learning fair representations,” in International conference on machine learning . PMLR, 2013, pp. 325–333
2013
Cited alongside, same era.
2013
Cited alongside, same era.
H.-F. Yu, C.-J. Hsieh, S. Si, and I. S. Dhillon, “Parallel matrix factorization for recommender systems,” Knowledge and Information Systems , vol. 41, no. 3, pp. 793–819, 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
A. Ghorbani and J. Zou, “Data shapley: Equitable valuation of data for machine learning,” in International Conference on Machine Learning . PMLR, 2019, pp. 2242–2251
2019
Later among the works it cites.
R. Jia, D. Dao, B. Wang, F. A. Hubis, N. Hynes, N. M. Gürel, B. Li, C. Zhang, D. Song, and C. J. Spanos, “Towards efficient data valuation based on the shapley value,” in The 22nd International Conference on Artificial Intelligence and Statistics . PMLR, 2019, pp. 1167–1176
2019
Later among the works it cites.
G. Wang, C. X. Dang, and Z. Zhou, “Measure contribution of participants in federated learning,” in 2019 IEEE International Conference on Big Data (Big Data) . IEEE, 2019, pp. 2597–2604
2019
Later among the works it cites.
M. Udell and A. Townsend, “Why are big data matrices approximately low rank?” SIAM Journal on Mathematics of Data Science , vol. 1, no. 1, pp. 144–160, 2019
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…
2015
Cited alongside, same era.
J. R. Heckman, E. L. Boehmer, E. H. Peters, M. Davaloo, and N. G. Kurup, “A pricing model for data markets,” iConference 2015 Proceedings , 2015
2015
Cited alongside, same era.
2016
Cited alongside, same era.
R. Sun and Z.-Q. Luo, “Guaranteed matrix completion via non-convex factorization,” IEEE Transactions on Information Theory , vol. 62, no. 11, pp. 6535–6579, 2016
2016
Cited alongside, same era.
W.-S. Chin, B.-W. Yuan, M.-Y. Yang, Y. Zhuang, Y.-C. Juan, and C.-J. Lin, “Libmf: A library for parallel matrix factorization in shared-memory systems.” J. Mach. Learn. Res. , vol. 17, no. 1, pp. 2971–2975, 2016
2016
Cited alongside, same era.
B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-efficient learning of deep networks from decentralized data,” in Artificial Intelligence and Statistics . PMLR, 2017, pp. 1273–1282
2017
Cited alongside, same era.
S. M. Lundberg and S.-I. Lee, “A unified approach to interpreting model predictions,” in Proceedings of the 31st international conference on neural information processing systems , 2017, pp. 4768–4777
2017
Cited alongside, same era.
P. W. Koh and P. Liang, “Understanding black-box predictions via influence functions,” in International Conference on Machine Learning . PMLR, 2017, pp. 1885–1894
2017
Cited alongside, same era.
2019
Later among the works it cites.
2019
Later among the works it cites.
2020
Later among the works it cites.
S. Wei, Y. Tong, Z. Zhou, and T. Song, “Efficient and fair data valuation for horizontal federated learning,” in Federated Learning . Springer, 2020, pp. 139–152
2020
Later among the works it cites.
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, pp. 153–167
2020
Later among the works it cites.
J. Pei, “A survey on data pricing: from economics to data science,” IEEE Transactions on Knowledge and Data Engineering , 2020
2020
Later among the works it cites.
A. Ghorbani, M. Kim, and J. Zou, “A distributional framework for data valuation,” in International Conference on Machine Learning . PMLR, 2020, pp. 3535–3544
2020
Later among the works it cites.
J. Yoon, S. Arik, and T. Pfister, “Data valuation using reinforcement learning,” in International Conference on Machine Learning . PMLR, 2020, pp. 10 842–10 851
2020
Later among the works it cites.
L. Lyu, X. Xu, Q. Wang, and H. Yu, “Collaborative fairness in federated learning,” in Federated Learning . Springer, 2020, pp. 189–204
2020
Later among the works it cites.
D. Karimi, H. Dou, S. K. Warfield, and A. Gholipour, “Deep learning with noisy labels: Exploring techniques and remedies in medical image analysis,” Medical Image Analysis , vol. 65, p. 101759, 2020
2020
Later among the works it cites.
2021
Closest in time.
Y. Kwon, M. A. Rivas, and J. Zou, “Efficient computation and analysis of distributional shapley values,” in International Conference on Artificial Intelligence and Statistics . PMLR, 2021, pp. 793–801
2021
Closest in time.
J. Zhao, X. Zhu, J. Wang, and J. Xiao, “Efficient client contribution evaluation for horizontal federated learning,” in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) . IEEE, 2021, pp. 3060–3064
2021
Closest in time.