The tensor network representation of high order cumulant and algorithm for their calculation

نویسندگان

  • Krzysztof Domino
  • Piotr Gawron
  • Lukasz Pawela
چکیده

In this paper we introduce a novel algorithm of calculating arbitrary order cumulants of multidimensional data. Since the n order cumulant can be presented in the form of an n-dimensional tensor, the algorithm is presented using the tensor network notation. The presented algorithm exploits the super–symmetry of cumulant and moment tensors. We show, that proposed algorithm highly decreases the computational complexity of cumulants calculation, compared to the naïve algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neuron Mathematical Model Representation of Neural Tensor Network for RDF Knowledge Base Completion

In this paper, a state-of-the-art neuron mathematical model of neural tensor network (NTN) is proposed to RDF knowledge base completion problem. One of the difficulties with the parameter of the network is that representation of its neuron mathematical model is not possible. For this reason, a new representation of this network is suggested that solves this difficulty. In the representation, th...

متن کامل

Nordsieck representation of high order predictor-corrector Obreshkov methods and their implementation

Predictor-corrector (PC) methods for the numerical solution of stiff ODEs can be extended to include the second derivative of the solution. In this paper, we consider second derivative PC methods with the three-step second derivative Adams-Bashforth as predictor and two-step second derivative Adams-Moulton as corrector which both methods have order six. Implementation of the proposed PC method ...

متن کامل

Hiding higher order cross-correlations of multivariate data using Archimedean copulas

In this paper we present the algorithm that changes the subset of marginals of multivariate normal distributed data into such modelled by an Archimedean copula. Proposed algorithm leaves a correlation matrix almost unchanged, but introduces a higher order crosscorrelation measured by high order multivariate cumulant tensors. Given the algorithm, we analyse the ability of cumulants based feature...

متن کامل

A Randomized Tensor Train Singular Value Decomposition

The hierarchical SVD provides a quasi-best low rank approximation of high dimensional data in the hierarchical Tucker framework. Similar to the SVD for matrices, it provides a fundamental but expensive tool for tensor computations. In the present work we examine generalizations of randomized matrix decomposition methods to higher order tensors in the framework of the hierarchical tensors repres...

متن کامل

Sampling from social networks’s graph based on topological properties and bee colony algorithm

In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1701.05420  شماره 

صفحات  -

تاریخ انتشار 2017