{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T14:05:23Z","timestamp":1774533923944,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020AAA0106300"],"award-info":[{"award-number":["2020AAA0106300"]}],"id":[{"id":"10.13039\/501100012166","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":[[2024,2]]},"DOI":"10.1007\/s13042-023-01935-1","type":"journal-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T09:01:35Z","timestamp":1691139695000},"page":"697-718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Adaptive weighting function for weighted nuclear norm based matrix\/tensor completion"],"prefix":"10.1007","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9956-0064","authenticated-orcid":false,"given":"Qian","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuji","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengxingyu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deyu","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"1935_CR1","unstructured":"Krizhevsky A (2009) Learning multiple layers of features from tiny images. Technical report"},{"key":"1935_CR2","unstructured":"Xiao T, Xia T, Yang Y, Huang C, Wang X (2015) Learning from massive noisy labeled data for image classification. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2691\u20132699"},{"issue":"9","key":"1935_CR3","doi-asserted-by":"crossref","first-page":"1627","DOI":"10.1109\/TPAMI.2009.167","volume":"32","author":"PF Felzenszwalb","year":"2010","unstructured":"Felzenszwalb PF, Girshick RB, McAllester D, Ramanan D (2010) Object detection with discriminatively trained part-based models. IEEE Trans Pattern Anal Mach Intell 32(9):1627\u20131645","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1935_CR4","doi-asserted-by":"crossref","unstructured":"He K, Zhang X, Ren S, Sun J (2016) Deep residual learning for image recognition. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 770\u2013778","DOI":"10.1109\/CVPR.2016.90"},{"key":"1935_CR5","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s EJ, Recht B (2009) Exact matrix completion via convex optimization. Found Comput Math 9:717\u2013772","journal-title":"Found Comput Math"},{"key":"1935_CR6","doi-asserted-by":"crossref","unstructured":"Nie F, Huang H, Ding C (2012) Low-rank matrix recovery via efficient Schatten p-norm minimization. In: Proceedings of the 26th AAAI conference on artificial intelligence, pp 655\u2013661","DOI":"10.1609\/aaai.v26i1.8210"},{"issue":"11","key":"1935_CR7","doi-asserted-by":"crossref","first-page":"5714","DOI":"10.1109\/TSP.2012.2212015","volume":"60","author":"G Marjanovic","year":"2012","unstructured":"Marjanovic G, Solo V (2012) On $$l_q$$ optimization and matrix completion. IEEE Trans Signal Process 60(11):5714\u20135724","journal-title":"IEEE Trans Signal Process"},{"key":"1935_CR8","unstructured":"Zhang D, Hu Y, Ye J, Li X, He X (2012) Matrix completion by truncated nuclear norm regularization. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2192\u20132199"},{"issue":"9","key":"1935_CR9","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TPAMI.2012.271","volume":"35","author":"Y Hu","year":"2013","unstructured":"Hu Y, Zhang D, Ye J, Li X, He X (2013) Fast and accurate matrix completion via truncated nuclear norm regularization. IEEE Trans Pattern Anal Mach Intell 35(9):2117\u20132130","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1935_CR10","doi-asserted-by":"crossref","unstructured":"Liu D, Zhou T, Qian H, Xu C, Zhang Z (2013) A nearly unbiased matrix completion approach. In: Proceedings of joint European conference on machine learning and knowledge discovery in databases, pp 210\u2013225","DOI":"10.1007\/978-3-642-40991-2_14"},{"key":"1935_CR11","unstructured":"Gui H, Han J, Gu Q (2016) Towards faster rates and oracle property for low-rank matrix estimation. In: Proceedings of the 33rd international conference on machine learning, pp 2300\u20132309"},{"key":"1935_CR12","unstructured":"Fazel SM (2002) Matrix rank minimization with applications. PhD thesis, Stanford University"},{"key":"1935_CR13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s11263-016-0930-5","volume":"121","author":"S Gu","year":"2017","unstructured":"Gu S, Xie Q, Meng D, Zuo W, Feng X, Zhang L (2017) Weighted nuclear norm minimization and its applications to low level vision. Int J Comput Vis 121:183\u2013208","journal-title":"Int J Comput Vis"},{"key":"1935_CR14","unstructured":"Liu J, Musialski P, Wonka P, Ye J (2009) Tensor completion for estimating missing values in visual data. In: Proceedings of the 12th IEEE international conference on computer vision, pp 2114\u20132121"},{"issue":"1","key":"1935_CR15","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1109\/TPAMI.2012.39","volume":"35","author":"J Liu","year":"2013","unstructured":"Liu J, Musialski P, Wonka P, Ye J (2013) Tensor completion for estimating missing values in visual data. IEEE Trans Pattern Anal Mach Intell 35(1):208\u2013220","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1935_CR16","unstructured":"Nati NS, Jaakkola T (2003) Weighted low-rank approximations. In: Proceedings of the 20th international conference on machine learning, pp 720\u2013727"},{"key":"1935_CR17","first-page":"1257","volume":"20","author":"A Mnih","year":"2007","unstructured":"Mnih A, Salakhutdinov RR (2007) Probabilistic matrix factorization. Adv Neural Inf Process Syst 20:1257\u20131264","journal-title":"Adv Neural Inf Process Syst"},{"key":"1935_CR18","unstructured":"Buchanan AM, Fitzgibbon AW (2005) Damped newton algorithms for matrix factorization with missing data. In: Proceedings of the IEEE conference on computer vision and pattern recognition, vol 2, pp 316\u2013322"},{"issue":"3","key":"1935_CR19","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s11263-006-9785-5","volume":"72","author":"T Okatani","year":"2007","unstructured":"Okatani T, Deguchi K (2007) On the Wiberg algorithm for matrix factorization in the presence of missing components. Int J Comput Vis 72(3):329\u2013337","journal-title":"Int J Comput Vis"},{"issue":"4","key":"1935_CR20","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai J-F, Cand\u00e8s EJ, Shen Z (2010) A singular value thresholding algorithm for matrix completion. SIAM J Optim 20(4):1956\u20131982","journal-title":"SIAM J Optim"},{"issue":"6","key":"1935_CR21","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"EJ Candes","year":"2010","unstructured":"Candes EJ, Plan Y (2010) Matrix completion with noise. Proc IEEE 98(6):925\u2013936","journal-title":"Proc IEEE"},{"key":"1935_CR22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma S, Goldfarb D, Chen L (2011) Fixed point and Bregman iterative methods for matrix rank minimization. Math Program 128:321\u2013353","journal-title":"Math Program"},{"issue":"80","key":"1935_CR23","first-page":"2287","volume":"11","author":"R Mazumder","year":"2010","unstructured":"Mazumder R, Hastie T, Tibshirani R (2010) Spectral regularization algorithms for learning large incomplete matrices. J Mach Learn Res 11(80):2287\u20132322","journal-title":"J Mach Learn Res"},{"issue":"3","key":"1935_CR24","first-page":"615","volume":"6","author":"K-C Toh","year":"2010","unstructured":"Toh K-C, Yun S (2010) An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac J Optim 6(3):615\u2013640","journal-title":"Pac J Optim"},{"key":"1935_CR25","unstructured":"Lin Z, Chen M, Ma Y (2010) The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. CoRR arXiv:1009.5055"},{"key":"1935_CR26","first-page":"612","volume":"24","author":"Z Lin","year":"2011","unstructured":"Lin Z, Liu R, Su Z (2011) Linearized alternating direction method with adaptive penalty for low-rank representation. Adv Neural Inf Process Syst 24:612\u2013620","journal-title":"Adv Neural Inf Process Syst"},{"key":"1935_CR27","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.cam.2014.02.015","volume":"267","author":"L Liu","year":"2014","unstructured":"Liu L, Huang W, Chen D-R (2014) Exact minimum rank approximation via Schatten p-norm minimization. J Comput Appl Math 267:218\u2013227","journal-title":"J Comput Appl Math"},{"issue":"3","key":"1935_CR28","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/j.acha.2017.10.004","volume":"47","author":"R Zhang","year":"2019","unstructured":"Zhang R, Li S (2019) Optimal rip bounds for sparse signals recovery via $$\\ell _p$$ minimization. Appl Comput Harmon Anal 47(3):566\u2013584","journal-title":"Appl Comput Harmon Anal"},{"issue":"2","key":"1935_CR29","first-page":"894","volume":"38","author":"C-H Zhang","year":"2010","unstructured":"Zhang C-H (2010) Nearly unbiased variable selection under minimax concave penalty. Ann Stat 38(2):894\u2013942","journal-title":"Ann Stat"},{"issue":"3","key":"1935_CR30","first-page":"928","volume":"32","author":"J Fan","year":"2004","unstructured":"Fan J, Peng H (2004) Nonconcave penalized likelihood with a diverging number of parameters. Ann Stat 32(3):928\u2013961","journal-title":"Ann Stat"},{"key":"1935_CR31","doi-asserted-by":"crossref","first-page":"3132","DOI":"10.1109\/TIP.2019.2957925","volume":"29","author":"H Zhang","year":"2020","unstructured":"Zhang H, Qian J, Zhang B, Yang J, Gong C, Wei Y (2020) Low-rank matrix recovery via modified Schatten-$$p$$ norm minimization with convergence guarantees. IEEE Trans Image Process 29:3132\u20133142","journal-title":"IEEE Trans Image Process"},{"key":"1935_CR32","doi-asserted-by":"crossref","unstructured":"Lu C, Zhu C, Xu C, Yan S, Lin Z (2015) Generalized singular value thresholding. In: Proceedings of the twenty-ninth AAAI conference on artificial intelligence, pp 1805\u20131811","DOI":"10.1609\/aaai.v29i1.9464"},{"issue":"2","key":"1935_CR33","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1137\/110840364","volume":"51","author":"M-J Lai","year":"2013","unstructured":"Lai M-J, Xu Y, Yin W (2013) Improved iteratively reweighted least squares for unconstrained smoothed $$\\ell _q$$ minimization. SIAM J Numer Anal 51(2):927\u2013957","journal-title":"SIAM J Numer Anal"},{"key":"1935_CR34","first-page":"379","volume":"28","author":"H Li","year":"2015","unstructured":"Li H, Lin Z (2015) Accelerated proximal gradient methods for nonconvex programming. Adv Neural Inf Process Syst 28:379\u2013387","journal-title":"Adv Neural Inf Process Syst"},{"key":"1935_CR35","doi-asserted-by":"crossref","unstructured":"Boyd S, Parikh N, Chu E, Peleato B, Eckstein J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends\u00ae Mach Learn 3(1):1\u2013122","DOI":"10.1561\/2200000016"},{"issue":"3","key":"1935_CR36","doi-asserted-by":"crossref","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":"1935_CR37","first-page":"2967","volume":"26","author":"B Romera-Paredes","year":"2013","unstructured":"Romera-Paredes B, Pontil M (2013) A new convex relaxation for tensor completion. Adv Neural Inf Process Syst 26:2967\u20132975","journal-title":"Adv Neural Inf Process Syst"},{"key":"1935_CR38","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.neucom.2014.10.069","volume":"152","author":"W Cao","year":"2015","unstructured":"Cao W, Wang Y, Yang C, Chang X, Han Z, Xu Z (2015) Folded-concave penalization approaches to tensor completion. Neurocomputing 152:261\u2013273","journal-title":"Neurocomputing"},{"key":"1935_CR39","doi-asserted-by":"crossref","unstructured":"Zhao Q, Meng D, Kong X, Xie Q, Cao W, Wang Y, Xu Z (2015) A novel sparsity measure for tensor recovery. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 271\u2013279","DOI":"10.1109\/ICCV.2015.39"},{"issue":"8","key":"1935_CR40","doi-asserted-by":"crossref","first-page":"1888","DOI":"10.1109\/TPAMI.2017.2734888","volume":"40","author":"Q Xie","year":"2018","unstructured":"Xie Q, Zhao Q, Meng D, Xu Z (2018) Kronecker-basis-representation based tensor sparsity and its applications to tensor recovery. IEEE Trans Pattern Anal Mach Intell 40(8):1888\u20131902","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"2","key":"1935_CR41","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","volume":"9","author":"Y Xu","year":"2015","unstructured":"Xu Y, Hao R, Yin W, Su Z (2015) Parallel matrix factorization for low-rank tensor completion. Inverse Probl Imaging 9(2):601\u2013624","journal-title":"Inverse Probl Imaging"},{"issue":"5","key":"1935_CR42","doi-asserted-by":"crossref","first-page":"2466","DOI":"10.1109\/TIP.2017.2672439","volume":"26","author":"JA Bengua","year":"2017","unstructured":"Bengua JA, Phien HN, Tuan HD, Do MN (2017) Efficient tensor completion for color image and video recovery: low-rank tensor train. IEEE Trans Image Process 26(5):2466\u20132479","journal-title":"IEEE Trans Image Process"},{"issue":"5","key":"1935_CR43","doi-asserted-by":"crossref","first-page":"2295","DOI":"10.1137\/090752286","volume":"33","author":"IV Oseledets","year":"2011","unstructured":"Oseledets IV (2011) Tensor-train decomposition. SIAM J Sci Comput 33(5):2295\u20132317","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"1935_CR44","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer ME, Martin CD (2011) Factorization strategies for third-order tensors. Linear Algebra Appl 435(3):641\u2013658","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"1935_CR45","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer ME, Braman K, Hao N, Hoover RC (2013) Third-order tensors as operators on matrices: a theoretical and computational framework with applications in imaging. SIAM J Matrix Anal Appl 34(1):148\u2013172","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"1935_CR46","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1137\/110841229","volume":"35","author":"CD Martin","year":"2013","unstructured":"Martin CD, Shafer R, LaRue B (2013) An order-\\$p\\$ tensor factorization with applications in imaging. SIAM J Sci Comput 35(1):474\u2013490","journal-title":"SIAM J Sci Comput"},{"key":"1935_CR47","doi-asserted-by":"crossref","unstructured":"Zhang Z, Ely G, Aeron S, Hao N, Kilmer M (2014) Novel methods for multilinear data completion and de-noising based on tensor-SVD. In: Proceedings of IEEE conference on computer vision and pattern recognition, pp 3842\u20133849","DOI":"10.1109\/CVPR.2014.485"},{"issue":"6","key":"1935_CR48","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1109\/TSP.2016.2639466","volume":"65","author":"Z Zhang","year":"2017","unstructured":"Zhang Z, Aeron S (2017) Exact tensor completion using t-SVD. IEEE Trans Signal Process 65(6):1511\u20131526","journal-title":"IEEE Trans Signal Process"},{"key":"1935_CR49","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.ins.2020.05.005","volume":"532","author":"Y-B Zheng","year":"2020","unstructured":"Zheng Y-B, Huang T-Z, Zhao X-L, Jiang T-X, Ji T-Y, Ma T-H (2020) Tensor n-tubal rank and its convex relaxation for low-rank tensor recovery. Inf Sci 532:170\u2013189","journal-title":"Inf Sci"},{"issue":"3","key":"1935_CR50","doi-asserted-by":"crossref","first-page":"1714","DOI":"10.1109\/TIT.2019.2959980","volume":"66","author":"X Liu","year":"2020","unstructured":"Liu X, Aeron S, Aggarwal V, Wang X (2020) Low-tubal-rank tensor completion using alternating minimization. IEEE Trans Inf Theory 66(3):1714\u20131737","journal-title":"IEEE Trans Inf Theory"},{"key":"1935_CR51","doi-asserted-by":"crossref","unstructured":"Yuan L, Li C, Mandic DP, Cao J, Zhao Q (2019) Tensor ring decomposition with rank minimization on latent space: an efficient approach for tensor completion. In: Proceedings of the thirty-third AAAI conference on artificial intelligence, pp 9151\u20139158","DOI":"10.1609\/aaai.v33i01.33019151"},{"issue":"3","key":"1935_CR52","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s10994-019-05846-7","volume":"109","author":"L Yuan","year":"2020","unstructured":"Yuan L, Li C, Cao J, Zhao Q (2020) Rank minimization on tensor ring: an efficient approach for tensor decomposition and completion. Mach Learn 109(3):603\u2013622","journal-title":"Mach Learn"},{"key":"1935_CR53","doi-asserted-by":"crossref","unstructured":"Wang W, Aggarwal V, Aeron S (2017) Efficient low rank tensor ring completion. In: Proceedings of the 2017 IEEE international conference on computer vision, pp 5698\u20135706","DOI":"10.1109\/ICCV.2017.607"},{"issue":"7","key":"1935_CR54","doi-asserted-by":"crossref","first-page":"3020","DOI":"10.1109\/TNNLS.2020.3009210","volume":"32","author":"J Yu","year":"2021","unstructured":"Yu J, Zhou G, Li C, Zhao Q, Xie S (2021) Low tensor-ring rank completion by parallel matrix factorization. IEEE Trans Neural Netw Learn Syst 32(7):3020\u20133033","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1935_CR55","unstructured":"Zhao Q, Zhou G, Xie S, Zhang L, Cichocki A (2016) Tensor ring decomposition. CoRR arXiv:1606.05535"},{"key":"1935_CR56","doi-asserted-by":"crossref","unstructured":"Gu S, Zhang L, Zuo W, Feng X (2014) Weighted nuclear norm minimization with application to image denoising. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 2862\u20132869","DOI":"10.1109\/CVPR.2014.366"},{"key":"1935_CR57","volume-title":"MM optimization algorithms","author":"K Lange","year":"2016","unstructured":"Lange K (2016) MM optimization algorithms. Society for Industrial and Applied Mathematics, Philadelphia"},{"issue":"5","key":"1935_CR58","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1007\/s00041-008-9045-x","volume":"14","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s EJ, Wakin MB, Boyd SP (2008) Enhancing sparsity by reweighted $$\\ell _1$$ minimization. J Fourier Anal Appl 14(5):877\u2013905","journal-title":"J Fourier Anal Appl"},{"issue":"4","key":"1935_CR59","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G Cybenko","year":"1989","unstructured":"Cybenko G (1989) Approximation by superpositions of a sigmoidal function. Math Control Signals Syst 2(4):303\u2013314","journal-title":"Math Control Signals Syst"},{"issue":"5","key":"1935_CR60","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0893-6080(89)90020-8","volume":"2","author":"K Hornik","year":"1989","unstructured":"Hornik K, Stinchcombe M, White H (1989) Multilayer feedforward networks are universal approximators. Neural Netw 2(5):359\u2013366","journal-title":"Neural Netw"},{"issue":"3","key":"1935_CR61","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1109\/18.256500","volume":"39","author":"AR Barron","year":"1993","unstructured":"Barron AR (1993) Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans Inf Theory 39(3):930\u2013945","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"1935_CR62","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1109\/TNN.2010.2044803","volume":"21","author":"H Daniels","year":"2010","unstructured":"Daniels H, Velikova M (2010) Monotone and partially monotone neural networks. IEEE Trans Neural Netw 21(6):906\u2013917","journal-title":"IEEE Trans Neural Netw"},{"issue":"42","key":"1935_CR63","first-page":"1239","volume":"10","author":"C Dugas","year":"2009","unstructured":"Dugas C, Bengio Y, B\u00e9lisle F, Nadeau C, Garcia R (2009) Incorporating functional knowledge in neural networks. J Mach Learn Res 10(42):1239\u20131262","journal-title":"J Mach Learn Res"},{"key":"1935_CR64","unstructured":"Finn C, Abbeel P, Levine S (2017) Model-agnostic meta-learning for fast adaptation of deep networks. In: Proceedings of the 34th international conference on machine learning, pp 1126\u20131135"},{"key":"1935_CR65","unstructured":"Ren M, Zeng W, Yang B, Urtasun R (2018) Learning to reweight examples for robust deep learning. In: Proceedings of the 35th international conference on machine learning, pp 4334\u20134343"},{"key":"1935_CR66","first-page":"1919","volume":"32","author":"J Shu","year":"2019","unstructured":"Shu J, Xie Q, Yi L, Zhao Q, Zhou S, Xu Z, Meng D (2019) Meta-weight-net: learning an explicit mapping for sample weighting. Adv Neural Inf Process Syst 32:1919\u20131930","journal-title":"Adv Neural Inf Process Syst"},{"key":"1935_CR67","first-page":"8024","volume":"32","author":"A Paszke","year":"2019","unstructured":"Paszke A, Gross S, Massa F, Lerer A, Bradbury J, Chanan G, Killeen T, Lin Z, Gimelshein N, Antiga L, Desmaison A, Kopf A, Yang E, DeVito Z, Raison M, Tejani A, Chilamkurthy S, Steiner B, Fang L, Bai J, Chintala S (2019) Pytorch: an imperative style, high-performance deep learning library. Adv Neural Inf Process Syst 32:8024\u20138035","journal-title":"Adv Neural Inf Process Syst"},{"key":"1935_CR68","unstructured":"Abadi M, Barham P, Chen J, Chen Z, Davis A, Dean J, Devin M, Ghemawat S, Irving G, Isard M, Kudlur M, Levenberg J, Monga R, Moore S, Murray D.G, Steiner B, Tucker P, Vasudevan V, Warden P, Wicke M, Yu Y, Zheng X (2016) Tensorflow: a system for large-scale machine learning. In: Proceedings of the 12th USENIX conference on operating systems design and implementation, pp 265\u2013283"},{"issue":"7","key":"1935_CR69","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/TNNLS.2012.2197412","volume":"23","author":"Z Xu","year":"2012","unstructured":"Xu Z, Chang X, Xu F, Zhang H (2012) $$l_{1\/2}$$ regularization: a thresholding representation theory and a fast solver. IEEE Trans Neural Netw Learn Syst 23(7):1013\u20131027","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"4","key":"1935_CR70","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1109\/TIP.2003.819861","volume":"13","author":"Z Wang","year":"2004","unstructured":"Wang Z, Bovik AC, Sheikh HR, Simoncelli EP (2004) Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process 13(4):600\u2013612","journal-title":"IEEE Trans Image Process"},{"issue":"2","key":"1935_CR71","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s11263-008-0197-6","volume":"82","author":"S Roth","year":"2009","unstructured":"Roth S, Black MJ (2009) Fields of experts. Int J Comput Vis 82(2):205\u2013229","journal-title":"Int J Comput Vis"},{"issue":"2","key":"1935_CR72","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/TCYB.2019.2910151","volume":"51","author":"L Zhang","year":"2021","unstructured":"Zhang L, Song L, Du B, Zhang Y (2021) Nonlocal low-rank tensor completion for visual data. IEEE Trans Cybern 51(2):673\u2013685","journal-title":"IEEE Trans Cybern"},{"issue":"9","key":"1935_CR73","doi-asserted-by":"publisher","first-page":"2241","DOI":"10.1109\/TIP.2010.2046811","volume":"19","author":"F Yasuma","year":"2010","unstructured":"Yasuma F, Mitsunaga T, Iso D, Nayar SK (2010) Generalized assorted pixel camera: postcapture control of resolution, dynamic range, and spectrum. IEEE Trans Image Process 19(9):2241\u20132253. https:\/\/doi.org\/10.1109\/TIP.2010.2046811","journal-title":"IEEE Trans Image Process"},{"issue":"3","key":"1935_CR74","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u00e8s","year":"2011","unstructured":"Cand\u00e8s EJ, Li X, Ma Y, Wright J (2011) Robust principal component analysis? J ACM 58(3):11","journal-title":"J ACM"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01935-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-023-01935-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-023-01935-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T16:26:39Z","timestamp":1705076799000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-023-01935-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1935"],"URL":"https:\/\/doi.org\/10.1007\/s13042-023-01935-1","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"16 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}