{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T15:26:01Z","timestamp":1784388361569,"version":"3.55.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010225","name":"National Outstanding Youth Foundation of China","doi-asserted-by":"publisher","award":["61731018"],"award-info":[{"award-number":["61731018"]}],"id":[{"id":"10.13039\/501100010225","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10994-021-05987-8","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T17:02:43Z","timestamp":1624294963000},"page":"1867-1900","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["Tensor Q-rank: new data dependent definition of tensor rank"],"prefix":"10.1007","volume":"110","author":[{"given":"Hao","family":"Kong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Canyi","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhouchen","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"5987_CR1","volume-title":"Optimization algorithms on matrix manifolds","author":"P-A Absil","year":"2009","unstructured":"Absil, P.-A., Mahony, R., & Sepulchre, R. (2009). Optimization algorithms on matrix manifolds. Princeton, NJ: Princeton University Press."},{"issue":"2","key":"5987_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.acha.2007.10.002","volume":"24","author":"J-F Cai","year":"2008","unstructured":"Cai, J.-F., Chan, R. H., & Shen, Z. (2008). A framelet-based image inpainting algorithm. Applied and Computational Harmonic Analysis, 24(2), 131\u2013149.","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"6","key":"5987_CR3","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E. J., & Recht, B. (2009). Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6), 717.","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"5987_CR4","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E. J., & Tao, T. (2010). The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5), 2053\u20132080.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"5987_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0895479895290954","volume":"20","author":"A Edelman","year":"1998","unstructured":"Edelman, A., Arias, T. A., & Smith, S. T. (1998). The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20(2), 303\u2013353.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"311","key":"5987_CR6","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1090\/mcom\/3239","volume":"87","author":"S Friedland","year":"2018","unstructured":"Friedland, S., & Lim, L.-H. (2018). Nuclear norm of higher-order tensors. Mathematics of Computation, 87(311), 1255\u20131281.","journal-title":"Mathematics of Computation"},{"issue":"10","key":"5987_CR7","doi-asserted-by":"publisher","first-page":"2120","DOI":"10.1109\/TNNLS.2016.2553155","volume":"27","author":"Y Fu","year":"2016","unstructured":"Fu, Y., Gao, J., Tien, D., Lin, Z., & Hong, X. (2016). Tensor lrr and sparse coding-based subspace clustering. IEEE Transactions on Neural Networks and Learning Systems, 27(10), 2120\u20132133.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"4","key":"5987_CR8","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/0196-6774(90)90014-6","volume":"11","author":"J H\u00e5stad","year":"1990","unstructured":"H\u00e5stad, J. (1990). Tensor rank is NP-complete. Journal of Algorithms, 11(4), 644\u2013654.","journal-title":"Journal of Algorithms"},{"issue":"6","key":"5987_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/2512329","volume":"60","author":"CJ Hillar","year":"2013","unstructured":"Hillar, C. J., & Lim, L.-H. (2013). Most tensor problems are NP-hard. Journal of the ACM, 60(6), 45.","journal-title":"Journal of the ACM"},{"issue":"1\u20134","key":"5987_CR10","first-page":"164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock, F. L. (1927). The expression of a tensor or a polyadic as a sum of products. Studies in Applied Mathematics, 6(1\u20134), 164\u2013189.","journal-title":"Studies in Applied Mathematics"},{"issue":"1\u20134","key":"5987_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/sapm19287139","volume":"7","author":"FL Hitchcock","year":"1928","unstructured":"Hitchcock, F. L. (1928). Multiple invariants and generalized rank of a p-way matrix or tensor. Journal of Mathematics and Physics, 7(1\u20134), 39\u201379.","journal-title":"Journal of Mathematics and Physics"},{"issue":"12","key":"5987_CR12","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1109\/TNNLS.2016.2611525","volume":"28","author":"W Hu","year":"2016","unstructured":"Hu, W., Tao, D., Zhang, W., Xie, Y., & Yang, Y. (2016). The twist tensor nuclear norm for video completion. IEEE Transactions on Neural Networks and Learning Systems, 28(12), 2961\u20132973.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"5987_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.ins.2018.01.035","volume":"436","author":"T-X Jiang","year":"2018","unstructured":"Jiang, T.-X., Huang, T.-Z., Zhao, X.-L., Ji, T.-Y., & Deng, L.-J. (2018). Matrix factorization for low-rank tensor completion using framelet prior. Information Sciences, 436, 403\u2013417.","journal-title":"Information Sciences"},{"key":"5987_CR14","doi-asserted-by":"publisher","first-page":"7233","DOI":"10.1109\/TIP.2020.3000349","volume":"29","author":"T-X Jiang","year":"2020","unstructured":"Jiang, T.-X., Ng, M. K., Zhao, X.-L., & Huang, T.-Z. (2020). Framelet representation of tensor nuclear norm for third-order tensor completion. IEEE Transactions on Image Processing, 29, 7233\u20137244.","journal-title":"IEEE Transactions on Image Processing"},{"key":"5987_CR15","unstructured":"Kasai, H., & Mishra, B. (2016). Low-rank tensor completion: A Riemannian manifold preconditioning approach. In International conference on machine learning, pp. 1012\u20131021."},{"key":"5987_CR16","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.laa.2015.07.021","volume":"485","author":"E Kernfeld","year":"2015","unstructured":"Kernfeld, E., Kilmer, M., & Aeron, S. (2015). Tensor-tensor products with invertible linear transforms. Linear Algebra and its Applications, 485, 545\u2013570.","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"5987_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I","volume":"14","author":"HA Kiers","year":"2000","unstructured":"Kiers, H. A. (2000). Towards a standardized notation and terminology in multiway analysis. Journal of Chemometrics, 14(3), 105\u2013122.","journal-title":"Journal of Chemometrics"},{"issue":"1","key":"5987_CR18","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/110837711","volume":"34","author":"ME Kilmer","year":"2013","unstructured":"Kilmer, M. E., Braman, K., Hao, N., & Hoover, R. C. (2013). Third-order tensors as operators on matrices: A theoretical and computational framework with applications in imaging. SIAM Journal on Matrix Analysis and Applications, 34(1), 148\u2013172.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"3","key":"5987_CR19","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/j.laa.2010.09.020","volume":"435","author":"ME Kilmer","year":"2011","unstructured":"Kilmer, M. E., & Martin, C. D. (2011). Factorization strategies for third-order tensors. Linear Algebra and its Applications, 435(3), 641\u2013658.","journal-title":"Linear Algebra and its Applications"},{"issue":"3","key":"5987_CR20","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T. G., & Bader, B. W. (2009). Tensor decompositions and applications. SIAM Review, 51(3), 455\u2013500.","journal-title":"SIAM Review"},{"issue":"6","key":"5987_CR21","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1109\/JSTSP.2018.2879185","volume":"12","author":"H Kong","year":"2018","unstructured":"Kong, H., Xie, X., & Lin, Z. (2018). t-Schatten-$$ p $$ norm for low-rank tensor recovery. IEEE Journal of Selected Topics in Signal Processing, 12(6), 1405\u20131419.","journal-title":"IEEE Journal of Selected Topics in Signal Processing"},{"key":"5987_CR22","unstructured":"Krizhevsky, A., & Hinton, G. (2009). Learning multiple layers of features from tiny images, tech. rep., Citeseer."},{"key":"5987_CR23","doi-asserted-by":"crossref","unstructured":"Kuehne, H., Jhuang, H., Garrote, E., Poggio, T., & Serre, T. (2011). HMDB: A large video database for human motion recognition. In IEEE international conference on computer vision, pp. 2556\u20132563.","DOI":"10.1109\/ICCV.2011.6126543"},{"key":"5987_CR24","doi-asserted-by":"crossref","unstructured":"Li, C., Guo, L., Tao, Y., Wang, J., Qi, L., & Dou, Z. (2016). Yet another Schatten norm for tensor recovery. In International conference on neural information processing, pp. 51\u201360.","DOI":"10.1007\/978-3-319-46675-0_6"},{"key":"5987_CR25","unstructured":"Lin, Z., Liu, R., & Su, Z. (2011). Linearized alternating direction method with adaptive penalty for low-rank representation. Advances in Neural Information Processing Systems, 612\u2013620."},{"issue":"2","key":"5987_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10994-014-5469-5","volume":"99","author":"Z Lin","year":"2015","unstructured":"Lin, Z., Liu, R., & Li, H. (2015). Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning. Machine Learning, 99(2), 287.","journal-title":"Machine Learning"},{"issue":"1","key":"5987_CR27","doi-asserted-by":"publisher","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 Transactions on Pattern Analysis and Machine Intelligence, 35(1), 208\u2013220.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"12","key":"5987_CR28","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TNNLS.2015.2496858","volume":"27","author":"Y Liu","year":"2015","unstructured":"Liu, Y., Shang, F., Fan, W., Cheng, J., & Cheng, H. (2015). Generalized higher order orthogonal iteration for tensor learning and decomposition. IEEE Transactions on Neural Networks and Learning Systems, 27(12), 2551\u20132563.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"5987_CR29","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., & Yan, S. (2016). Tensor robust principal component analysis: Exact recovery of corrupted low-rank tensors via convex optimization. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 5249\u20135257.","DOI":"10.1109\/CVPR.2016.567"},{"key":"5987_CR30","doi-asserted-by":"crossref","unstructured":"Lu, C., Feng, J., Lin, Z., & Yan, S. (2018). Exact low tubal rank tensor recovery from gaussian measurements. In International conference on artificial intelligence.","DOI":"10.24963\/ijcai.2018\/347"},{"key":"5987_CR31","doi-asserted-by":"crossref","unstructured":"Lu, C., Peng, X., & Wei, Y. (2019). Low-rank tensor completion with a new tensor nuclear norm induced by invertible linear transforms. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 5996\u20136004.","DOI":"10.1109\/CVPR.2019.00615"},{"issue":"4","key":"5987_CR32","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/TPAMI.2019.2891760","volume":"42","author":"C Lu","year":"2019","unstructured":"Lu, C., Feng, J., Chen, Y., Liu, W., Lin, Z., & Yan, S. (2019). Tensor robust principal component analysis with a new tensor nuclear norm. IEEE Transactions on Pattern Analysis and Machine Intelligence, 42(4), 925\u2013938.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"5987_CR33","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/TPAMI.2017.2689021","volume":"40","author":"C Lu","year":"2017","unstructured":"Lu, C., Feng, J., Yan, S., & Lin, Z. (2017). A unified alternating direction method of multipliers by majorization minimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 40(3), 527\u2013541.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5987_CR34","unstructured":"Nene, S.\u00a0A., Nayar, S.\u00a0K., Murase, H., et\u00a0al. (1996). Columbia object image library (coil-20)."},{"issue":"3","key":"5987_CR35","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1137\/S1064827598341384","volume":"21","author":"MK Ng","year":"1999","unstructured":"Ng, M. K., Chan, R. H., & Tang, W.-C. (1999). A fast algorithm for deblurring models with Neumann boundary conditions. SIAM Journal on Scientific Computing, 21(3), 851\u2013866.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"15","key":"5987_CR36","first-page":"510","volume":"7","author":"KB Petersen","year":"2008","unstructured":"Petersen, K. B., Pedersen, M. S., et al. (2008). The matrix cookbook. Technical University of Denmark, 7(15), 510.","journal-title":"Technical University of Denmark"},{"key":"5987_CR37","unstructured":"Romera-Paredes, B., & Pontil, M. (2013). A new convex relaxation for tensor completion. Advances in Neural Information Processing Systems, 2967\u20132975."},{"key":"5987_CR38","doi-asserted-by":"crossref","unstructured":"Song, G., Ng, M.\u00a0K., & Zhang, X. (2019). Robust tensor completion using transformed tensor svd. arXiv preprint arXiv:1907.01113.","DOI":"10.1002\/nla.2299"},{"key":"5987_CR39","unstructured":"Tomioka, R., & Suzuki, T. (2013). Convex tensor decomposition via structured Schatten norm regularization. In Advances in neural information processing systems, pp.\u00a01331\u20131339."},{"key":"5987_CR40","unstructured":"Tomioka, R., Hayashi, K., & Kashima, H. (2010). On the extension of trace norm to tensors. In NIPS workshop on tensors, kernels, and machine learning, p.\u00a07."},{"issue":"3","key":"5987_CR41","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L. R. (1966). Some mathematical notes on three-mode factor analysis. Psychometrika, 31(3), 279\u2013311.","journal-title":"Psychometrika"},{"issue":"1\u20132","key":"5987_CR42","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s10107-012-0584-1","volume":"142","author":"Z Wen","year":"2013","unstructured":"Wen, Z., & Yin, W. (2013). A feasible method for optimization with orthogonality constraints. Mathematical Programming, 142(1\u20132), 397\u2013434.","journal-title":"Mathematical Programming"},{"key":"5987_CR43","unstructured":"Wimalawarne, K., Sugiyama, M., & Tomioka, R. (2014). Multitask learning meets tensor factorization: Task imputation via convex optimization. Advances in Neural Information Processing Systems, 2825\u20132833."},{"key":"5987_CR44","unstructured":"Xu, W.-H., Zhao, X.-L., & Ng, M. (2019). A fast algorithm for cosine transform based tensor singular value decomposition. arXiv preprint arXiv:1902.03070."},{"issue":"2","key":"5987_CR45","doi-asserted-by":"publisher","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","volume":"9","author":"Y Xu","year":"2017","unstructured":"Xu, Y., Hao, R., Yin, W., & Su, Z. (2017). Parallel matrix factorization for low-rank tensor completion. Inverse Problems & Imaging, 9(2), 601\u2013624.","journal-title":"Inverse Problems & Imaging"},{"issue":"3","key":"5987_CR46","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2015","unstructured":"Xu, Y., & Yin, W. (2015). A block coordinate descent method for regularized multi-convex optimization with applications to nonnegative tensor factorization and completion. SIAM Journal on Imaging Sciences, 6(3), 1758\u20131789.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"3","key":"5987_CR47","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1109\/TNNLS.2018.2851444","volume":"30","author":"M Yin","year":"2018","unstructured":"Yin, M., Gao, J., Xie, S., & Guo, Y. (2018). Multiview subspace clustering via tensorial t-product representation. IEEE Transactions on Neural Networks and Learning Systems, 30(3), 851\u2013864.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"issue":"4","key":"5987_CR48","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.1007\/s10208-015-9269-5","volume":"16","author":"M Yuan","year":"2016","unstructured":"Yuan, M., & Zhang, C.-H. (2016). On tensor completion via nuclear norm minimization. Foundations of Computational Mathematics, 16(4), 1031\u20131068.","journal-title":"Foundations of Computational Mathematics"},{"key":"5987_CR49","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 the IEEE conference on computer vision and pattern recognition, pp. 3842\u20133849.","DOI":"10.1109\/CVPR.2014.485"},{"issue":"6","key":"5987_CR50","doi-asserted-by":"publisher","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 Transactions on Signal Processing, 65(6), 1511\u20131526.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"3","key":"5987_CR51","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1109\/TIP.2017.2762595","volume":"27","author":"P Zhou","year":"2018","unstructured":"Zhou, P., Lu, C., Lin, Z., & Zhang, C. (2018). Tensor factorization for low-rank tensor completion. IEEE Transactions on Image Processing, 27(3), 1152\u20131163.","journal-title":"IEEE Transactions on Image Processing"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05987-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-05987-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-05987-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,21]],"date-time":"2022-06-21T00:05:37Z","timestamp":1655769937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-05987-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":51,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5987"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-05987-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]},"assertion":[{"value":"17 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}