Skip to content
Preprint

Accelerated Learning of High Dimensional Functions with a Tensor-Featured Training Network

Aug 2026 · 0 citations · 24 references
Computer Science

TL;DR

This work presents a method to accelerate the optimization of learning high dimensional functions using deep neural network (DNN), and studies the effect of adding features which distill pretrained DNN into TNs using a discretize and decompose strategy.

Abstract

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.

View source

Similar papers

Jul 2026

Variational Inference and Density Estimation with Non-negative Tensor Train

An efficient numerical approach for compressing a high-dimensional discrete distribution function into a non-negative tensor train (NTT) format and observing that the proposed NTT fitting procedure exhibits drastically faster convergence than an alternative multiplicative update method that has been previously proposed...

Xun Tang, Rajat Vadiraj Dwaraknath, Le-Xing Ying · 0 citations
Conference Jul 2026

DATT: Dimension-Augmented Tensor-Train Decomposition for Neural Network Compression

Traditional model reduction techniques for neural network compression usually leverage existing matrix/tensor decomposition methods to explore the redundancy among model parameters, which may overlook the local structures of the models. In this work, we propose a novel low-rank approximation algorithm, called Dimension...

Yu-Chuan Tai, Cheng-Yu Sie, Che-Rung Lee · 0 citations
Preprint Jul 2026

Hyperparameter Transfer in Graph Neural Networks

A transfer parameterization is developed and validated for GNNs trained with SGD, Adam, and AdamW that yields stable feature updates, learning rate transfer, and improved performance as width and depth increase, and provides a practical recipe for scaling GNNs across a variety of learning tasks and training scenarios.

G. Dezoort, Boris Hanin · 0 citations
Open access Aug 2026

STOD: Sparse Tensor Train Optimization via Orthogonal Decomposition for High-Dimensional Learning

This paper proposes a novel Tensor Train (TT)-based tensor-on-tensor regression optimization framework for variable selection based on mode-1 hyperslice sparsity, and designs an alternating iterative algorithm equipped with a preconditioned metric to efficiently solve the proposed model.

Xiao-Yu Li, Zi-Yan Luo · 0 citations
Preprint Aug 2026

Tensor Network Kernel Machines: A JAX Framework for Machine Learning and Nonlinear System Identification

Developing nonlinear models that are both expressive and computationally efficient remains a challenge in machine learning and nonlinear system identification. Tensor network kernel machines (TNKM) address this challenge by combining nonlinear feature representations with compact low-rank tensor-network parameterizatio...

Albert Saiapin, Kim Batselier · 0 citations
#artificial intelligence Preprint Aug 2026

Iterative tensor network transformations for element-wise evaluation of elementary and filtering functions

Tensor networks are powerful formats for compressing large-scale data. However, their application to general data processing has been limited by the difficulty of performing nonlinear operations. Here, we introduce iterative tensor network transformations (ITNTs), a general algorithmic framework for the element-wise ev...

Xiao Wang, Tomohiro Hashizume, Pia Siegl et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.