Extensive numerical experiments demonstrate that HRE-PINNs consistently outperform existing state-of-the-art approaches in terms of accuracy and are practically applicable to real-world problems.
Abstract
Recently, tensor-based physics-informed neural networks (T-PINNs) have received increasing attention. However, existing T-PINNs still face a fundamental challenge: they mainly rely on pre-specified low-rank tensor decompositions with manually tuned ranks, which limits their ability to capture the underlying structures of multivariate solution functions and hinders their practical deployment. To address this challenge, we propose a hierarchical rank-evolving (abbreviated as HRE) representation for multivariate functions, which endows us to faithfully capture the underlying structure of the targeted multivariate function accompanying with automatic rank determination. Concretely, in the hierarchical design of HRE representation, the target multivariate function is decomposed as a small-scale inner tensor with a set of univariate functions along each mode, where a customized tensor network decomposition can be readily deployed to capture the underlying structure of the small-scale inner tensor. In HRE representation, the crucial hyperparameters, ranks, can be adaptively revealed during the decomposition, freeing us from manual rank tuning and making HRE practically applicable to real-world problems. Besides, we build the HRE-PINNs correspondingly. Extensive numerical experiments, including high-dimensional static problems (Helmholtz equation and Poisson equation), nonlinear time-dependent problems (Klein-Gordon equation), and complex fluid-dynamics problems (flow mixing equation and Navier-Stokes equation), demonstrate that HRE-PINNs consistently outperform existing state-of-the-art approaches in terms of accuracy.
This work proposes a novel structure-revealing TN paradigm, termed SVD-inspired TN decomposition (SVDinsTN), which enables the formulation of an energy function that simultaneously considers representation error and TN structure complexity, facilitating the joint optimization of data representation and the identificati...
Yu-Bang Zheng, Xi-Le Zhao, Heng-Chao Li et al.· IEEE Transactions on Pattern...· 0 citations
The first pre-trained low-rank tensor decomposition (PLTD) framework is suggested, which organically integrates the pre-trained large vision model into the classical tensor decomposition framework and achieves an unprecedented balance among higher recovery fidelity, fewer learnable parameters, and smaller carbon footpr...
Bingfei Fu, Zhi-Long Han, Ting-Zhu Huang et al.· 0 citations
Tensor Robust Principal Component Analysis (TRPCA) aims to recover low-rank and sparse components from the noisy tensor data, which has attracted significant attention in visual data denoising. However, existing CANDECOMP/PARAFAC (CP) and Tucker decomposition methods fail to fully exploit inter-dimensional correlations...
Chang-Long Li, Ze-Can Yang, Laurence T. Yang et al.· IEEE Transactions on Image P...· 0 citations
TenF-INR is proposed, a novel unsupervised framework that integrates low-rank tensor modeling with INR, where each factor matrix in the tensor decomposition is modeled as a learnable factor function within a low-rank decomposition, reducing the parameter space and computational burden.
Yuan-Yuan Liu, Yuan-Biao Yang, Jing Cheng et al.· IEEE journal of biomedical a...· 1 citation
Low-rank tensor decomposition has attracted growing attention in multivariate data analysis owning to its potentials of capturing latent representations of multivariate data correlating various data attributes. However, existing studies still have limited capabilities to represent the nonlinear relationships within mul...
Yun-Bo Tang, Yuan-Long Yu, Dan Chen et al.· IEEE Transactions on Knowled...· 0 citations
Tensor networks are powerful formats for compressing large-scale data. However, their application to general data processing has been limited by the difficulty of performing nonlinear operations. Here, we introduce iterative tensor network transformations (ITNTs), a general algorithmic framework for the element-wise ev...
Xiao Wang, Tomohiro Hashizume, Pia Siegl et al.· 2 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.