iFCTN is a folding-free intra-block fully-connected tensor network that uses Khatri-Rao parameterization and a proximal alternating minimization algorithm with proven global convergence to a critical point, outperforming prior tensor completion methods at lower cost.
Nested fully-connected tensor network decomposition for multi-dimensional visual data recovery
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
iFCTN: an intra-block Fully-Connected Tensor Network Decomposition for Tensor Completion
iFCTN is a folding-free intra-block fully-connected tensor network that uses Khatri-Rao parameterization and a proximal alternating minimization algorithm with proven global convergence to a critical point, outperforming prior tensor completion methods at lower cost.