乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T03:11:02Z","timestamp":1726024262373},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["SRG\/2019\/001459"],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tsp.2021.3051871","type":"journal-article","created":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T20:25:54Z","timestamp":1610742354000},"page":"932-947","source":"Crossref","is-referenced-by-count":12,"title":["Dynamic Online Learning via Frank-Wolfe Algorithm"],"prefix":"10.1109","volume":"69","author":[{"given":"Deepak S.","family":"Kalhan","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8807-2695","authenticated-orcid":false,"given":"Amrit","family":"Singh Bedi","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2447-2873","authenticated-orcid":false,"given":"Alec","family":"Koppel","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4508-0062","authenticated-orcid":false,"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9448-8750","authenticated-orcid":false,"given":"Hamed","family":"Hassani","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-4282-7407","authenticated-orcid":false,"given":"Abhishek K.","family":"Gupta","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6646-8464","authenticated-orcid":false,"given":"Adrish","family":"Banerjee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/15M101628X"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0778-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/15M104726X"},{"key":"ref32","first-page":"1886","article-title":"Conditional gradient method for stochastic submodular maximization: Closing the gap","author":"mokhtari","year":"0","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2201372"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref37","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"0","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852377"},{"key":"ref35","article-title":"On the online Frank-Wolfe algorithms for convex and non-convex optimizations","author":"lafond","year":"0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2966273"},{"key":"ref28","first-page":"2503","article-title":"Trading regret for efficiency: online convex optimization with long term constraints","volume":"13","author":"mahdavi","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref27","first-page":"1699","article-title":"Online alternating direction method","author":"wang","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2205597"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053771"},{"key":"ref20","first-page":"1","article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","volume":"21","author":"mokhtari","year":"2020"},{"key":"ref22","first-page":"1843","article-title":"Projection-free online learning","author":"hazan","year":"0","journal-title":"Proc 29th Int Conf Int Conf Mach Learn ser ICML’12"},{"key":"ref21","first-page":"14246","article-title":"Stochastic Frank-Wolfe for composite convex minimization","author":"locatello","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"814","article-title":"Projection-free online optimization with stochastic gradient: From convexity to submodularity","author":"chen","year":"0","journal-title":"Proc 35th Int Conf Mach Learn"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/140985366"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6116"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-411597-2.00006-0"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104993"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2890368"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2012.6238919"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2695450"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539849"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/SPCOM.2018.8724422"},{"key":"ref54","article-title":"Active target localization using low-rank matrix completion and unimodal regression","author":"choudhary","year":"0"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1561\/2200000018"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347761"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvcm4gdk","article-title":"Feedback Systems: An Introduction for Scientists and Engineers","author":"astr\u00f6m","year":"2010"},{"key":"ref11","article-title":"Prioritized experience replay","author":"schaul","year":"2015"},{"key":"ref40","first-page":"1263","article-title":"Variance-reduced and projection-free stochastic optimization","volume":"16","author":"hazan","year":"0","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref14","first-page":"449","article-title":"Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient","author":"yang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","first-page":"732","article-title":"Improved dynamic regret for non-degenerate functions","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","first-page":"1323","article-title":"Adaptive online learning in dynamic environments","author":"zhang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref17","first-page":"398","article-title":"Online optimization: Competing with dynamic comparators","author":"jadbabaie","year":"0","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref18","article-title":"Unconstrained online optimization: Dynamic regret analysis of strongly convex and smooth problems","author":"chang","year":"2020"},{"key":"ref19","first-page":"789","article-title":"Stability bounds for stationary $\\varphi$-mixing and $\\beta$-mixing processes","volume":"11","author":"mohri","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref4","article-title":"Continuous control with deep reinforcement learning","author":"lillicrap","year":"2016"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143846"},{"key":"ref5","first-page":"83","article-title":"Parsimonious online learning with kernels via sparse projections in function space","volume":"20","author":"koppel","year":"2019","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.033"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511754678"},{"key":"ref9","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume":"20","author":"zinkevich","year":"0","journal-title":"Proc 20th Int Conf Mach Learn"},{"key":"ref46","first-page":"1","article-title":"A class of parallel doubly stochastic algorithms for large-scale learning","volume":"21","author":"mokhtari","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref45","volume":"1","author":"friedman","year":"2001","journal-title":"The Elements of Statistical Learning"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619572"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/WCL.2012.072012.120428"},{"key":"ref42","first-page":"4054","article-title":"Projection-free distributed online learning in networks","author":"zhang","year":"0","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/140992382"},{"key":"ref44","article-title":"The complexity of large-scale convex programming under a linear optimization oracle","author":"lan","year":"2013"},{"key":"ref43","article-title":"Inexact and stochastic generalized conditional gradient with augmented Lagrangian and proximal step","author":"silveti-falls","year":"2020"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/9307529\/09325943.pdf?arnumber=9325943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:50:39Z","timestamp":1652194239000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9325943\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":60,"URL":"https:\/\/doi.org\/10.1109\/tsp.2021.3051871","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}