This work provides a theoretical analysis which establishes a non-asymptotic reconstruction error bound that characterizes the effects of sampling complexity, optimization convergence, and model mismatch in a structured tensor approximation problem.
Abstract
In this work, we consider a structured tensor approximation problem, where only a limited number of lateral slices are observed. The proposed algorithm , called Basis and Manifold prior Tensor Approximation (BMTA), exploits both global and local structures of the evolution of a global tensor. Specifically, BMTA integrates two signal models: (i) a quasi-basis model that captures smooth global variations along a physical trajectory, and (ii) a manifold-guided interpolation model that characterizes local relationships among tensor slices. A low-rank Tucker reconstruction framework is incorporated to efficiently capture the priors, resulting in coefficients for basis function estimation and a tensor optimization. In addition, we provide a theoretical analysis which establishes a non-asymptotic reconstruction error bound that characterizes the effects of sampling complexity, optimization convergence, and model mismatch. Numerical experiments are performed on both synthetic and real-world datasets, including quantum chemistry and spatiotemporal sensing applications.
An efficient numerical approach for compressing a high-dimensional discrete distribution function into a non-negative tensor train (NTT) format and observing that the proposed NTT fitting procedure exhibits drastically faster convergence than an alternative multiplicative update method that has been previously proposed is observed.
Xun Tang, Rajat Vadiraj Dwaraknath, Le-Xing Ying· SIAM Journal on Scientific C...· 0 citations
A nonconvex model combined with nonlocal self-similarity and tensor dictionary learning for robust tensor completion is proposed and outperforms the competing state-of-the-art methods in both visual quality and quantitative metrics.
Hongyue Sun, Duo Qiu, Jiahui Zhao· Mathematics· 0 citations
This paper proposes a novel Tensor Train (TT)-based tensor-on-tensor regression optimization framework for variable selection based on mode-1 hyperslice sparsity, and designs an alternating iterative algorithm equipped with a preconditioned metric to efficiently solve the proposed model.
A robust tensor recovery model based on second-order difference-induced adaptive tensor nuclear norm regularization that consistently improves PSNR and ERGAS under all tested noise settings while achieving competitive SSIM values is proposed.
This paper presents a convergence analysis for a newly developed nonlinear model reduction method: parametric probabilistic manifold decomposition (PPMD)~\cite{guo2026parametric}. In addition, existing analyzes of nonlinear reduced order models typically treat subspace reduction, manifold representation, regression, and nonlinear reconstruction as separate components and often remain at the level of discrete state vectors. To the best of our knowledge, no theory tracks the complete error propagation in a data-dependent model whose basis, residual geometry, spectral coordinates, parameter maps, and lifting operator are all learned from the same numerical solution data. We develop a coupled perturbation analysis for the entire PPMD procedure. A trajectory geometry induced by the spatial discretization and temporal quadrature connects discrete trajectory vectors isometrically with the corresponding PDE norm. Population spectral objects are introduced to align the empirical residual coordinates and derive a uniform coordinate error estimate, whose propagation through the Hilbert-valued kernel lifting estimator is then quantified. Combining these results with the full order discretization error, weighted low-rank approximation, parameter regression, and residual representation defect yields deterministic and high-probability trajectory error bounds and consistency in probability in the continuous PDE trajectory space. The theory identifies how the principal errors interact and which components limit the accuracy of the nonlinear reduced order model.
