Answers are grounded in this paper and cite their sources.
The accurate approximation of multivariate functions is fundamental to high-dimensional data analysis. Among various strategies, tensor-based methods have been widely explored to address the curse of dimensionality for scalable and efficient approximation. While traditional techniques employ either structured tensor-product grid discretization or coefficient tensor factorization, they face two critical limitations: (1) limited adaptability to irregular data structures common in real-world applications and (2) dependence on manually designed basis functions that restrict flexibility and require substantial domain expertise. This paper introduces the Implicit Neural Functional Tensor Train (INFTT), which couples functional tensor–train decomposition with implicit neural representations to obtain continuous, low-rank approximations of multivariate functions. Specifically, instead of manual basis design, we parameterize each univariate core with a SIREN-based implicit network, preserving the chain structure while enabling adaptive, high-fidelity modeling. Our theoretical analysis demonstrates that INFTT inherently embeds low-rank structural priors and Lipschitz continuity, ensuring compact and smooth approximations. Extensive experiments on synthetic and real-world scientific datasets validate the superior accuracy and robustness of the proposed method compared to state-of-the-art approaches for both discretized and continuous representations.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: