{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:53:09Z","timestamp":1762509189458,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFE0107300"],"award-info":[{"award-number":["2022YFE0107300"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014103","name":"Key Research and Development Program of Shandong Province","doi-asserted-by":"publisher","award":["2023RKY01010"],"award-info":[{"award-number":["2023RKY01010"]}],"id":[{"id":"10.13039\/100014103","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3428370","type":"journal-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T18:23:17Z","timestamp":1721067797000},"page":"97374-97385","source":"Crossref","is-referenced-by-count":3,"title":["Rank Selection Method of CP Decomposition Based on Deep Deterministic Policy Gradient Algorithm"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-3307-7407","authenticated-orcid":false,"given":"Shaoshuang","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Shandong University of Technology, Zibo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8661-4216","authenticated-orcid":false,"given":"Zhao","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University of Technology, Zibo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9943-053X","authenticated-orcid":false,"given":"Wenlong","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University of Technology, Zibo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaqi","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University of Technology, Zibo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University of Technology, Zibo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2022.107819"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.231"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17795-9_10"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref5","article-title":"Very deep convolutional networks for large-scale image recognition","author":"Simonyan","year":"2014","journal-title":"arXiv:1409.1556"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.09.038"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1186\/s13677-021-00250-w"},{"issue":"1","key":"ref8","first-page":"68","article-title":"A review of deep learning model compression and acceleration","volume":"32","author":"Gao","year":"2021","journal-title":"Softw. J."},{"article-title":"Research on compression and acceleration techniques for deep convolutional network models","year":"2020","author":"Long","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3409073.3409094"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035776"},{"key":"ref12","first-page":"2148","article-title":"Predicting parameters in deep learning","volume-title":"Proc. 26th Int. Conf. Neural Inf. Process. Syst.","author":"Denil"},{"key":"ref13","first-page":"1269","article-title":"Exploiting linear structure within convolutional networks for efficient evaluation","volume-title":"Proc. Int. Conf. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Denton"},{"key":"ref14","article-title":"The SVD of convolutional weights: A CNN interpretability framework","author":"Praggastis","year":"2022","journal-title":"arXiv:2208.06894"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00637"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.02.035"},{"key":"ref17","first-page":"576","article-title":"Compression of deep convolutional neural networks for fast and low power mobile applications","volume-title":"Proc. Int. Conf. Comput. Vis.","author":"Kim"},{"key":"ref18","article-title":"Compressing CNN kernels for videos using tucker decompositions: Towards light-weight CNN applications","volume-title":"Proc. Northern Lights Deep Learn. Workshop","volume":"3","author":"Rasmussen"},{"key":"ref19","article-title":"Compressing recurrent neural networks using hierarchical tucker tensor decomposition","author":"Yin","year":"2020","journal-title":"arXiv:2005.04366"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/BIGCOMP.2017.7881725"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1049\/ipr2.12507"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2423694"},{"key":"ref25","first-page":"971","article-title":"Perfect dimensionality recovery by variational Bayesian PCA","volume-title":"Proc. 25th Int. Conf. Neural Inf. Process. Syst.","volume":"1","author":"Nakajima"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2018.03.017"},{"issue":"7930","key":"ref27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1038\/s41586-022-05172-4","article-title":"Discovering faster matrix multiplication algorithms with reinforcement learning","volume":"610","author":"Fawzi","year":"2022","journal-title":"Nature"},{"key":"ref28","article-title":"Reinforcement learning to solve NP-hard problems: An application to the CVRP","author":"Ardon","year":"2022","journal-title":"arXiv:2201.05393"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2017.8122622"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN55064.2022.9892416"},{"key":"ref31","article-title":"Deep reinforcement learning with pre-training for time-efficient training of automatic speech recognition","author":"Rajapakshe","year":"2020","journal-title":"arXiv:2005.11172"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.23919\/ELINFOCOM.2019.8706441"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262792"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132945"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.23919\/ICACT.2018.8323750"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2968357"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10597552.pdf?arnumber=10597552","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:41:00Z","timestamp":1721709660000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10597552\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3428370","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}