{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T14:26:56Z","timestamp":1772720816161,"version":"3.50.1"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001742","name":"United States-Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2017723"],"award-info":[{"award-number":["2017723"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Cyber Security Research Center at Ben-Gurion University of the Negev","award":["076\/16"],"award-info":[{"award-number":["076\/16"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/jstsp.2020.2967566","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:19:41Z","timestamp":1579295981000},"page":"789-801","source":"Crossref","is-referenced-by-count":32,"title":["PoPS: Policy Pruning and Shrinking for Deep Reinforcement Learning"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8632-7535","authenticated-orcid":false,"given":"Dor","family":"Livne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0532-009X","authenticated-orcid":false,"given":"Kobi","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","author":"mnih","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992698"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150464"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2018.8297274"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3060403.3060465"},{"key":"ref30","first-page":"1","article-title":"Incremental network quantization: Towards lossless CNNs with low-precision weights","author":"zhou","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref37","article-title":"Distilling the knowledge in a neural network","author":"hinton","year":"2015"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00932"},{"key":"ref35","article-title":"Policy distillation","author":"rusu","year":"2015"},{"key":"ref34","first-page":"2654","article-title":"Do deep nets really need to be deep?","author":"ba","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref10","first-page":"1","article-title":"To prune, or not to prune: Exploring the efficacy of pruning for model compression","author":"zhu","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref40","article-title":"Dueling network architectures for deep reinforcement learning","author":"wang","year":"2015"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2017.7966160"},{"key":"ref12","first-page":"2137","article-title":"Learning to communicate with deep multi-agent reinforcement learning","author":"foerster","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","first-page":"2094","article-title":"Deep reinforcement learning with double Q-learning","author":"hasselt","year":"0","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006677"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103589"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635928"},{"key":"ref17","article-title":"Deep reinforcement learning radio control and signal detection with KerLym, a gym RL agent","author":"o\u2019shea","year":"2016"},{"key":"ref18","article-title":"Proactive resource management in LTE-U systems: A deep learning perspective","author":"challita","year":"2017"},{"key":"ref19","first-page":"1","article-title":"Deep reinforcement learning for dynamic multichannel access","author":"wang","year":"0","journal-title":"Proc Int Conf Comput Netw Commun"},{"key":"ref28","first-page":"1","article-title":"Layer-compensated pruning for resource-constrained convolutional neural networks","author":"chin","year":"0","journal-title":"Proc 2nd Workshop Mach Learn Phone Consum Devices Conf Neural Inf Process Syst"},{"key":"ref4","first-page":"1135","article-title":"Learning both weights and connections for efficient neural network","author":"han","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.155"},{"key":"ref3","article-title":"Deep reinforcement learning: An overview","author":"li","year":"2017"},{"key":"ref6","first-page":"1","article-title":"N2N learning: Network to network compression via policy gradient reinforcement learning","author":"ashok","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref29","article-title":"LEGR: Filter pruning via learned global ranking","author":"chin","year":"2019"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3007787.3001163"},{"key":"ref8","article-title":"An open source software for policy pruning and shrinking framework","author":"livne","year":"2019"},{"key":"ref7","first-page":"784","article-title":"AMC: AutoML for model compression and acceleration on mobile devices","author":"he","year":"0","journal-title":"Proc Eur Conf Comput Vision"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","article-title":"Human-level control through deep reinforcement learning","volume":"518","author":"mnih","year":"2015","journal-title":"Nature"},{"key":"ref1","article-title":"Playing Atari with deep reinforcement learning","author":"mnih","year":"2013"},{"key":"ref9","article-title":"OpenAI gym","author":"brockman","year":"2016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2018.2809722"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2879433"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254101"},{"key":"ref24","first-page":"2148","article-title":"Predicting parameters in deep learning","author":"denil","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2019.2904897"},{"key":"ref26","article-title":"Network trimming: A data-driven neuron pruning approach towards efficient deep architectures","author":"hu","year":"2016"},{"key":"ref25","first-page":"1","article-title":"Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding","author":"han","year":"0","journal-title":"Proc Int Conf Learn Representations"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/9163420\/08962235.pdf?arnumber=8962235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:08:25Z","timestamp":1651079305000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8962235\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":40,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2020.2967566","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5]]}}}