{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:38Z","timestamp":1740133238408,"version":"3.37.3"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSF China","doi-asserted-by":"publisher","award":["61532012","61325012","61521062","61602303","61428205"],"award-info":[{"award-number":["61532012","61325012","61521062","61602303","61428205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/tnet.2018.2814779","type":"journal-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T19:12:52Z","timestamp":1523646772000},"page":"1092-1109","source":"Crossref","is-referenced-by-count":6,"title":["FINE: A Framework for Distributed Learning on Incomplete Observations for Heterogeneous Crowdsensing Networks"],"prefix":"10.1109","volume":"26","author":[{"given":"Luoyi","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songjun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lingkun","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyu","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0357-8356","authenticated-orcid":false,"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0174-2"},{"key":"ref38","first-page":"871","article-title":"The Laplacian spectrum of graphs","volume":"2","author":"mohar","year":"1991","journal-title":"Graph Theory Combinatorics and Applications"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/s10957-010-9737-7","article-title":"Distributed stochastic subgradient projection algorithms for convex optimization","volume":"147","author":"ram","year":"2010","journal-title":"J Optim Theory Appl"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031203"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume":"87","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"article-title":"Defending distributed systems against adversarial attacks: Consensus, consensus-based learning, and statistical learning","year":"2017","author":"su","key":"ref30"},{"key":"ref37","volume":"92","author":"chung","year":"1997","journal-title":"Spectral Graph Theory"},{"journal-title":"Distributed Detection Finite-time Analysis and Impact of Network Topology","year":"2014","author":"shahrampour","key":"ref36"},{"key":"ref35","first-page":"5884","article-title":"Nonasymptotic convergence rates for cooperative learning over time-varying directed graphs","author":"nedi?","year":"2015","journal-title":"Proc Amer Control Conf"},{"journal-title":"Linear Time Average Consensus on Fixed Graphs and Implications for Decentralized Optimization and Multi-Agent Control","year":"2014","author":"olshevsky","key":"ref34"},{"journal-title":"Communication-efficient distributed statistical inference","year":"2016","author":"jordan","key":"ref28"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2017.07.014"},{"journal-title":"Distributed statistical machine learning in adversarial settings Byzantine gradient descent","year":"2017","author":"chen","key":"ref29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2421897"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2418191"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.920143"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.924857"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2036046"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2504341"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysconle.2013.11.013"},{"key":"ref58","volume":"47","author":"nevelson","year":"1973","journal-title":"Stochastic approximation and recursive estimation"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0472-0"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499362111"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6594-6_11"},{"key":"ref54","first-page":"1","article-title":"Distributed subgradient methods over random networks","author":"lobel","year":"2008","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2275669"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2305952"},{"key":"ref10","first-page":"633","article-title":"Smooth boosting and learning with malicious noise","volume":"4","author":"servedio","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref11","volume":"1","author":"vapnik","year":"1998","journal-title":"Statistical Learning Theory"},{"key":"ref40","volume":"3","author":"kiwiel","year":"1985","journal-title":"Minimization Methods for Non-Differentiable Functions"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511973000"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2016.2594205"},{"article-title":"A survey on privacy in mobile crowd sensing task management","year":"2014","author":"pournajaf","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6871669"},{"key":"ref16","first-page":"5","article-title":"Direct search and stochastic optimization applied to two nonconvex nonsmooth problems","author":"easterling","year":"2012","journal-title":"Proc Symp High-Perform Comput Arch"},{"key":"ref17","first-page":"1145","article-title":"A quasi-Newton approach to nonsmooth convex optimization problems in machine learning","volume":"11","author":"jin","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICIF.2010.5711851"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2370216.2370288"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2359767"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218644"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2014.2320254"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150409"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2013.2261064"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2471695"},{"key":"ref9","first-page":"101","article-title":"Optimally-smooth adaptive boosting and application to agnostic learning","volume":"4","author":"gavinsky","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref46","first-page":"1125","article-title":"Finito: A faster, permutable incremental gradient method for big data problems","author":"defazio","year":"2014","journal-title":"Proc ICML"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TAC.2011.2167817","article-title":"On distributed convex optimization under inequality and equality constraints","volume":"57","author":"zhu","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"journal-title":"Achieving geometric convergence for distributed optimization over time-varying graphs","year":"2016","author":"nedich","key":"ref47"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref41","volume":"3","author":"golub","year":"2012","journal-title":"Matrix Computations"},{"journal-title":"Networkx Python Software for Complex Networks","year":"2015","key":"ref44"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/08073038X"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/8385578\/08337091.pdf?arnumber=8337091","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T03:49:49Z","timestamp":1643168989000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8337091\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":58,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2018.2814779","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}