{"title":"Multilinear singular value decomposition of a tensor with fibers observed along one mode*","authors":"Stijn Hendrikx, Mikael Sørensen, L. D. Lathauwer","doi":"10.1109/SSP53291.2023.10207967","DOIUrl":null,"url":null,"abstract":"We introduce an algorithm that uses only standard linear algebra operations for computing the multilinear singular value decomposition of an incomplete tensor with fibers observed along a single mode. This setting is very relevant for applications. For example, in an application where the tensor has a \"time\" mode, obtaining a fiber along this mode may be considerably easier than doing so along other modes. In the noise-free case, the algorithm is guaranteed to retrieve the exact solution, if the observed fibers satisfy certain deterministic conditions. As such, the approach reveals an interesting feature of the tensor setting that is not present at the matrix level. In the presence of noise, a solution obtained with this algorithm serves as a good initial point for further optimization. We illustrate, both on synthetic and real-life data, that this initialization strategy is fast and significantly reduces the number of iterations needed by an optimization algorithm. One possible use of the approach is as a linear algebra-based orthogonal compression of an incomplete tensor, after which the low multilinear rank approximation can be used as a \"complete\" proxy of the data for further analysis.","PeriodicalId":296346,"journal":{"name":"2023 IEEE Statistical Signal Processing Workshop (SSP)","volume":"16 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE Statistical Signal Processing Workshop (SSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSP53291.2023.10207967","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We introduce an algorithm that uses only standard linear algebra operations for computing the multilinear singular value decomposition of an incomplete tensor with fibers observed along a single mode. This setting is very relevant for applications. For example, in an application where the tensor has a "time" mode, obtaining a fiber along this mode may be considerably easier than doing so along other modes. In the noise-free case, the algorithm is guaranteed to retrieve the exact solution, if the observed fibers satisfy certain deterministic conditions. As such, the approach reveals an interesting feature of the tensor setting that is not present at the matrix level. In the presence of noise, a solution obtained with this algorithm serves as a good initial point for further optimization. We illustrate, both on synthetic and real-life data, that this initialization strategy is fast and significantly reduces the number of iterations needed by an optimization algorithm. One possible use of the approach is as a linear algebra-based orthogonal compression of an incomplete tensor, after which the low multilinear rank approximation can be used as a "complete" proxy of the data for further analysis.