{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:35:34Z","timestamp":1772120134508,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["42371374"],"award-info":[{"award-number":["42371374"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s13042-025-02766-y","type":"journal-article","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T04:36:07Z","timestamp":1756528567000},"page":"9501-9514","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Low-rank optimization for efficient compression of CNN models"],"prefix":"10.1007","volume":"16","author":[{"given":"Hao","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaokang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,30]]},"reference":[{"issue":"3","key":"2766_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda TG, Bader BW (2009) Tensor decompositions and applications. SIAM Rev 51(3):455\u2013500","journal-title":"SIAM Rev"},{"key":"2766_CR2","doi-asserted-by":"publisher","first-page":"5113","DOI":"10.1007\/s10462-020-09816-7","volume":"53","author":"T Choudhary","year":"2020","unstructured":"Choudhary T, Mishra V, Goswami A, Sarangapani J (2020) A comprehensive survey on model compression and acceleration. Artif Intell Rev 53:5113\u20135155","journal-title":"Artif Intell Rev"},{"key":"2766_CR3","unstructured":"Han S, Pool J, Tran J, Dally W (2015) Learning both weights and connections for efficient neural network. In: Advances in neural information processing systems, vol 28"},{"issue":"12","key":"2766_CR4","doi-asserted-by":"publisher","first-page":"3048","DOI":"10.1109\/TPAMI.2018.2874634","volume":"41","author":"S Chen","year":"2018","unstructured":"Chen S, Zhao Q (2018) Shallowing deep networks: layer-wise pruning based on feature representations. IEEE Trans Pattern Anal Mach Intell 41(12):3048\u20133056","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2766_CR5","doi-asserted-by":"crossref","unstructured":"Gholami A, Kim S, Dong Z, Yao Z, Mahoney MW, Keutzer K (2022) A survey of quantization methods for efficient neural network inference. In: Low-power computer vision, pp 291\u2013326","DOI":"10.1201\/9781003162810-13"},{"key":"2766_CR6","doi-asserted-by":"crossref","unstructured":"Jacob B, Kligys S, Chen B, Zhu M, Tang M, Howard A, Adam H, Kalenichenko D (2018) Quantization and training of neural networks for efficient integer-arithmetic-only inference. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2704\u20132713","DOI":"10.1109\/CVPR.2018.00286"},{"key":"2766_CR7","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1631\/FITEE.1700789","volume":"19","author":"J Cheng","year":"2018","unstructured":"Cheng J, Wang P, Li G, Hu Q, Lu H (2018) Recent advances in efficient computation of deep convolutional neural networks. Front Inf Technol Electron Eng 19:64\u201377","journal-title":"Front Inf Technol Electron Eng"},{"key":"2766_CR8","doi-asserted-by":"crossref","unstructured":"Li Y, Liu J, Wang L (2018) Lightweight network research based on deep learning: a review. In: 2018 37th Chinese control conference (CCC). IEEE, pp 9021\u20139026","DOI":"10.23919\/ChiCC.2018.8483963"},{"key":"2766_CR9","doi-asserted-by":"crossref","unstructured":"Kim H, Khan MUK, Kyung C-M (2019) Efficient neural network compression. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 12569\u201312577","DOI":"10.1109\/CVPR.2019.01285"},{"key":"2766_CR10","doi-asserted-by":"crossref","unstructured":"Wen W, Xu C, Wu C, Wang Y, Chen Y, Li H (2017) Coordinating filters for faster deep neural networks. In: Proceedings of the IEEE international conference on computer vision, pp 658\u2013666","DOI":"10.1109\/ICCV.2017.78"},{"key":"2766_CR11","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s40747-021-00308-x","volume":"8","author":"N Li","year":"2022","unstructured":"Li N, Pan Y, Chen Y, Ding Z, Zhao D, Xu Z (2022) Heuristic rank selection with progressively searching tensor ring network. Complex Intell Syst 8:771\u2013785","journal-title":"Complex Intell Syst"},{"key":"2766_CR12","doi-asserted-by":"crossref","unstructured":"Gusak J, Kholiavchenko M, Ponomarev E, Markeeva L, Blagoveschensky P, Cichocki A, Oseledets I (2019) Automated multi-stage compression of neural networks. In: Proceedings of the IEEE\/CVF International Conference on Computer Vision Workshops, pp. 0\u20130","DOI":"10.1109\/ICCVW.2019.00306"},{"key":"2766_CR13","doi-asserted-by":"crossref","unstructured":"Yin M, Phan H, Zang X, Liao S, Yuan B (2022) BATUDE: budget-aware neural network compression based on tucker decomposition. In: Proceedings of the AAAI conference on artificial intelligence, vol 36, pp 8874\u20138882","DOI":"10.1609\/aaai.v36i8.20869"},{"issue":"2","key":"2766_CR14","doi-asserted-by":"publisher","first-page":"025010","DOI":"10.1088\/0266-5611\/27\/2\/025010","volume":"27","author":"S Gandy","year":"2011","unstructured":"Gandy S, Recht B, Yamada I (2011) Tensor completion and low-n-rank tensor recovery via convex optimization. Inverse Prob 27(2):025010","journal-title":"Inverse Prob"},{"key":"2766_CR15","unstructured":"Novikov A, Podoprikhin D, Osokin A, Vetrov DP (2015) Tensorizing neural networks. In: Advances in neural information processing systems, vol 28"},{"key":"2766_CR16","unstructured":"Garipov T, Podoprikhin D, Novikov A, Vetrov D (2016) Ultimate tensorization: compressing convolutional and FC layers alike. arXiv preprint arXiv:1611.03214"},{"key":"2766_CR17","doi-asserted-by":"crossref","unstructured":"Wang W, Sun Y, Eriksson B, Wang W, Aggarwal V (2018) Wide compression: tensor ring nets. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 9329\u20139338","DOI":"10.1109\/CVPR.2018.00972"},{"key":"2766_CR18","unstructured":"Yang Y, Krompass D, Tresp V (2017) Tensor-train recurrent neural networks for video classification. In: International conference on machine learning. PMLR, pp 3891\u20133900"},{"key":"2766_CR19","doi-asserted-by":"crossref","unstructured":"Pan Y, Xu J, Wang M, Ye J, Wang F, Bai K, Xu Z (2019) Compressing recurrent neural networks with tensor ring for action recognition. In: Proceedings of the AAAI conference on artificial intelligence, vol 33, pp 4683\u20134690","DOI":"10.1609\/aaai.v33i01.33014683"},{"key":"2766_CR20","doi-asserted-by":"crossref","unstructured":"Wen W, Xu C, Wu C, Wang Y, Chen Y, Li H (2017) Coordinating filters for faster deep neural networks. In: Proceedings of the IEEE international conference on computer vision, pp 658\u2013666","DOI":"10.1109\/ICCV.2017.78"},{"key":"2766_CR21","doi-asserted-by":"crossref","unstructured":"Xu Y, Li Y, Zhang S, Wen W, Wang B, Dai W, Qi Y, Chen Y, Lin W, Xiong H (2019) Trained rank pruning for efficient deep neural networks. In: 2019 fifth workshop on energy efficient machine learning and cognitive computing-NeurIPS edition (EMC2-NIPS). IEEE, pp 14\u201317","DOI":"10.1109\/EMC2-NIPS53020.2019.00011"},{"key":"2766_CR22","doi-asserted-by":"crossref","unstructured":"Idelbayev Y, Carreira-Perpin\u00e1n MA (2020) Low-rank compression of neural nets: learning the rank of each layer. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 8049\u20138059","DOI":"10.1109\/CVPR42600.2020.00807"},{"key":"2766_CR23","unstructured":"Roy O, Vetterli M (2007) The effective rank: a measure of effective dimensionality. In: 2007 15th European Signal Processing Conference. IEEE, pp 606\u2013610"},{"key":"2766_CR24","unstructured":"Golub GH, Van\u00a0Loan CF (2013) Matrix computations, 4th ed. JHU Press. Ch. 2, Sec. 2.5, pp 108\u2013130"},{"key":"2766_CR25","unstructured":"Gao X, Zhao Y, Dudziak \u0141, Mullins R, Xu C-z (2018) Dynamic channel pruning: feature boosting and suppression. arXiv preprint arXiv:1810.05331"},{"key":"2766_CR26","unstructured":"Nair V, Hinton GE (2010) Rectified linear units improve restricted Boltzmann machines. In: Proceedings of the 27th international conference on machine learning (ICML-10), pp 807\u2013814"},{"key":"2766_CR27","doi-asserted-by":"crossref","unstructured":"Han J, Moraga C (1995) The influence of the sigmoid function parameters on the speed of backpropagation learning. In: International workshop on artificial neural networks. Springer, Berlin, pp 195\u2013201","DOI":"10.1007\/3-540-59497-3_175"},{"key":"2766_CR28","unstructured":"Chu B-S, Lee C-R (2021) Low-rank tensor decomposition for compression of convolutional neural networks using funnel regularization. arXiv preprint arXiv:2112.03690"},{"key":"2766_CR29","doi-asserted-by":"crossref","unstructured":"Kim Y-D, Park E, Yoo S, Choi T, Yang L, Shin D (2015) Compression of deep convolutional neural networks for fast and low power mobile applications. arXiv preprint arXiv:1511.06530","DOI":"10.14257\/astl.2016.140.36"},{"key":"2766_CR30","unstructured":"Li H, Kadav A, Durdanovic I, Samet H, Graf HP (2016) Pruning filters for efficient convnets. In: International conference on learning representations (ICLR), pp 24\u201326"},{"key":"2766_CR31","doi-asserted-by":"crossref","unstructured":"Lin M, Ji R, Wang Y, Zhang Y, Zhang B, Tian Y, Shao L (2020) Hrank: filter pruning using high-rank feature map. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 1529\u20131538","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"2766_CR32","doi-asserted-by":"publisher","first-page":"127257","DOI":"10.1016\/j.neucom.2024.127257","volume":"573","author":"SS Basha","year":"2024","unstructured":"Basha SS, Farazuddin M, Pulabaigari V, Dubey SR, Mukherjee S (2024) Deep model compression based on the training history. Neurocomputing 573:127257","journal-title":"Neurocomputing"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02766-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02766-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02766-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T11:23:31Z","timestamp":1762514611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02766-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":32,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["2766"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02766-y","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-5388638\/v1","asserted-by":"object"}]},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,30]]},"assertion":[{"value":"4 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}