Abstract
Tensor train is one of the modern decompositions used as low-rank tensor approximations of multidimensional arrays. If the original data is nonnegative we sometimes want the approximant to keep this property. In this work new methods for nonnegative tensor train factorization are proposed. Low-rank approximation approach helps to speed up the computations whereas DMRG technique allows to adapt nonnegative TT ranks for better accuracy. The performance analysis of the proposed algorithms as well as comparison with other nonnegative TT factorization method are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
