mlsanityData to 14 Oct 2026

Adaptive Subspace Modeling With Functional Tucker Decomposition

arXiv 2603.25530 ↗First posted 26 Mar 2026stat.ML cs.NA math.NAcited by 0

Not on the map. Why?

Abstract (arXiv)

Tensors provide a structured representation for multidimensional data, yet discretization discards the underlying continuous structure when the data originate from continuous processes. We address this limitation by introducing a functional Tucker decomposition (FTD) that embeds a mode-wise continuity constraint directly into the factorization. The FTD models the continuous mode as a function in a reproducing kernel Hilbert space (RKHS), avoiding a prespecified basis while preserving the multilinear subspace structure of the Tucker model. We derive a reconstruction error bound for the continuous mode that quantifies the approximation quality when a subspace estimated on one domain is reused on another. This bound provides theoretical justification for subspace transfer, whose practical value we demonstrate on cross-domain classification tasks in hyperspectral imaging and multivariate time-series analysis.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 25 references that are in the map. First posted on arXiv 26 Mar 2026.

Builds on

5 of 25 references.

References · 5

  1. 2021Measuring the Ripeness of Fruit with Hyperspectral Imaging and Deep Learningcited by 12
  2. 2021Guaranteed Functional Tensor Singular Value Decompositioncited by 10
  3. 2024Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Datacited by 5
  4. 2024Tensor Decomposition with Unaligned Observationscited by 1
  5. 2025Smooth tensor decomposition with application to ambulatory blood pressure monitoring datacited by 1

Built on by

Not cited yet.