{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:33:16Z","timestamp":1730230396836,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9053771","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T20:21:13Z","timestamp":1586463673000},"page":"3957-3961","source":"Crossref","is-referenced-by-count":2,"title":["Projection Free Dynamic Online Learning"],"prefix":"10.1109","author":[{"given":"Deepak S.","family":"Kalhan","sequence":"first","affiliation":[]},{"given":"Amrit S.","family":"Bedi","sequence":"additional","affiliation":[]},{"given":"Alec","family":"Koppel","sequence":"additional","affiliation":[]},{"given":"Ketan","family":"Rajawat","sequence":"additional","affiliation":[]},{"given":"Abhishek","family":"Gupta","sequence":"additional","affiliation":[]},{"given":"Adrish","family":"Banerjee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW.2012.6238919"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2568161"},{"key":"ref32","first-page":"789","article-title":"Stability bounds for stationary ?mixing and ?-mixing processes","volume":"11","author":"mohri","year":"2010","journal-title":"Journal of Machine Learning Research"},{"key":"ref31","volume":"48","author":"borkar","year":"2009","journal-title":"Stochastic Approximation A Dynamical Systems Viewpoint"},{"article-title":"Prioritized experience replay","year":"2015","author":"schaul","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619572"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/WCL.2012.072012.120428"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8461449"},{"key":"ref34","article-title":"A class of parallel doubly stochastic algorithms for large-scale learning","author":"mokhtari","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref10","first-page":"1843","article-title":"Projection-free online learning","author":"hazan","year":"2012","journal-title":"Proceedings of the 29th International Coference on International Conference on Machine Learning"},{"article-title":"Stochastic conditional gradient methods: From convex minimization to submodular maximization","year":"2018","author":"mokhtari","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2743462"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref14","first-page":"928","article-title":"Online convex programming and generalized infinitesimal gradient ascent","volume":"20","author":"zinkevich","year":"2003","journal-title":"Proc 20th Int conf on Machine Learning"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref16","first-page":"1699","article-title":"Online alternating direction method","author":"wang","year":"2012","journal-title":"Proceedings of the 29th International Conference on Machine Learning"},{"key":"ref17","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":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref28","volume":"1","author":"sutton","year":"1998","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref4","first-page":"645","article-title":"Second-order kernel online convex optimization with adaptive sketching","volume":"70","author":"calandriello","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning"},{"key":"ref27","first-page":"1886","article-title":"Conditional gradient method for stochastic submodular maximization: Closing the gap","author":"mokhtari","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"article-title":"Continuous control with deep reinforcement learning","year":"2015","author":"lillicrap","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143846"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4gdk"},{"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":"The Journal of Machine Learning Research"},{"key":"ref8","volume":"1","author":"friedman","year":"2001","journal-title":"The Elements of Statistical Learning"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2019.XV.033"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref9","article-title":"Lectures on Stochastic Programming: Modeling and Theory","volume":"16","author":"shapiro","year":"2014","journal-title":"SIAM"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2205597"},{"key":"ref20","first-page":"1263","article-title":"Variance-reduced and projection-free stochastic optimization","volume":"16","author":"hazan","year":"2016","journal-title":"Proceesing of ICML"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1408"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2404790"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799379"},{"key":"ref23","first-page":"398","article-title":"Online optimization: Competing with dynamic comparators","author":"jadbabaie","year":"2015","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref26","first-page":"814","article-title":"Projection-free online optimization with stochastic gradient: From convexity to submodularity","volume":"80","author":"chen","year":"0","journal-title":"Proceedings of 35th International Conference on Machine Learning"},{"article-title":"Nonstationary nonparametric online learning: Balancing dynamic regret and model parsimony","year":"2019","author":"bedi","key":"ref25"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2020,5,4]]},"location":"Barcelona, Spain","end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09053771.pdf?arnumber=9053771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:28:04Z","timestamp":1656376084000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9053771\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9053771","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}