{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T16:49:44Z","timestamp":1770137384108,"version":"3.49.0"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"HSE basic research program"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s40314-025-03605-0","type":"journal-article","created":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T05:40:49Z","timestamp":1770097249000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimization on the extended tensor-train manifold with shared factors"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3908-4079","authenticated-orcid":false,"given":"Alexander","family":"Molozhavenko","sequence":"first","affiliation":[]},{"given":"Maxim","family":"Rakhuba","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,3]]},"reference":[{"key":"3605_CR1","doi-asserted-by":"publisher","first-page":"28684","DOI":"10.1109\/ACCESS.2021.3058103","volume":"9","author":"S Ahmadi-Asl","year":"2021","unstructured":"Ahmadi-Asl S, Abukhovich S, Asante-Mensah MG, Cichocki A, Phan AH, Tanaka T, Oseledets I (2021) Randomized algorithms for computation of tucker decomposition and higher order svd (hosvd). IEEE Access 9:28684\u201328706. https:\/\/doi.org\/10.1109\/ACCESS.2021.3058103","journal-title":"IEEE Access"},{"issue":"1","key":"3605_CR2","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/abad87","volume":"2","author":"S Ahmadi-Asl","year":"2020","unstructured":"Ahmadi-Asl S, Cichocki A, Huy Phan A, Asante-Mensah MG, Musavian Ghazani M, Tanaka T, Oseledets I (2020) Randomized algorithms for fast computation of low rank tensor ring model. Mach Learn Sci Tech 2(1):011001. https:\/\/doi.org\/10.1088\/2632-2153\/abad87","journal-title":"Mach Learn Sci Tech"},{"key":"3605_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9051-7","volume-title":"Optimization Algorithms on Matrix Manifolds","author":"P-A Absil","year":"2008","unstructured":"Absil P-A, Mahony R, Sepulchre R (2008) Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton, NJ. https:\/\/doi.org\/10.1007\/s10208-009-9051-7"},{"key":"3605_CR4","doi-asserted-by":"publisher","unstructured":"Balazevic I, Allen C, Hospedales T (2019) TuckER: Tensor factorization for knowledge graph completion. In Inui K, Jiang J, Ng V, Wan X (eds.) Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pp. 5185\u20135194. Association for Computational Linguistics, Hong Kong, China. https:\/\/doi.org\/10.18653\/v1\/D19-1522 . https:\/\/aclanthology.org\/D19-1522\/","DOI":"10.18653\/v1\/D19-1522"},{"key":"3605_CR5","volume-title":"Riemannian Manifold Trust-region Methods with Applications to Eigenproblems","author":"CG Baker","year":"2008","unstructured":"Baker CG (2008) Riemannian Manifold Trust-region Methods with Applications to Eigenproblems. The Florida State University, Tallahassee, FL"},{"key":"3605_CR6","doi-asserted-by":"publisher","unstructured":"Bogachev V, Aletov V, Molozhavenko A, Bobkov D, Soboleva V, Alanov A, Rakhuba M (2025) Riemannlora: A unified riemannian framework for ambiguity-free lora optimization. arXiv preprint arXiv:2507.12142. https:\/\/doi.org\/10.48550\/arXiv.2507.12142","DOI":"10.48550\/arXiv.2507.12142"},{"key":"3605_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","volume-title":"An Introduction to Optimization on Smooth Manifolds","author":"N Boumal","year":"2023","unstructured":"Boumal N (2023) An Introduction to Optimization on Smooth Manifolds. Cambridge University Press, Cambridge, UK. https:\/\/doi.org\/10.1017\/9781009166164"},{"issue":"1","key":"3605_CR8","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10444-018-9622-8","volume":"45","author":"M Che","year":"2019","unstructured":"Che M, Wei Y (2019) Randomized algorithms for the approximations of tucker and the tensor train decompositions. Adv Comput Math 45(1):395\u2013428","journal-title":"Adv Comput Math"},{"issue":"2","key":"3605_CR9","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/19M1237016","volume":"41","author":"M Che","year":"2020","unstructured":"Che M, Wei Y, Yan H (2020) The computation of low multilinear rank approximations of tensors via power scheme and random projection. SIAM J Matrix Anal Appl 41(2):605\u2013636","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"3605_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s10915-021-01545-5","volume":"88","author":"M Che","year":"2021","unstructured":"Che M, Wei Y, Yan H (2021) An efficient randomized algorithm for computing the approximate tucker decomposition. J Sci Comput 88(2):32","journal-title":"J Sci Comput"},{"issue":"1","key":"3605_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/23M1594066","volume":"46","author":"M Che","year":"2025","unstructured":"Che M, Wei Y, Yan H (2025) Efficient randomized algorithms for fixed precision problem of approximate tucker decomposition. SIAM J Matrix Anal Appl 46(1):256\u2013297","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"4","key":"3605_CR12","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1016\/j.cpc.2013.12.017","volume":"185","author":"SV Dolgov","year":"2014","unstructured":"Dolgov SV, Khoromskij BN, Oseledets IV, Savostyanov DV (2014) Computation of extreme eigenvalues in higher dimensions using block tensor train format. Comput Phys Commun 185(4):1207\u20131216. https:\/\/doi.org\/10.1016\/j.cpc.2013.12.017","journal-title":"Comput Phys Commun"},{"issue":"5","key":"3605_CR13","doi-asserted-by":"publisher","first-page":"2248","DOI":"10.1137\/140953289","volume":"36","author":"SV Dolgov","year":"2014","unstructured":"Dolgov SV, Savostyanov DV (2014) Alternating minimal energy methods for linear systems in higher dimensions. SIAM J Sci Comput 36(5):2248\u20132271. https:\/\/doi.org\/10.1137\/140953289","journal-title":"SIAM J Sci Comput"},{"issue":"3","key":"3605_CR14","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1002\/widm.1201","volume":"7","author":"E Frolov","year":"2017","unstructured":"Frolov E, Oseledets I (2017) Tensor methods and recommender systems. Wiley Interdiscip Rev Data Min Knowl Discov 7(3):1201","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"issue":"5","key":"3605_CR15","doi-asserted-by":"publisher","first-page":"2424","DOI":"10.1137\/130942401","volume":"37","author":"L Grasedyck","year":"2015","unstructured":"Grasedyck L, Kluge M, Kr\u00e4mer S (2015) Variants of alternating least squares tensor completion in the tensor train format. SIAM J Sci Comput 37(5):2424\u20132450. https:\/\/doi.org\/10.1137\/130942401","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"3605_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1002\/gamm.201310004","volume":"36","author":"L Grasedyck","year":"2013","unstructured":"Grasedyck L, Kressner D, Tobler C (2013) A literature survey of low-rank tensor approximation techniques. GAMM-Mitteilungen 36(1):53\u201378. https:\/\/doi.org\/10.1002\/gamm.201310004","journal-title":"GAMM-Mitteilungen"},{"issue":"2","key":"3605_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10589-024-00559-7","volume":"88","author":"B Gao","year":"2024","unstructured":"Gao B, Peng R, Yuan Y-X (2024) Riemannian preconditioned algorithms for tensor completion via tensor ring decomposition. Comput Optim Appl 88(2):443\u2013468. https:\/\/doi.org\/10.1007\/s10589-024-00559-7","journal-title":"Comput Optim Appl"},{"key":"3605_CR18","unstructured":"Harshman RA (1978) Models for analysis of asymmetrical relationships among n objects or stimuli. In: Paper Presented at the First Joint Meeting of the Psychometric Society and the Society of Mathematical Psychology, Hamilton"},{"issue":"1\u20134","key":"3605_CR19","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1002\/sapm192761164","volume":"6","author":"FL Hitchcock","year":"1927","unstructured":"Hitchcock FL (1927) The expression of a tensor or a polyadic as a sum of products. J Math Phys 6(1\u20134):164\u2013189. https:\/\/doi.org\/10.1002\/sapm192761164","journal-title":"J Math Phys"},{"issue":"5","key":"3605_CR20","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/s00041-009-9094-9","volume":"15","author":"W Hackbusch","year":"2009","unstructured":"Hackbusch W, K\u00fchn S (2009) A new scheme for the tensor representation. J Fourier Anal Appl 15(5):706\u2013722. https:\/\/doi.org\/10.1007\/s00041-009-9094-9","journal-title":"J Fourier Anal Appl"},{"issue":"2","key":"3605_CR21","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/100818893","volume":"34","author":"S Holtz","year":"2012","unstructured":"Holtz S, Rohwedder T, Schneider R (2012) The alternating linear scheme for tensor optimization in the tensor train format. SIAM J Sci Comput 34(2):683\u2013713. https:\/\/doi.org\/10.1137\/100818893","journal-title":"SIAM J Sci Comput"},{"issue":"2","key":"3605_CR22","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/100818893","volume":"34","author":"S Holtz","year":"2012","unstructured":"Holtz S, Rohwedder T, Schneider R (2012) The alternating linear scheme for tensor optimization in the tensor train format. SIAM J Sci Comput 34(2):683\u2013713. https:\/\/doi.org\/10.1137\/100818893","journal-title":"SIAM J Sci Comput"},{"issue":"4","key":"3605_CR23","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s00211-011-0419-7","volume":"120","author":"S Holtz","year":"2012","unstructured":"Holtz S, Rohwedder T, Schneider R (2012) On manifolds of tensors of fixed tt-rank. Numer Math 120(4):701\u2013731. https:\/\/doi.org\/10.1007\/s00211-011-0419-7","journal-title":"Numer Math"},{"issue":"3","key":"3605_CR24","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. https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Rev"},{"issue":"2","key":"3605_CR25","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s00365-011-9131-1","volume":"34","author":"BN Khoromskij","year":"2011","unstructured":"Khoromskij BN (2011) O (d log n)-quantics approximation of n-d tensors in high-dimensional numerical modeling. Constr Approx 34(2):257\u2013280. https:\/\/doi.org\/10.1007\/s00365-011-9131-1","journal-title":"Constr Approx"},{"issue":"1","key":"3605_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.chemolab.2011.09.001","volume":"110","author":"BN Khoromskij","year":"2012","unstructured":"Khoromskij BN (2012) Tensors-structured numerical methods in scientific computing: Survey on recent advances. Chemom Intell Lab Syst 110(1):1\u201319. https:\/\/doi.org\/10.1016\/j.chemolab.2011.09.001","journal-title":"Chemom Intell Lab Syst"},{"issue":"2","key":"3605_CR27","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1137\/S1064827500366124","volume":"23","author":"AV Knyazev","year":"2001","unstructured":"Knyazev AV (2001) Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method. SIAM J Sci Comput 23(2):517\u2013541. https:\/\/doi.org\/10.1137\/S1064827500366124","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"3605_CR28","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/19M130838","volume":"43","author":"C Krumnow","year":"2021","unstructured":"Krumnow C, Pfeffer M, Uschmajew A (2021) Computing eigenspaces with low rank constraints. SIAM J Sci Comput 43(1):586\u2013608. https:\/\/doi.org\/10.1137\/19M130838","journal-title":"SIAM J Sci Comput"},{"key":"3605_CR29","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10543-013-0455-z","volume":"54","author":"D Kressner","year":"2014","unstructured":"Kressner D, Steinlechner M, Vandereycken B (2014) Low-rank tensor completion by riemannian optimization. BIT Numer Math 54:447\u2013468. https:\/\/doi.org\/10.1007\/s10543-013-0455-z","journal-title":"BIT Numer Math"},{"issue":"4","key":"3605_CR30","doi-asserted-by":"publisher","first-page":"2018","DOI":"10.1137\/15M1032909","volume":"38","author":"D Kressner","year":"2016","unstructured":"Kressner D, Steinlechner M, Vandereycken B (2016) Preconditioned low-rank riemannian optimization for linear systems with tensor product structure. SIAM J Sci Comput 38(4):2018\u20132044. https:\/\/doi.org\/10.1137\/15M1032909","journal-title":"SIAM J Sci Comput"},{"key":"3605_CR31","doi-asserted-by":"publisher","unstructured":"Lee JM (2012) Sard\u2019s theorem and transversality. Smooth Manifolds. Springer, New York, NY, pp 143\u2013147. https:\/\/doi.org\/10.1007\/978-1-4419-9982-5","DOI":"10.1007\/978-1-4419-9982-5"},{"key":"3605_CR32","unstructured":"Lebedev V, Ganin Y, Rakhuba M, Oseledets I, Lempitsky V (2014) Speeding-up convolutional neural networks using fine-tuned cp-decomposition. arXiv preprint arXiv:1412.6553"},{"issue":"2","key":"3605_CR33","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/140976546","volume":"53","author":"C Lubich","year":"2015","unstructured":"Lubich C, Oseledets IV, Vandereycken B (2015) Time integration of tensor trains. SIAM J Numer Anal 53(2):917\u2013941. https:\/\/doi.org\/10.1137\/140976546","journal-title":"SIAM J Numer Anal"},{"key":"3605_CR34","unstructured":"Novikov A, Belousov D (2021) TTAX: Tensor-Train toolbox on Jax. https:\/\/ttax.readthedocs.io\/en\/latest\/index.html"},{"key":"3605_CR35","unstructured":"Novikov A, Belousov D, Izmailov P, Oseledets I, Figurnov M, Khrulkov V (2017) t3f - library for working with Tensor Train decomposition built on top of TensorFlow. https:\/\/t3f.readthedocs.io\/en\/latest\/index.html"},{"key":"3605_CR36","unstructured":"Novikov A, Podoprikhin D, Osokin A, Vetrov DP (2015) Tensorizing neural networks. Adv Neural Inform Process Syst 28"},{"issue":"2","key":"3605_CR37","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1137\/20M1356774","volume":"44","author":"A Novikov","year":"2022","unstructured":"Novikov A, Rakhuba M, Oseledets I (2022) Automatic differentiation for riemannian optimization on low-rank matrix and tensor-train manifolds. SIAM J Sci Comput 44(2):843\u2013869. https:\/\/doi.org\/10.1137\/20M1356774","journal-title":"SIAM J Sci Comput"},{"key":"3605_CR38","first-page":"3104482","volume":"11","author":"M Nickel","year":"2011","unstructured":"Nickel M, Tresp V, Kriegel H-P et al (2011) A three-way model for collective learning on multi-relational data. Icml 11:3104482\u20133104584","journal-title":"Icml"},{"key":"3605_CR39","unstructured":"Oseledets IV, Khoromskij BN (2010) DMRG+QTT approach to computation of the ground state for the molecular Schr\u00f6dinger operator. Preprint, MPI MIS"},{"key":"3605_CR40","unstructured":"Obukhov A, Rakhuba M, Georgoulis S, Kanakis M, Dai D, Van\u00a0Gool L (2020) T-basis: a compact representation for neural networks. In: III HD, Singh A (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 119, pp. 7392\u20137404. PMLR, New York, NY. https:\/\/proceedings.mlr.press\/v119\/obukhov20a.html"},{"issue":"4","key":"3605_CR41","doi-asserted-by":"publisher","first-page":"2130","DOI":"10.1137\/090757861","volume":"31","author":"IV Oseledets","year":"2010","unstructured":"Oseledets IV (2010) Approximation of $$2^d\\times 2^d$$ matrices using tensor decomposition. SIAM J Matrix Anal Appl 31(4):2130\u20132145. https:\/\/doi.org\/10.1137\/090757861","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"5","key":"3605_CR42","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1137\/090752286","journal-title":"SIAM J Sci Comput"},{"key":"3605_CR43","unstructured":"Oseledets I (2012) ttpy: Python implementation of the TT-Toolbox. https:\/\/github.com\/oseledets\/ttpy"},{"issue":"5","key":"3605_CR44","doi-asserted-by":"publisher","first-page":"3744","DOI":"10.1137\/090748330","volume":"31","author":"IV Oseledets","year":"2009","unstructured":"Oseledets IV, Tyrtyshnikov EE (2009) Breaking the curse of dimensionality, or how to use svd in many dimensions. SIAM J Sci Comput 31(5):3744\u20133759. https:\/\/doi.org\/10.1137\/090748330","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"3605_CR45","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.laa.2009.07.024","volume":"432","author":"I Oseledets","year":"2010","unstructured":"Oseledets I, Tyrtyshnikov E (2010) Tt-cross approximation for multidimensional arrays. Linear Algebra Appl 432(1):70\u201388. https:\/\/doi.org\/10.1016\/j.laa.2009.07.024","journal-title":"Linear Algebra Appl"},{"key":"3605_CR46","unstructured":"Peshekhonov I, Arzhantsev A, Rakhuba M (2024) Training a Tucker model with shared factors: a Riemannian optimization approach. In Dasgupta S, Mandt S, Li Y (eds) Proceedings of The 27th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol. 238, pp. 3304\u20133312. PMLR, New York, NY. https:\/\/proceedings.mlr.press\/v238\/peshekhonov24a.html"},{"key":"3605_CR47","doi-asserted-by":"publisher","DOI":"10.1090\/chel\/370","volume-title":"Differential topology prentice-hall","author":"VGA Pollack","year":"1974","unstructured":"Pollack VGA (1974) Differential topology prentice-hall. Inc, Englewood Cliffs, New Jersey. https:\/\/doi.org\/10.1090\/chel\/370"},{"key":"3605_CR48","unstructured":"Parkina U, Rakhuba M (2025) Coala: Numerically stable and efficient framework for context-aware low-rank approximation. arXiv preprint arXiv:2507.07580"},{"key":"3605_CR49","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1016\/j.jcp.2019.07.003","volume":"396","author":"M Rakhuba","year":"2019","unstructured":"Rakhuba M, Novikov A, Oseledets I (2019) Low-rank riemannian eigensolver for high-dimensional hamiltonians. J Comput Phys 396:718\u2013737. https:\/\/doi.org\/10.1016\/j.jcp.2019.07.003","journal-title":"J Comput Phys"},{"issue":"2","key":"3605_CR50","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1137\/17M1123080","volume":"40","author":"M Rakhuba","year":"2018","unstructured":"Rakhuba M, Oseledets IV (2018) Jacobi-davidson method on low-rank matrix manifolds. SIAM J Sci Comput 40(2):1149\u20131170. https:\/\/doi.org\/10.1137\/17M1123080","journal-title":"SIAM J Sci Comput"},{"key":"3605_CR51","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-662-64340-2","volume":"18","author":"JW Robbin","year":"2011","unstructured":"Robbin JW, Salamon DA (2011) Introduction to differential geometry. ETH Lecture Notes preliminary version 18:52. https:\/\/doi.org\/10.1007\/978-3-662-64340-2","journal-title":"ETH Lecture Notes preliminary version"},{"issue":"2","key":"3605_CR52","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1137\/110857520","volume":"51","author":"T Rohwedder","year":"2013","unstructured":"Rohwedder T, Uschmajew A (2013) On local convergence of alternating schemes for optimization of convex problems in the tensor train format. SIAM J Numer Anal 51(2):1134\u20131162. https:\/\/doi.org\/10.1137\/110857520","journal-title":"SIAM J Numer Anal"},{"key":"3605_CR53","doi-asserted-by":"publisher","unstructured":"Steinlechner MM (2016) Riemannian optimization for solving high-dimensional problems with low-rank tensor structure. PhD thesis, EPFL. https:\/\/doi.org\/10.1137\/15M1010506","DOI":"10.1137\/15M1010506"},{"issue":"122\u2013137","key":"3605_CR54","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1108\/09534810210423008","volume":"15","author":"LR Tucker","year":"1963","unstructured":"Tucker LR (1963) Implications of factor analysis of three-way matrices for measurement of change. Problem Measuring Change 15(122\u2013137):3. https:\/\/doi.org\/10.1108\/09534810210423008","journal-title":"Problem Measuring Change"},{"issue":"208","key":"3605_CR55","first-page":"1","volume":"23","author":"M Usvyatsov","year":"2022","unstructured":"Usvyatsov M, Ballester-Ripoll R, Schindler K (2022) tntorch: Tensor network learning with PyTorch. J Mach Learn Res 23(208):1\u20136","journal-title":"J Mach Learn Res"},{"issue":"1","key":"3605_CR56","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.laa.2013.03.016","volume":"439","author":"A Uschmajew","year":"2013","unstructured":"Uschmajew A, Vandereycken B (2013) The geometry of algorithms using hierarchical tensors. Linear Algebra Appl 439(1):133\u2013166. https:\/\/doi.org\/10.1016\/j.laa.2013.03.016","journal-title":"Linear Algebra Appl"},{"key":"3605_CR57","doi-asserted-by":"crossref","unstructured":"Vorotnikov I, Romashov F, Rybin N, Rakhuba M, Novikov IS (2025) Low-rank matrix and tensor approximations: advancing efficiency of machine-learning interatomic potentials. arXiv preprint arXiv:2509.04440","DOI":"10.1063\/5.0300163"},{"key":"3605_CR58","doi-asserted-by":"publisher","unstructured":"Zhao Q, Zhou G, Xie S, Zhang L, Cichocki A (2016) Tensor ring decomposition. arXiv preprint arXiv:1606.05535. https:\/\/doi.org\/10.48550\/arXiv.1606.05535","DOI":"10.48550\/arXiv.1606.05535"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03605-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03605-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03605-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T05:40:53Z","timestamp":1770097253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03605-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,3]]},"references-count":58,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["3605"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03605-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,3]]},"assertion":[{"value":"10 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest\/Competing interests"}},{"value":"This study did not involve any individual person\u2019s data in a form that requires consent for publication.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"This study presents a computational framework and utilizes solely synthetic data. Therefore, ethical approval from an institutional review board and informed consent to participate were not required.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"HSE University.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Employment"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Financial and Non-financial interests"}}],"article-number":"221"}}