{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:33:45Z","timestamp":1768404825959,"version":"3.49.0"},"reference-count":11,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"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":[[2021,12]]},"DOI":"10.1109\/globecom46510.2021.9685347","type":"proceedings-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T21:59:04Z","timestamp":1643839144000},"page":"01-06","source":"Crossref","is-referenced-by-count":5,"title":["Dynamic Channel Access via Meta-Reinforcement Learning"],"prefix":"10.1109","author":[{"given":"Ziyang","family":"Lu","sequence":"first","affiliation":[{"name":"Syracuse University,Department of Electrical Engineering and Computer Science,Syracuse,NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Cenk","family":"Gursoy","sequence":"additional","affiliation":[{"name":"Syracuse University,Department of Electrical Engineering and Computer Science,Syracuse,NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2879433"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2019.2952909"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.29007\/3b2l"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.29007\/tkmv"},{"key":"ref11","article-title":"ProMP: Proximal meta-policy search","author":"rothfuss","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref5","article-title":"Model-agnostic meta-learning for fast adaptation of deep networks","author":"finn","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref8","first-page":"1082","article-title":"On the convergence theory of gradient-based model-agnostic meta-learning algorithms","author":"fallah","year":"0","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref7","author":"nichol","year":"0","journal-title":"Reptile a Scalable Metalearning Algorithm"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2018.2809722"},{"key":"ref9","article-title":"ES-MAML: Simple hessian-free meta learning","author":"song","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref1","article-title":"Playing atari with deep reinforcement learning","author":"mnih","year":"2013","journal-title":"ArXiv Preprint"}],"event":{"name":"GLOBECOM 2021 - 2021 IEEE Global Communications Conference","location":"Madrid, Spain","start":{"date-parts":[[2021,12,7]]},"end":{"date-parts":[[2021,12,11]]}},"container-title":["2021 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9685019\/9685006\/09685347.pdf?arnumber=9685347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T20:25:04Z","timestamp":1654547104000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9685347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/globecom46510.2021.9685347","relation":{},"subject":[],"published":{"date-parts":[[2021,12]]}}}