English

High-Resolution Tensor-Network Fourier Methods for Exponentially Compressed Non-Gaussian Aggregate Distributions

Machine Learning 2026-03-25 v1 Machine Learning Numerical Analysis Numerical Analysis Quantum Physics

Abstract

Characteristic functions of weighted sums of independent random variables exhibit low-rank structure in the quantized tensor train (QTT) representation, also known as matrix product states (MPS), enabling up to exponential compression of their fully non-Gaussian probability distributions. Under variable independence, the global characteristic function factorizes into local terms. Its low-rank QTT structure arises from intrinsic spectral smoothness in continuous models, or from spectral energy concentration as the number of components DD grows in discrete models. We demonstrate this on weighted sums of Bernoulli and lognormal random variables. In the former, despite an adversarial, incompressible small-DD regime, the characteristic function undergoes a sharp bond-dimension collapse for D300D \gtrsim 300 components, enabling polylogarithmic time and memory scaling. In the latter, the approach reaches high-resolution discretizations of N=230N = 2^{30} frequency modes on standard hardware, far beyond the N=224N = 2^{24} ceiling of dense implementations. These compressed representations enable efficient computation of Value at Risk (VaR) and Expected Shortfall (ES), supporting applications in quantitative finance and beyond.

Keywords

Cite

@article{arxiv.2603.23106,
  title  = {High-Resolution Tensor-Network Fourier Methods for Exponentially Compressed Non-Gaussian Aggregate Distributions},
  author = {Juan José Rodríguez-Aldavero and Juan José García-Ripoll},
  journal= {arXiv preprint arXiv:2603.23106},
  year   = {2026}
}

Comments

22 pages, 13 figures

R2 v1 2026-07-01T11:35:18.267Z