{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T05:07:04Z","timestamp":1725080824460},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T00:00:00Z","timestamp":1711152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872044"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Municipal Program for Top Talent"},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFF0604502","2022YFF0604502"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s12083-024-01660-8","type":"journal-article","created":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T11:03:04Z","timestamp":1711191784000},"page":"1720-1731","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Node selection for model quality optimization in hierarchical federated learning based on deep reinforcement learning"],"prefix":"10.1007","volume":"17","author":[{"given":"Zhuo","family":"Li","sequence":"first","affiliation":[]},{"given":"Yashi","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,23]]},"reference":[{"key":"1660_CR1","unstructured":"Reinsel D, Gantz J, Rydning J (2017) IDC white paper, data age 2025"},{"key":"1660_CR2","unstructured":"Kone\u010dn\u1ef3 J, McMahan HB, Yu FX, Richt\u00e1rik P, Suresh AT, Bacon (2016) Federated learning: strategies for improving communication efficiency. arXiv:1610.05492"},{"key":"1660_CR3","unstructured":"Kone\u010dn\u1ef3 J, McMahan HB, Ramage D, Richt\u00e1rik P (2016) Federated optimization: distributed machine learning for on-device intelligence. arXiv:1610.02527"},{"key":"1660_CR4","first-page":"374","volume":"1","author":"K Bonawitz","year":"2019","unstructured":"Bonawitz K, Eichner H, Grieskamp W, Huba D, Ingerman A, Ivanov V, Kiddon C, Kone\u010dn\u1ef3 J, Mazzocchi S, McMahan B et al (2019) Towards federated learning at scale: system design. Proc Mach Learn Syst 1:374\u2013388","journal-title":"Proc Mach Learn Syst"},{"issue":"10","key":"1660_CR5","doi-asserted-by":"publisher","first-page":"6535","DOI":"10.1109\/TWC.2020.3003744","volume":"19","author":"S Luo","year":"2020","unstructured":"Luo S, Chen X, Wu Q, Zhi Z, Yu S (2020) HFEL: joint edge association and resource allocation for cost-efficient hierarchical federated edge learning. IEEE Trans Wirel Commun 19(10):6535\u20136548","journal-title":"IEEE Trans Wirel Commun"},{"key":"1660_CR6","unstructured":"Wang J, Wang S, Chen R-R, Ji M (2020) Local averaging helps: hierarchical federated learning and convergence analysis, 2. arXiv:2010.12998"},{"key":"1660_CR7","unstructured":"Liu L, Zhang J, Song S, Letaief KB (2021) Hierarchical quantized federated learning: convergence analysis and system design. arXiv:2103.14272"},{"key":"1660_CR8","doi-asserted-by":"crossref","unstructured":"Li Q, Diao Y, Chen Q, He B (2022) Federated learning on non-IID data silos: an experimental study. In: 2022 IEEE 38th International conference on data engineering (ICDE). IEEE, pp 965\u2013978","DOI":"10.1109\/ICDE53745.2022.00077"},{"key":"1660_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.neucom.2021.07.098","volume":"465","author":"Z Hangyu","year":"2021","unstructured":"Hangyu Z, Xu J, Shiqing L, Yaochu J (2021) Federated learning on non-IID data: a survey. Neurocomputing 465:371\u2013390","journal-title":"Neurocomputing"},{"key":"1660_CR10","unstructured":"Zhao Y, Li M, Lai L, Suda N, Civin D, Chandra V (2018) Federated learning with non-IID data. arXiv:1806.00582"},{"key":"1660_CR11","doi-asserted-by":"crossref","unstructured":"Zhang SQ, Lin J, Zhang Qi (2022) A multi-agent reinforcement learning approach for efficient client selection in federated learning. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a036. pp 9091\u20139099","DOI":"10.1609\/aaai.v36i8.20894"},{"key":"1660_CR12","unstructured":"Luping W, Wei W, Bo L (2019) CMFL: mitigating communication overhead for federated learning. In: 2019 IEEE 39th International conference on distributed computing systems (ICDCS). IEEE, pp 954\u2013964"},{"key":"1660_CR13","unstructured":"Abay A, Zhou Y, Baracaldo N, Rajamoni S, Chuba E, Ludwig H (2020) Mitigating bias in federated learning. arXiv:2012.02447"},{"key":"1660_CR14","doi-asserted-by":"crossref","unstructured":"Deng Y, Lyu F, Ren J, Chen Y-C, Yang P, Zhou Y, Zhang Y (2021) Fair: quality-aware federated learning with precise user incentive and model aggregation. In: IEEE INFOCOM 2021-IEEE conference on computer communications. IEEE, pp 1\u201310","DOI":"10.1109\/INFOCOM42981.2021.9488743"},{"key":"1660_CR15","unstructured":"Blanchard P, El\u00a0Mhamdi EM, Guerraoui R, Stainer J (2017) Machine learning with adversaries: Byzantine tolerant gradient descent. Adv Neural Inform Process Syst 30"},{"key":"1660_CR16","unstructured":"Guerraoui R, Rouault S et\u00a0al (2018) The hidden vulnerability of distributed learning in Byzantium. In: International conference on machine learning. PMLR, pp 3521\u20133530"},{"key":"1660_CR17","unstructured":"Cho YJ, Wang J, Joshi G (2020) Client selection in federated learning: convergence analysis and power-of-choice selection strategies. arXiv:2010.01243"},{"key":"1660_CR18","first-page":"429","volume":"2","author":"T Li","year":"2020","unstructured":"Li T, Sahu AK, Zaheer M, Sanjabi M, Talwalkar A, Smith V (2020) Federated optimization in heterogeneous networks. Proc Mach Learn Syst 2:429\u2013450","journal-title":"Proc Mach Learn Syst"},{"key":"1660_CR19","doi-asserted-by":"crossref","unstructured":"Yoshida N, Nishio T, Morikura M, Yamamoto K, Yonetani R (2019) Hybrid-FL: cooperative learning mechanism using non-IID data in wireless networks. arXiv:1905.07210","DOI":"10.1109\/ICC40277.2020.9149323"},{"key":"1660_CR20","doi-asserted-by":"crossref","unstructured":"Wolfrath J, Sreekumar N, Kumar D, Wang Y, Chandra A (2022) HACCS: heterogeneity-aware clustered client selection for accelerated federated learning. In: 2022 IEEE International parallel and distributed processing symposium (IPDPS). IEEE, pp 985\u2013995","DOI":"10.1109\/IPDPS53621.2022.00100"},{"key":"1660_CR21","unstructured":"Karimireddy SP, Kale S, Mohri M, Reddi SJ, Stich SU, Suresh AT (2019) SCAFFOLD: stochastic controlled averaging for on-device federated learning. arXiv:1910.06378"},{"key":"1660_CR22","unstructured":"Zhu Z, Hong J, Zhou J (2021) Data-free knowledge distillation for heterogeneous federated learning. In: International conference on machine learning. PMLR, pp 12878\u201312889"},{"issue":"8","key":"1660_CR23","doi-asserted-by":"publisher","first-page":"3710","DOI":"10.1109\/TNNLS.2020.3015958","volume":"32","author":"F Sattler","year":"2020","unstructured":"Sattler F, M\u00fcller K-R, Samek W (2020) Clustered federated learning: model-agnostic distributed multitask optimization under privacy constraints. IEEE Trans Neural Netw Learn Syst 32(8):3710\u20133722","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1660_CR24","unstructured":"Qiu T, Zheng X, Yongxin Z, Feng S (2022) FedFog: federated learning architecture for non-IID data"},{"issue":"1","key":"1660_CR25","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1109\/TPDS.2020.3009406","volume":"32","author":"M Duan","year":"2020","unstructured":"Duan M, Liu D, Chen X, Liu R, Tan Y, Liang L (2020) Self-balancing federated learning with global imbalanced data in mobile systems. IEEE Trans Parallel Distrib Syst 32(1):59\u201371","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1660_CR26","doi-asserted-by":"crossref","unstructured":"Ribero M, Vikalo H (2020) Communication-efficient federated learning via optimal client sampling. arXiv:2007.15197","DOI":"10.52591\/lxai2020071310"},{"issue":"2","key":"1660_CR27","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s12083-021-01254-8","volume":"15","author":"J Zhao","year":"2022","unstructured":"Zhao J, Feng Y, Chang X, Liu CH (2022) Energy-efficient client selection in federated learning with heterogeneous data on edge. Peer-to-Peer Netw Appl 15(2):1139\u20131151","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"17","key":"1660_CR28","doi-asserted-by":"publisher","first-page":"16592","DOI":"10.1109\/JIOT.2022.3151193","volume":"9","author":"H Chen","year":"2022","unstructured":"Chen H, Huang S, De Zhang, Xiao M, Skoglund M, Poor HV (2022) Federated learning over wireless IoT networks with optimized communication and resources. IEEE Internet of Things J 9(17):16592\u201316605","journal-title":"IEEE Internet of Things J"},{"key":"1660_CR29","doi-asserted-by":"crossref","unstructured":"Wei X, Liu J, Shi X, Wang Y (2022) Participant selection for hierarchical federated learning in edge clouds. In: 2022 IEEE International conference on networking, architecture and storage (NAS). IEEE, pp 1\u20138","DOI":"10.1109\/NAS55553.2022.9925313"},{"key":"1660_CR30","doi-asserted-by":"crossref","unstructured":"Chen X, Li Z, Ni W, Wang X, Zhang S, Xu S, Pei Q (2022) Two-phase deep reinforcement learning of dynamic resource allocation and client selection for hierarchical federated learning. In: 2022 IEEE\/CIC International conference on communications in china (ICCC). IEEE, pp 518\u2013523","DOI":"10.1109\/ICCC55456.2022.9880724"},{"issue":"12","key":"1660_CR31","doi-asserted-by":"publisher","first-page":"4353","DOI":"10.1109\/TPDS.2022.3186960","volume":"33","author":"Z Qu","year":"2022","unstructured":"Qu Z, Rui D, Lixing C, Xu J, Lu Z, Yao L (2022) Context-aware online client selection for hierarchical federated learning. IEEE Trans Parallel Distrib Syst 33(12):4353\u20134367","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1660_CR32","unstructured":"Lai F, Zhu X, Madhyastha HV, Chowdhury M (2020) Oort: informed participant selection for scalable federated learning. arXiv:2010.06081"},{"key":"1660_CR33","doi-asserted-by":"crossref","unstructured":"Wang H, Kaplan Z, Niu D, Li B (2020) Optimizing federated learning on non-IID data with reinforcement learning. In: IEEE INFOCOM 2020-IEEE Conference on computer communications. IEEE, pp 1698\u20131707","DOI":"10.1109\/INFOCOM41043.2020.9155494"},{"key":"1660_CR34","doi-asserted-by":"crossref","unstructured":"Xin S, Zhuo L, Xin C (2022) Node selection strategy design based on reputation mechanism for hierarchical federated learning. In: 2022 18th International conference on mobility, sensing and networking (MSN). pp 718\u2013722","DOI":"10.1109\/MSN57253.2022.00117"},{"issue":"1","key":"1660_CR35","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TCCN.2021.3100574","volume":"8","author":"A Ta\u00efk","year":"2021","unstructured":"Ta\u00efk A, Mlika Z, Cherkaoui S (2021) Data-aware device scheduling for federated edge learning. IEEE Trans Cogn Commun Netw 8(1):408\u2013421","journal-title":"IEEE Trans Cogn Commun Netw"},{"issue":"7540","key":"1660_CR36","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih V, Kavukcuoglu K, Silver D, Rusu AA, Veness J, Bellemare MG, Graves A, Riedmiller M, Fidjeland AK, Ostrovski G et al (2015) Human-level control through deep reinforcement learning. Nature 518(7540):529\u2013533","journal-title":"Nature"},{"key":"1660_CR37","doi-asserted-by":"crossref","unstructured":"Van\u00a0Hasselt H, Guez A, Silver D (2016) Deep reinforcement learning with double Q-learning. In: Proceedings of the AAAI conference on artificial intelligence, vol\u00a030","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"1660_CR38","unstructured":"Mnih V, Badia AP, Mirza M, Graves A, Lillicrap T, Harley T, Silver D, Kavukcuoglu K (2016) Asynchronous methods for deep reinforcement learning. In: International conference on machine learning. PMLR, pp 1928\u20131937"},{"key":"1660_CR39","unstructured":"Xiao H, Rasul K, Vollgraf R (2017) Fashion-MNIST: a novel image dataset for benchmarking machine learning algorithms. arXiv:1708.07747"},{"key":"1660_CR40","unstructured":"LeCun Y (1998) The MNIST database of handwritten digits. https:\/\/www.yann.lecun.com\/exdb\/mnist\/"},{"key":"1660_CR41","unstructured":"Krizhevsky A, Hinton G et al (2009) Learning multiple layers of features from tiny images"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01660-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-024-01660-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01660-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T13:11:57Z","timestamp":1717938717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-024-01660-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,23]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1660"],"URL":"https:\/\/doi.org\/10.1007\/s12083-024-01660-8","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,23]]},"assertion":[{"value":"5 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We confirm that the work has not been published before, the publication has been approved by all co-authors and our contribution is original and that we have full power to make this consent.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Publish"}},{"value":"The authors declare no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS12083-024-01660-8', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid883' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:883', '*');; return false;" style='text-decoration: none; '>Association </a> <a style='color: white;' href='#diffid883'><sup>1</sup></a></div><div><a href='#diffid123' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:123', '*');; return false;" style='text-decoration: none; '>INTERN </a> <a style='color: white;' href='#diffid123'><sup>11</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>