Related papers: Decomposing Tensor Spaces via Path Signatures
The signature of a rectifiable path is a tensor series in the tensor algebra whose coefficients are definite iterated integrals of the path. The signature characterises the path up to a generalised form of reparametrisation. It is a…
The signature of a path is an essential object in the theory of rough paths. The signature representation of the data stream can recover standard statistics, e.g. the moments of the data stream. The classification of random walks indicates…
Sequential and temporal data arise in many fields of research, such as quantitative finance, medicine, or computer vision. A novel approach for sequential learning, called the signature method and rooted in rough path theory, is considered.…
Tensors play a pivotal role in the realms of science and engineering, particularly in the realms of data analysis, machine learning, and computational mathematics. The process of unfolding a tensor into matrices, commonly known as tensor…
A tensor space is a vector space equipped with a finite collection of multi-linear forms. In recent years, a rich theory of infinite dimensional tensor spaces has emerged. In this note, we show that a large class of permutation groups can…
A tensor is a multi-way array that can represent, in addition to a data set, the expression of a joint law or a multivariate function. As such it contains the description of the interactions between the variables corresponding to each of…
We provide an introduction to the topic of path signatures as means of feature extraction for machine learning from data streams. The article stresses the mathematical theory underlying the signature methodology, highlighting the conceptual…
Irregularities in the metric tensor of a signature-changing space-time suggest that field equations on such space-times might be regarded as distributional. We review the formalism of tensor distributions on differentiable manifolds, and…
Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…
Tensors are a fundamental data structure for many scientific contexts, such as time series analysis, materials science, and physics, among many others. Improving our ability to produce and handle tensors is essential to efficiently address…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
Third-order tensors are widely used as a mathematical tool for modeling physical properties of media in solid state physics. In most cases, they arise as constitutive tensors of proportionality between basic physics quantities. The…
The signature of a path, introduced by K.T. Chen [5] in $1954$, has been extensively studied in recent years. The $2010$ paper [12] of Hambly and Lyons showed that the signature is injective on the space of continuous finite-variation paths…
A symmetric tensor of small rank decomposes into a configuration of only few vectors. We study the variety of tensors for which this configuration is a unit norm tight frame.
A tensor network is a type of decomposition used to express and approximate large arrays of data. A given data-set, quantum state or higher dimensional multi-linear map is factored and approximated by a composition of smaller multi-linear…
The aim of this article is to provide a simple sampling procedure to reconstruct any monotone path from its signature. For every N, we sample a lattice path of N steps with weights given by the coefficient of the corresponding word in the…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
We introduce the notions of tree-like path and tree-like equivalence between paths and prove that the latter is an equivalence relation for paths of finite length. We show that the equivalence classes form a group with some similarity to a…
The aim of this article is to develop an explicit procedure that enables one to reconstruct any $C^1$ path (at natural parametrization) from its signature. We also explicitly quantify the distance between the reconstructed path and the…
We introduce a class of operators associated with the signature of a smooth path $X$ with values in a $C^{\star}$ algebra $\mathcal{A}$. These operators serve as the basis of Taylor expansions of solutions to controlled differential…