{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T21:05:57Z","timestamp":1758056757069,"version":"3.44.0"},"reference-count":4,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"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":[[2025,5,19]]},"DOI":"10.1109\/infocomwkshps65812.2025.11152781","type":"proceedings-article","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T17:28:22Z","timestamp":1757698102000},"page":"1-2","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Freshness of Machine Learning Model: A Timing (Multi-Armed) Bandit Approach"],"prefix":"10.1109","author":[{"given":"Qiulin","family":"Lin","sequence":"first","affiliation":[{"name":"City University of Hong Kong,Department of Data Science,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liyuan","family":"Wang","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Data Science,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyan","family":"Su","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Data Science,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghua","family":"Chen","sequence":"additional","affiliation":[{"name":"City University of Hong Kong,Department of Data Science,Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.05.084"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111610"},{"key":"ref3","article-title":"Optimizing freshness of machine learning model: A timing (multi-armed) bandit approach","volume-title":"Technical Report","author":"Lin","year":"2025"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467053"}],"event":{"name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","location":"London, United Kingdom","start":{"date-parts":[[2025,5,19]]},"end":{"date-parts":[[2025,5,19]]}},"container-title":["IEEE INFOCOM 2025 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11152714\/11152715\/11152781.pdf?arnumber=11152781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:35:57Z","timestamp":1757957757000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11152781\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":4,"URL":"https:\/\/doi.org\/10.1109\/infocomwkshps65812.2025.11152781","relation":{},"subject":[],"published":{"date-parts":[[2025,5,19]]}}}