Efficient computation of higher order cumulant tensors
arXiv:1701.05420 · doi:10.1137/17M1149365
Abstract
In this paper, we introduce a novel algorithm for calculating arbitrary order cumulants of multidimensional data. Since the order cumulant can be presented in the form of an -dimensional tensor, the algorithm is presented using tensor operations. The algorithm provided in the paper takes advantage of super-symmetry of cumulant and moment tensors. We show that the proposed algorithm considerably reduces the computational complexity and the computational memory requirement of cumulant calculation as compared with existing algorithms. For the sizes of interest, the reduction is of the order of compared to the naive algorithm.
arXiv comment22 pages, 6 figures
References in corpus (6)
- Error Estimation for Moments Analysis in Heavy-Ion Collision Experiments
- A unifying framework for -statistics, polykays and their multivariate generalizations
- From Finance to Cosmology: The Copula of Large-Scale Structure
- Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
- High Frequency Dynamics and Third Cumulant of Quantum Noise
- The use of the multi-cumulant tensor analysis for the algorithmic optimisation of investment portfolios
Cited by in corpus (5)
- Experimental extraction of the quantum effective action for a non-equilibrium many-body system
- Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
- Multivariate cumulants in outlier detection for financial data analysis
- Algorithm for an arbitrary-order cumulant tensor calculation in a sliding window of data streams
- Extracting the symmetries of nonequilibrium quantum many-body systems