Skip to content

Variational Inference and Density Estimation with Non-negative Tensor Train

Jul 2026 · SIAM Journal on Scientific Computing · Vol 48, pp. 2002- · 0 citations · 20 references
Computer Science

TL;DR

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 is observed.

Abstract

Abstract. This work proposes an efficient numerical approach for compressing a high-dimensional discrete distribution function into a non-negative tensor train (NTT) format. The two settings we consider are variational inference and density estimation, whereby one has access to either the unnormalized analytic formula of the distribution or the samples generated from the distribution. In particular, the compression is done through a two-stage approach. In the first stage, we use existing subroutines to encode the distribution function in a tensor train format. In the second stage, we use an NTT ansatz to fit the obtained tensor train. For the NTT fitting procedure, we use a log barrier term to ensure the positivity of each tensor component and then utilize a second-order alternating minimization scheme to accelerate convergence. In practice, we observe that the proposed NTT fitting procedure exhibits drastically faster convergence than an alternative multiplicative update method that has been previously proposed. Through challenging numerical experiments, we show that our approach can accurately compress target distribution functions. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and Data Available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/Xun-Tang123/Non_Negative_Tensor_Train and in the supplementary materials ( Non_Negative_Tensor_Train-main.zip [51.4MB]), linked from the main article webpage. [Formula: see text]

View source

Similar papers

Preprint Aug 2026

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

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.

Karl Pierce, Y. Khoo, Haizhao Yang · 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 Jul 2026

Tensor Train Diffusion: Leveraging Low-Rank Structures for High-Dimensional Score-Based Sampling

This work introduces a novel and efficient solver for the underlying HJB equation based on the functional tensor train (FTT) format, which leverages latent low-rank structures to efficiently approximate high-dimensional functions, enabling both model compression and rapid computation.

Robert Gruhlke, Julius Berner, David Sommer et al. · 0 citations
Open access Dec 2024

Randomized Algorithms for Streaming Low‐Rank Approximation in Tree Tensor Network Format

This work presents the tree tensor network Nyström (TTNN), an algorithm that extends recent research on streamable tensor approximation to the more general tree tensor network format, enabling a unified treatment of various existing methods.

Alberto Bucci, Gianfranco Verzella · 3 citations
Preprint Aug 2026

Structured Tensor Approximation from Lateral Slice Sampling via Basis and Manifold Priors

This work provides a theoretical analysis which establishes a non-asymptotic reconstruction error bound that characterizes the effects of sampling complexity, optimization convergence, and model mismatch in a structured tensor approximation problem.

Jeongmin Chae, Usama Saleem, Selin Bac et al. · 0 citations
Preprint Jul 2026

Tensor-Based Reduced-Order Modeling for Optimization-Based Inverse Problems

We develop a tensor reduced-order modeling (TROM) framework for optimization-based inverse problems governed by parameter-dependent dynamical systems. The approach approximates the parameter-to-observation map directly in tensor-train format, using either TT-SVD or TT-Cross compression, and integrates the resulting rep...

S. Islam, Andreas Mang, Maxim A. Olshanskii · 1 citation

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