{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:45:02Z","timestamp":1782798302032,"version":"3.54.5"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006180","name":"Technology Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006180","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/infocom59046.2026.11571211","type":"proceedings-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:38:15Z","timestamp":1782761895000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["FedSUV: Validity and Utility-guided Client Selection for Federated Learning"],"prefix":"10.1109","author":[{"given":"Xiaosong","family":"Chen","sequence":"first","affiliation":[{"name":"University of Macau,Department of Computer and Information Science,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyan","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Macau,Department of Computer and Information Science,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuanhang","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Macau,Department of Computer and Information Science,China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huanle","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Macau,Department of Computer and Information Science,China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","author":"Kone\u010dn","year":"2015","journal-title":"Federated optimization: Distributed optimization beyond the datacenter"},{"key":"ref2","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"AISTATS","author":"McMahan"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2022.3232891"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS51746.2020.00016"},{"key":"ref6","article-title":"Ranking-based client selection with imitation learning for efficient federated learning","volume-title":"ICML","author":"Tian"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3552326.3567485"},{"key":"ref8","article-title":"Fedtrans: Client-transparent utility estimation for robust federated learning","volume-title":"ICLR","author":"Yang"},{"key":"ref9","first-page":"19","article-title":"Oort: Efficient federated learning via guided participant selection","volume-title":"OSDI","author":"Lai"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.14139"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772758"},{"key":"ref12","article-title":"Contextual gaussian process bandit optimization","volume":"24","author":"Krause","year":"2011","journal-title":"NeurIPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3357223.3365441"},{"key":"ref14","first-page":"462","article-title":"Active learning for multi-objective optimization","volume-title":"ICML","author":"Zuluaga"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761315"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS49365.2020.9212881"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO56248.2022.00049"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2994391"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155494"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20894"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545062"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/twc.2020.3008091"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS54860.2022.00061"},{"key":"ref24","author":"McCandlish","year":"2018","journal-title":"An empirical model of large-batch training"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3581784.3607060"},{"key":"ref26","first-page":"2525","article-title":"Not all samples are created equal: Deep learning with importance sampling","volume-title":"ICML","author":"Katharopoulos"},{"key":"ref27","first-page":"1","article-title":"Stochastic optimization with importance sampling for regularized loss minimization","volume-title":"ICML","author":"Zhao"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3495243.3517017"},{"issue":"104","key":"ref29","first-page":"1","article-title":"e-pal: An active learning approach to the multi-objective optimization problem","volume-title":"JMLR","volume":"17","author":"Zuluaga"},{"key":"ref30","first-page":"3583","article-title":"Sequential learning of the pareto front for multi-objective bandits","volume-title":"AISTATS","author":"Garivier"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/tpds.2020.3040887"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2022.3172113"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.001.2000252"},{"issue":"1","key":"ref34","first-page":"290","article-title":"Low-latency federated learning over wireless channels with differential privacy","volume-title":"JSAC","volume":"40","author":"Wei"},{"issue":"Nov","key":"ref35","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration tradeoffs","volume-title":"JMLR","volume":"3","author":"Auer"},{"key":"ref36","article-title":"Improved algorithms for linear stochastic bandits","volume":"24","author":"Abbasi-Yadkori","year":"2011","journal-title":"NeurIPS"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545063"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28650-9_4"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17156"},{"key":"ref40","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","volume-title":"ICML","author":"Srinivas"},{"key":"ref41","first-page":"591","article-title":"Exploring compact reinforcement-learning representations with linear regression","volume-title":"UAI","author":"Walsh"},{"key":"ref42","article-title":"Stochastic linear optimization under bandit feedback","author":"Dani","year":"2008"},{"key":"ref43","first-page":"11814","article-title":"Fedscale: Benchmarking model and system performance of federated learning at scale","volume-title":"ICML","author":"Lai"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref45","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00474"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00716"},{"key":"ref48","author":"Caldas","year":"2018","journal-title":"Leaf: A benchmark for federated settings"},{"key":"ref49","author":"Warden","year":"2018","journal-title":"Speech commands: A dataset for limited-vocabulary speech recognition"},{"key":"ref50","article-title":"AI Benchmark","year":"2021"},{"key":"ref51","article-title":"MobiPerf","year":"2021"},{"key":"ref52","article-title":"Adaptive federated optimization","volume-title":"ICLR","author":"Reddi"}],"event":{"name":"IEEE INFOCOM 2026 - IEEE Conference on Computer Communications","location":"Tokyo, Japan","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["IEEE INFOCOM 2026 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11571071\/11571169\/11571211.pdf?arnumber=11571211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:18:54Z","timestamp":1782796734000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11571211\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/infocom59046.2026.11571211","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}