{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:41:00Z","timestamp":1725586860676},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"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,7]]},"DOI":"10.1109\/infocom41043.2020.9155466","type":"proceedings-article","created":{"date-parts":[[2020,8,4]],"date-time":"2020-08-04T22:29:35Z","timestamp":1596580175000},"page":"149-158","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Mixture Importance Sampling Via Online Learning: Algorithms and Applications"],"prefix":"10.1109","author":[{"given":"Tingwei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2014","author":"zhang","article-title":"Six months of Abilene traffic matrices","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/2486001.2486019"},{"year":"2013","author":"bucklew","journal-title":"Introduction to Rare Event Simulation","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1002\/9780470745403"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/1390156.1390199"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/1146909.1146930"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1111\/j.1467-9469.2011.00756.x"},{"key":"ref17","article-title":"Optimal mixture weights in multiple importance sampling","author":"he","year":"2014","journal-title":"arXiv preprint arXiv 1411 3954"},{"year":"2014","author":"papamakarios","article-title":"Comparison of modern stochastic optimization algorithms","key":"ref18"},{"key":"ref19","article-title":"Introductory lectures on convex programming volume i: Basic course","author":"nesterov","year":"1998","journal-title":"Lecture notes"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/WSC.2016.7822352"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1287\/mnsc.35.11.1367"},{"key":"ref6","first-page":"2225","article-title":"Fast rates for bandit optimization with upperconfidence frank-wolfe","author":"berthet","year":"2017","journal-title":"Advances in neural information processing systems"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/INFOCOM.2019.8737445"},{"year":"0","article-title":"Abilene","key":"ref8"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1002\/nav.3800030109"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.4108\/icst.valuetools.2011.245597"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1016\/j.ress.2016.09.009"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/2492101.1555377"},{"key":"ref20","article-title":"The convex optimization approach to regret minimization","author":"hazan","year":"2012","journal-title":"Optimization for Machine Learning"},{"key":"ref22","first-page":"4","article-title":"An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives","author":"agrawal","year":"2016","journal-title":"Conference on Learning Theory"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1561\/2200000018"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1145\/2600057.2602844"},{"year":"2011","author":"rakhlin","article-title":"Online learning: Beyond regret","key":"ref23"}],"event":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications","start":{"date-parts":[[2020,7,6]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2020,7,9]]}},"container-title":["IEEE INFOCOM 2020 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9146503\/9155217\/09155466.pdf?arnumber=9155466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T21:57:15Z","timestamp":1656453435000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9155466\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/infocom41043.2020.9155466","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}