Laplace Approximation For Tensor Train Kernel Machines In System Identification
Not on the map. Why?
Abstract (arXiv)
To address the scalability limitations of Gaussian process (GP) regression, several approximation techniques have been proposed. One such method is based on tensor networks, which utilizes an exponential number of basis functions without incurring exponential computational cost. However, extending this model to a fully probabilistic formulation introduces several design challenges. In particular, for tensor train (TT) models, it is unclear which TT-core should be treated in a Bayesian manner. We introduce a Bayesian tensor train kernel machine that applies Laplace approximation to estimate the posterior distribution over a selected TT-core and employs variational inference (VI) for precision hyperparameters. Experiments show that core selection is largely independent of TT-ranks and feature structure, and that VI replaces cross-validation while offering up to 65x faster training. The method's effectiveness is demonstrated on an inverse dynamics problem.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 19 references that are in the map. First posted on arXiv 2 Dec 2025.
Builds on
7 of 19 references.
References · 7
- 2020Being Bayesian, Even Just a Bit, Fixes Overconfidence in ReLU Networkscited by 227
- 2018When Gaussian Process Meets Big Data: A Review of Scalable GPscited by 205
- 2017Cautious Model Predictive Control using Gaussian Process Regressioncited by 91
- 2014Hilbert Space Methods for Reduced-Rank Gaussian Process Regressioncited by 88
- 2016Variational Fourier features for Gaussian processescited by 85
- 2016Tensor Network alternating linear scheme for MIMO Volterra system identificationcited by 13
- 2023Projecting basis functions with tensor networks for Gaussian process regressioncited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.