{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:05:32Z","timestamp":1725807932197},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"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":[[2023,6,4]]},"DOI":"10.1109\/icassp49357.2023.10094925","type":"proceedings-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:28:30Z","timestamp":1683307710000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Learning To Regularized Resource Allocation with Budget Constraints"],"prefix":"10.1109","author":[{"given":"Shaoke","family":"Fang","sequence":"first","affiliation":[{"name":"Peking University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingsong","family":"Liu","sequence":"additional","affiliation":[{"name":"Tsinghua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenfei","family":"Wu","sequence":"additional","affiliation":[{"name":"Peking University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Adaptive algorithms for online convex optimization with long-term constraints","author":"jenatton","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref12","article-title":"The best of many worlds: Dual mirror descent for online allocation problems","author":"balseiro","year":"2022","journal-title":"Operations Research"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2750109"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/02670844.2017.1418712"},{"key":"ref11","first-page":"613","article-title":"Dual mirror descent for online allocation problems","author":"balseiro","year":"2020","journal-title":"International Conference on Machine Learning"},{"key":"ref10","article-title":"Online linear programming: Dual convergence, new algorithms, and regret bounds","author":"li","year":"2021","journal-title":"Operations Research"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2022.3185266"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3529113.3529114"},{"key":"ref19","article-title":"Combinatorial bandits with linear constraints: Beyond knapsacks and fairness","author":"liu","year":"2022","journal-title":"Advances in neural information processing systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20285"},{"key":"ref24","first-page":"630","article-title":"Regularized online allocation problems: Fairness and beyond","author":"balseiro","year":"2021","journal-title":"International Conference on Machine Learning"},{"article-title":"Fairer lpbased online allocation via analytic center","year":"2021","author":"chen","key":"ref23"},{"year":"0","key":"ref26","article-title":"Online report"},{"article-title":"Optimal regularized online convex allocation by adaptive resolving","year":"2022","author":"ma","key":"ref25"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.23919\/ACC53348.2022.9867328"},{"key":"ref22","first-page":"1760","article-title":"Combinatorial semi-bandits with knapsacks","author":"sankararaman","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1840"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2018.0028"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2014.2017"},{"key":"ref8","first-page":"1405","article-title":"Fast algorithms for online stochastic convex programming","author":"agrawal","year":"2014","journal-title":"Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref7","article-title":"No-regret caching for partialobservation regime","author":"jia","year":"2023","journal-title":"IEEE INFOCOM 2023-IEEE Conference on Computer Communications"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3284177"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228900"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.23919\/WiOpt56218.2022.9930570"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM46510.2021.9685551"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228901"}],"event":{"name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2023,6,4]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2023,6,10]]}},"container-title":["ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10094559\/10094560\/10094925.pdf?arnumber=10094925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T18:58:26Z","timestamp":1700506706000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10094925\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,4]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icassp49357.2023.10094925","relation":{},"subject":[],"published":{"date-parts":[[2023,6,4]]}}}