{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:46:23Z","timestamp":1774629983162,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,5,20]]},"DOI":"10.1109\/infocom52122.2024.10621325","type":"proceedings-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T17:25:41Z","timestamp":1723483541000},"page":"1989-1998","source":"Crossref","is-referenced-by-count":10,"title":["Optimization of Offloading Policies for Accuracy-Delay Tradeoffs in Hierarchical Inference"],"prefix":"10.1109","author":[{"given":"Hasan Burhan","family":"Beytur","sequence":"first","affiliation":[{"name":"The University of Texas at Austin,Electrical and Computer Engineering Department"}]},{"given":"Ahmet Gunhan","family":"Aydin","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin,Electrical and Computer Engineering Department"}]},{"given":"Gustavo","family":"de Veciana","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin,Electrical and Computer Engineering Department"}]},{"given":"Haris","family":"Vikalo","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin,Electrical and Computer Engineering Department"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1877","article-title":"Language models are few-shot learners","volume":"33","author":"Brown","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref2","article-title":"On efficient training of large-scale deep learning models: A literature review","author":"Shen","year":"2023"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126327"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2021.11.019"},{"key":"ref5","article-title":"Online algorithms for hierarchical inference in deep learning applications at the edge","author":"Moothedath","year":"2023"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.3034992"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3453142.3492329"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3551659.3559044"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3037697.3037698"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737614"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2016.7900006"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-79995-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2016.2611964"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485977"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3038875"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/VTC2020-Spring48590.2020.9128780"},{"key":"ref18","article-title":"POND: Pessimistic-optimistic online dispatching","author":"Liu","year":"2021"},{"key":"ref19","first-page":"24 075","article-title":"An efficient pessimistic-optimistic algorithm for stochastic linear bandits with general constraint","volume-title":"Advances in Neural Information Processing Systems","volume":"34","author":"Liu","year":"2021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20285"},{"key":"ref21","first-page":"13 750","article-title":"Group-fair online allocation in continuous time","volume":"33","author":"Cayci","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2600057.2602844"},{"key":"ref24","article-title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","author":"Xiao","year":"2017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref26","article-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref27","article-title":"Online exp3 learning in adversarial bandits with delayed feedback","volume":"32","author":"Bistritz","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2307\/1426671"}],"event":{"name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","location":"Vancouver, BC, Canada","start":{"date-parts":[[2024,5,20]]},"end":{"date-parts":[[2024,5,23]]}},"container-title":["IEEE INFOCOM 2024 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10621050\/10621073\/10621325.pdf?arnumber=10621325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T05:42:23Z","timestamp":1723527743000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10621325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/infocom52122.2024.10621325","relation":{},"subject":[],"published":{"date-parts":[[2024,5,20]]}}}