Accelerated Learning of High Dimensional Functions with a Tensor-Featured Training Network
Not on the map. Why?
Abstract (arXiv)
In this work we present a method to accelerate the optimization of learning high dimensional functions using deep neural network (DNN). This optimization procedure introduces contextual features into the first layer of a DNN. The parameters of DNN are optimized via standard gradient descent while keeping the input-feature basis fixed. After optimization of the DNN parameters, the feature layer is provided a chance to update and change before DNN optimization resumes. The feature layer has two types of functions: those that can be evaluated quickly in a matrix-free way on the domain (i.e. rank-1 features) and more complex features that must first be decomposed using tensor network (TN) decomposition strategies (tensor features). In particular, we study the effect of adding features which distill pretrained DNN into TNs using a discretize and decompose strategy. To efficiently decompose high-dimensional functions constructed from discretized DNN, we leverage a randomized tensor decomposition strategy. Using randomization, we are able to reduce the storage cost of decomposing high dimensional functions by at least 8 orders of magnitude. Using this approach, we are able to efficiently train models between 5 and 40 dimensions.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 24 references that are in the map. First posted on arXiv 11 Aug 2026.
Builds on
8 of 24 references.
References · 8
- 2014Sketching as a Tool for Numerical Linear Algebracited by 288
- 2023Tackling the Curse of Dimensionality with Physics-Informed Neural Networkscited by 79
- 2018Fashionable Modelling with Fluxcited by 53
- 2024Unveiling the optimization process of Physics Informed Neural Networks: How accurate and competitive can PINNs be?cited by 31
- 2021Solving high-dimensional parabolic PDEs using the tensor train formatcited by 17
- 2024Solving Partial Differential Equations with Random Feature Modelscited by 6
- 2024Tensor Network-Constrained Kernel Machines as Gaussian Processescited by 3
- 2025Tensor Gaussian Processes: Efficient Solvers for Nonlinear PDEscited by 1
Built on by
Not cited yet.