Fetching the paper…
Reading the bibliography…
Recent advances in Federated Learning (FL) have brought large-scale collaborative machine learning opportunities for massively distributed clients with performance and data privacy guarantees.
M. Simaan and J. B. J. Cruz, “On the stackelberg strategy in nonzero-sum games,” JOTA , vol. 11, pp. 533–555, 1973
1973
Earlier work this paper cites.
M. Rabin, “Incorporating fairness into game theory and economics,” The American Economic Review , vol. 83, pp. 1281–1302, 1993
1993
Earlier work this paper cites.
Y.-K. Che, “Design competition through multidimensional auctions,” The RAND Journal of Economics , pp. 668–680, 1993
1993
Earlier work this paper cites.
L. S. Shapley, “A value for n-person games,” Classics in game theory , vol. 69, 1997
1997
Earlier work this paper cites.
R. Jain, D. Chiu, and W. Hawe, “A quantitative measure of fairness and discrimination for resource allocation in shared computer systems,” ArXiv , vol. cs.NI/9809099, 1998
1998
Earlier work this paper cites.
C. C. Aggarwal, A. Hinneburg, and D. A. Keim, “On the surprising behavior of distance metrics in high dimensional space,” in ICDT’01 , J. Van den Bussche and V. Vianu, Eds., 2001, pp. 420–434
2001
Earlier work this paper cites.
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire, “The nonstochastic multiarmed bandit problem,” SICOMP , vol. 32, no. 1, pp. 48–77, 2002
2002
Earlier work this paper cites.
A. Jøsang and R. Ismail, “The beta reputation system,” BLED’02 , pp. 324–337, 2002
2002
Earlier work this paper cites.
P. Bolton and M. Dewatripont, Contract Theory . MIT Press, 2005
2005
Earlier work this paper cites.
Y. Liu, K. Li, Y. Zhang, and W. Qu, “A novel reputation computation model based on subjective logic for mobile ad hoc networks,” in NSS’09 , 2009, pp. 294–301
2009
Earlier work this paper cites.
Savarimuthu, B. T. Roy, and S. Cranefield, “Norm creation, spreading and emergence: A survey of simulation models of norms in multi-agent systems,” Multiagent and Grid Systems , vol. 7, no. 1, pp. 21–54, 2011
2011
Earlier work this paper cites.
C. Dwork, M. Hardt, T. Pitassi, O. Reingold, and R. Zemel, “Fairness through awareness,” in ITCS’12 , 2012, pp. 214–226
2012
Earlier work this paper cites.
A. Anonymous, “Consumer data privacy in a networked world: A framework for protecting privacy and promoting innovation in the global digital economy,” JPC , vol. 4, no. 2, 2013
2013
Earlier work this paper cites.
H. Yu, Z. Shen, C. Leung, C. Miao, and V. R. Lesser, “A survey of multi-agent trust management systems,” IEEE Access , vol. 1, no. 1, pp. 35–50, 2013
2013
Earlier work this paper cites.
N. Srivastava, G. E. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: a simple way to prevent neural networks from overfitting,” JMLR , vol. 15, no. 56, pp. 1929–1958, 2014
2014
Earlier work this paper cites.
J. Gama, I. Žliobaitė, A. Bifet, M. Pechenizkiy, and A. Bouchachia, “A survey on concept drift adaptation,” ACM CSUR , vol. 46, no. 4, pp. 44:1–44:37, 2014
2014
Earlier work this paper cites.
2015
Earlier work this paper cites.
M. Hardt, E. Price, and N. Srebro, “Equality of opportunity in supervised learning,” in NeurIPS’16 , 2016, pp. 3323–3331
2016
Earlier work this paper cites.
W. Fang, C. Zhang, Z. Shi, Q. Zhao, and L. Shan, “Btres: Beta-based trust and reputation evaluation system for wireless sensor networks,” JNCA , vol. 59, pp. 88–94, 2016
2016
Earlier work this paper cites.
A. Heidarian and M. J. Dinneen, “A hybrid geometric approach for measuring similarity level among documents and document clustering,” in BigDataService’16 , 2016, pp. 142–151
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 AISTATS’17 , 2017, pp. 1273–1282
2017
Earlier work this paper cites.
M. B. Zafar, I. Valera, M. Gomez Rodriguez, and K. P. Gummadi, “Fairness beyond disparate treatment & disparate impact: Learning classification without disparate mistreatment,” in WWW’17 , 2017
2017
Earlier work this paper cites.
S. Gollapudi, K. Kollias, D. Panigrahi, and V. Pliatsika, “Profit sharing and efficiency in utility games,” in ESA’17 , 2017, pp. 43:1–43:14
2017
Earlier work this paper cites.
2018
Earlier work this paper cites.
G. Cormode, S. Jha, T. Kulkarni, N. Li, D. Srivastava, and T. Wang, “Privacy at scale: Local differential privacy in practice,” in SIGMOD’18 , 2018, pp. 1655–1658
2018
Earlier work this paper cites.
Q. Yang, Y. Liu, T. Chen, and Y. Tong, “Federated machine learning: Concept and applications,” ACM TIST , vol. 10, no. 2, pp. 12:1–12:19, 2019
2019
Earlier work this paper cites.
Q. Yang, Y. Liu, Y. Cheng, Y. Kang, T. Chen, and H. Yu, Federated Learning . Morgan & Claypool Publishers, 2019
2019
Earlier work this paper cites.
T. Nishio and R. Yonetani, “Client selection for federated learning with heterogeneous resources in mobile edge,” in ICC’19 , 2019, pp. 1–7
2019
Earlier work this paper cites.
2019
Earlier work this paper cites.
M. Mohri, G. Sivek, and A. T. Suresh, “Agnostic federated learning,” in ICML’19 , 2019
2019
Earlier work this paper cites.
J. Kang, Z. Xiong, D. Niyato, H. Yu, Y. Liang, and D. I. Kim, “Incentive design for efficient federated learning in mobile networks: A contract theory approach,” in APWCS’19 , 2019, pp. 1–5
2019
Earlier work this paper cites.
T. Song, Y. Tong, and S. Wei, “Profit allocation for federated learning,” in IEEE BigData’19 , 2019, pp. 2577–2586
2019
Earlier work this paper cites.
J. Kang, Z. Xiong, D. Niyato, S. Xie, and J. Zhang, “Incentive mechanism for reliable federated learning: A joint optimization approach to combining reputation and contract theory,” IEEE IoT-J , vol. 6, no. 6, pp. 10 700–10 714, 2019
2019
Earlier work this paper cites.
G. Wang, C. X. Dang, and Z. Zhou, “Measure contribution of participants in federated learning,” in IEEE BigData’19 , 2019, pp. 2597–2604
2019
Earlier work this paper cites.
A. Ghorbani and J. Zou, “Data shapley: Equitable valuation of data for machine learning,” in ICML’19 , 2019, pp. 2242–2251
2019
Cited alongside, same era.
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 AISTATS’19 , 2019, pp. 1167–1176
2019
Cited alongside, same era.
S. Feng, D. T. Niyato, P. Wang, D. I. Kim, and Y.-C. Liang, “Joint service pricing and cooperative relay communication for federated learning,” 2019 International Conference on iThings and IEEE GreenCom and IEEE CPSCom and IEEE SmartData , pp. 815–820, 2019
2019
Cited alongside, same era.
H. Wang, Z. Kaplan, D. Niu, and B. Li, “Optimizing federated learning on non-iid data with reinforcement learning,” INFOCOM’20 , pp. 1698–1707, 2020
2020
Cited alongside, same era.
Y. Jee Cho, S. Gupta, G. Joshi, and O. Yağan, “Bandit-based communication-efficient client selection strategies for federated learning,” in ACSSC’20 , 2020, pp. 1066–1069
2020
Later among the works it cites.
H. Wang, K. Sreenivasan, S. Rajput, H. Vishwakarma, S. Agarwal, J.-y. Sohn, K. Lee, and D. Papailiopoulos, “Attack of the tails: Yes, you really can backdoor federated learning,” NeurIPS’20 , vol. 33, pp. 16 070–16 084, 2020
2020
Later among the works it cites.
R. Shokri, M. Strobel, and Y. Zick, “On the privacy risks of model explanations,” in AIES-21 , 2021, pp. 231–241
2020
Later among the works it cites.
Y. Zhan, J. Zhang, Z. Hong, L. Wu, P. Li, and S. Guo, “A survey of incentive mechanism design for federated learning,” IEEE Transactions on Emerging Topics in Computing , pp. 1–1, 2021
2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2020
Cited alongside, same era.
N. Yoshida, T. Nishio, M. Morikura, K. Yamamoto, and R. Yonetani, “Hybrid-fl for wireless networks: Cooperative learning mechanism using non-iid data,” ICC’20 , pp. 1–7, 2020
2020
Cited alongside, same era.
T. Li, M. Sanjabi, A. Beirami, and V. Smith, “Fair resource allocation in federated learning,” in ICLR’20 , 2020
2020
Cited alongside, same era.
X. Zhang, F. Li, Z. yu Zhang, Q. Li, C. Wang, and J. Wu, “Enabling execution assurance of federated learning at untrusted participants,” in INFOCOM’20 , 2020, pp. 1877–1886
2020
Cited alongside, same era.
L. Lyu, J. Yu, K. Nandakumar, Y. Li, X. Ma, J. Jin, H. Yu, and K. S. Ng, “Towards fair and privacy-preserving federated deep models,” IEEE TPDS , vol. 31, no. 11, pp. 2524–2541, 2020
2020
Cited alongside, same era.
2020
Cited alongside, same era.
T. Wang, J. Rausch, C. Zhang, R. Jia, and D. Song, “A principled approach to data valuation for federated learning,” Federated Learning: Privacy and Incentive , pp. 153–167, 2020
2020
Cited alongside, same era.
S. Wei, Y. Tong, Z. Zhou, and T. Song, “Efficient and fair data valuation for horizontal federated learning,” Federated Learning: Privacy and Incentive , pp. 139–152, 2020
2020
Cited alongside, same era.
2021
Closest in time.
Q. Zeng, Y. Du, K. Huang, and K. K. Leung, “Energy-efficient resource management for federated edge learning with CPU-GPU heterogeneous computing,” IEEE Trans. Wirel. Commun. , 2021
2021
Closest in time.
2021
Closest in time.
V. Mothukuri, R. M. Parizi, S. Pouriyeh, Y. Huang, A. Dehghantanha, and G. Srivastava, “A survey on security and privacy of federated learning,” Future Generation Computer Systems , vol. 115, pp. 619–640, 2021
2021
Closest in time.
M. H. U. Rehman, A. Dirir, K. Salah, E. Damiani, and D. Svetinovic, “Trustfed: A framework for fair and trustworthy cross-device federated learning in iiot,” IEEE TII , vol. 17, no. 12, pp. 8485–8494, 2021
2021
Closest in time.
N. Mehrabi, F. Morstatter, N. Saxena, K. Lerman, and A. Galstyan, “A survey on bias and fairness in machine learning,” ACM CSUR , vol. 54, no. 6, pp. 115:1–115:35, 2021
2021
Closest in time.
W. Du, D. Xu, X. Wu, and H. Tong, “Fairness-aware agnostic federated learning,” in SDM’21 , 2021, pp. 181–189
2021
Closest in time.
P. Zhou, P. Fang, and P. Hui, “Loss tolerant federated learning,” ArXiv , vol. abs/2105.03591, 2021
2021
Closest in time.
T. Huang, W.-W. Lin, W. Wu, L. He, K. Li, and A. Y. Zomaya, “An efficiency-boosting client selection scheme for federated learning with fairness guarantee,” IEEE TPDS , vol. 32, pp. 1552–1564, 2021
2021
Closest in time.
M. Yang, X. Wang, H. Zhu, H. Wang, and H. Qian, “Federated learning with class imbalance reduction,” in EUSIPCO’21 , 2021, pp. 2174–2178
2021
Closest in time.
N. Bouacida, J. Hou, H. Zang, and X. Liu, “Adaptive federated dropout: Improving communication efficiency and generalization for federated learning,” in INFOCOM Workshop , 2021, pp. 1–6
2021
Closest in time.
S. Horváth, S. Laskaridis, M. Almeida, I. Leontiadis, S. Venieris, and N. Lane, “Fjord: Fair and accurate federated learning under heterogeneous targets with ordered dropout,” in NeurIPS’21 , vol. 34, 2021, pp. 12 876–12 889
2021
Closest in time.
T. Li, S. Hu, A. Beirami, and V. Smith, “Ditto: Fair and robust federated learning through personalization,” in ICML’21 , 2021, pp. 6357–6368
2021
Closest in time.
S. Cui, W. Pan, J. Liang, C. Zhang, and F. Wang, “Addressing algorithmic disparity and performance inconsistency in federated learning,” in NeurIPS’21 , 2021, pp. 26 091–26 102
2021
Closest in time.
Z. Wang, X. Fan, J. Qi, C. Wen, C. Wang, and R. Yu, “Federated learning with fair averaging,” in IJCAI’21 , 2021, pp. 1615–1623
2021
Closest in time.
T. H. T. Le, N. H. Tran, Y. K. Tun, M. N. Nguyen, S. R. Pandey, Z. Han, and C. S. Hong, “An incentive mechanism for federated learning in wireless cellular networks: An auction approach,” IEEE Trans. Wirel. Commun. , vol. 20, no. 8, pp. 4874–4887, 2021
2021
Closest in time.
J. Zhang, Y. Wu, and R. Pan, “Incentive mechanism for horizontal federated learning based on reputation and reverse auction,” in WWW’21 , 2021, pp. 947–956
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
2021
Closest in time.
M. Du, F. Yang, N. Zou, and X. Hu, “Fairness in deep learning: A computational perspective,” IEEE Intell Syst , vol. 36, no. 4, pp. 25–34, 2021
2021
Closest in time.
J. Zhang, Y. Shu, and H. Yu, “Fairness in Design: A framework for facilitating ethical AI designs,” Int. J. Crowd Sci. , 2022
2022
Closest in time.
A. Z. Tan, H. Yu, L. Cui, and Q. Yang, “Towards personalized federated learning,” TNNLS , 2022
2022
Closest in time.
T. Huang, W. Lin, L. Shen, K. Li, and A. Y. Zomaya, “Stochastic client selection for federated learning with volatile clients,” IEEE IoT-J , 2022
2022
Closest in time.
Z. Song, H. Sun, H. H. Yang, X. Wang, Y. Zhang, and T. Q. S. Quek, “Reputation-based federated learning for secure wireless networks,” IEEE IoT-J , vol. 9, no. 2, pp. 1212–1226, 2022
2022
Closest in time.
Y. Jiang, S. Wang, V. Valls, B. J. Ko, W.-H. Lee, K. K. Leung, and L. Tassiulas, “Model pruning enables efficient federated learning on edge devices,” TNNLS , pp. 1–13, 2022
2022
Closest in time.
Z. Liu, Y. Chen, H. Yu, Y. Liu, and L. Cui, “GTG-Shapley: Efficient and accurate participant contribution evaluation in federated learning,” ACM TIST , vol. 13, no. 4, pp. 60:1–60:21, 2022
2022
Closest in time.
2022
Closest in time.
J. Zhang and H. Yu, “EID: Facilitating explainable AI design discussions in team-based settings,” Int. J. Crowd Sci. , 2022
2022
Closest in time.