Reparameterized Tensor Ring Functional Decomposition for Multi-Dimensional Data Recovery
Not on the map. Why?
Abstract (arXiv)
Tensor Ring (TR) decomposition is a powerful tool for high-order data modeling, but is inherently restricted to discrete forms defined on fixed meshgrids. In this work, we propose a TR functional decomposition for both meshgrid and non-meshgrid data, where factors are parameterized by Implicit Neural Representations (INRs). However, optimizing this continuous framework to capture fine-scale details is intrinsically difficult. Through a frequency-domain analysis, we demonstrate that the spectral structure of TR factors determines the frequency composition of the reconstructed tensor and limits the high-frequency modeling capacity. To mitigate this, we propose a reparameterized TR functional decomposition, in which each TR factor is a structured combination of a learnable latent tensor and a fixed basis. This reparameterization is theoretically shown to improve the training dynamics of TR factor learning. We further derive a principled initialization scheme for the fixed basis and prove the Lipschitz continuity of our proposed model. Extensive experiments on image inpainting, denoising, super-resolution, and point cloud recovery demonstrate that our method achieves consistently superior performance over existing approaches. Code is available at https://github.com/YangyangXu2002/RepTRFD.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 47 references that are in the map. First posted on arXiv 1 Mar 2026.
Builds on
23 of 47 references.
References · 23
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
- 2018On the Spectral Bias of Neural Networkscited by 1,321
- 2016Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networkscited by 541
- 2021RepVGG: Making VGG-style ConvNets Great Againcited by 520
- 2023WIRE: Wavelet Implicit Neural Representationscited by 220
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2021Beyond Periodicity: Towards a Unifying Framework for Activations in Coordinate-MLPscited by 134
- 2016Tensor Ring Decompositioncited by 125
- 2018Tensor Robust Principal Component Analysis with A New Tensor Nuclear Normcited by 110
- 2023FINER: Flexible spectral-bias tuning in Implicit NEural Representation by Variable-periodic Activation Functionscited by 77
11 more
- 2017Hyperspectral Image Restoration via Total Variation Regularized Low-rank Tensor Decompositioncited by 61
- 2017Efficient Low Rank Tensor Ring Completioncited by 45
- 2022Low-Rank Tensor Function Representation for Multi-Dimensional Data Recoverycited by 45
- 2018Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completioncited by 42
- 2024Improved Implicit Neural Representation with Fourier Reparameterized Trainingcited by 36
- 2022DeepTensor: Low-Rank Tensor Decomposition with Deep Network Priorscited by 15
- 2024Revisiting Nonlocal Self-Similarity from Continuous Representationcited by 14
- 2022Noisy Tensor Completion via Low-rank Tensor Ringcited by 13
- 2024Inductive Gradient Adjustment For Spectral Bias In Implicit Neural Representationscited by 8
- 2024NeurTV: Total Variation on the Neural Domaincited by 7
- 2025F-INR: Functional Tensor Decomposition for Implicit Neural Representationscited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.