{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:37:18Z","timestamp":1730230638967,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1109\/icassp.2018.8461641","type":"proceedings-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T18:24:48Z","timestamp":1537554288000},"page":"6418-6422","source":"Crossref","is-referenced-by-count":5,"title":["Harnessing Bandit Online Learning to Low-Latency Fog Computing"],"prefix":"10.1109","author":[{"given":"Tianyi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios B.","family":"Giannakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Online convex programming and generalized infinitesimal gradient ascent","author":"zinkevich","year":"2003","journal-title":"Proc 7th Int Conf Machine Learning"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref12","article-title":"Online learning for “thing-adaptive” fog computing in IoT","author":"chen","year":"2017","journal-title":"Proc of ASILOMAR"},{"journal-title":"Online convex optimization with time-varying constraints","year":"2017","author":"j neely","key":"ref13"},{"key":"ref14","first-page":"28","article-title":"Optimal algorithms for online convex optimization with multi-point bandit feedback","author":"agarwal","year":"2010","journal-title":"Proc Ann Conf Learning Theory"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"2788","DOI":"10.1109\/TIT.2015.2409256","article-title":"Optimal rates for zero-order convex optimization: The power of two function evaluations","volume":"61","author":"john","year":"2015","journal-title":"IEEE Trans Inform Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7996574"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4208\/jcm.1608-m2016-0561"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"ref19","first-page":"1","article-title":"An optimal algorithm for bandit and zero-order convex optimization with two-point feedback","volume":"18","author":"shamir","year":"2017","journal-title":"Journal of Machine Learning Research"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/WF-IoT.2016.7845499"},{"journal-title":"Nonlinear Programming","year":"1999","author":"dimitri","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2334709"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2682318"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2015.2448520"},{"key":"ref8","first-page":"1397","volume":"16","author":"sheng you","year":"2017","journal-title":"Energy-efficient resource allocation for mobile-edge computation offloading"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2785305"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2016.2584538"},{"journal-title":"Mobile edge computing Survey and research outlook","year":"2017","author":"mao","key":"ref9"},{"key":"ref1","first-page":"1","article-title":"Distributed QoS management for Internet of Things under resource constraints","author":"samie","year":"2016","journal-title":"Proc Int l Conf Hardware\/Software Codesign and System Synthesis"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref22","article-title":"Online optimization: Competing with dynamic comparators","author":"jadbabaie","year":"2015","journal-title":"Int Conf on Artificial Intelligence and Statistics"},{"journal-title":"Bandit convex optimization for scalable and dynamic iot management","year":"2017","author":"chen","key":"ref21"},{"key":"ref24","first-page":"2503","article-title":"Trading regret for efficiency: Online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref26","first-page":"385","article-title":"Online convex optimization in the bandit setting: gradient descent without a gradient","author":"abraham","year":"2005","journal-title":"Proc ACM SODA"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"}],"event":{"name":"ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2018,4,15]]},"location":"Calgary, AB","end":{"date-parts":[[2018,4,20]]}},"container-title":["2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8450881\/8461260\/08461641.pdf?arnumber=8461641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:14:12Z","timestamp":1598228052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8461641\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/icassp.2018.8461641","relation":{},"subject":[],"published":{"date-parts":[[2018,4]]}}}