Related papers: An Introduction to the Deviatoric Tensor Decomposi…

We describe a simple, black-box compression format for tensors with a multiscale structure. By representing the tensor as a sum of compressed tensors defined on increasingly coarse grids, we capture low-rank structures on each grid-scale,…

Turbulent flows are chaotic and multi-scale dynamical systems, which have large numbers of degrees of freedom. Turbulent flows, however, can be modelled with a smaller number of degrees of freedom when using the appropriate coordinate…

We show how well known tools of algebraic geometry for the study of finite sets can be fruitfully applied to the study of Waring decompositions of symmetric tensors (forms). We mainly focus on the uniqueness of a given decomposition (the…

The CANDECOMP/PARAFAC (CP) tensor decomposition is a popular dimensionality-reduction method for multiway data. Dimensionality reduction is often sought after since many high-dimensional tensors have low intrinsic rank relative to the…

Octupolar order is described in two space dimensions in terms of the maxima (and conjugated minima) of the probability density associated with a third-rank, fully symmetric and traceless tensor. Such a representation is shown to be…

The accurate approximation of high-dimensional functions is an essential task in uncertainty quantification and many other fields. We propose a new function approximation scheme based on a spectral extension of the tensor-train (TT)…

The concept of symmetry breaking has been a propelling force in understanding phases of matter. While rotational symmetry breaking is one of the most prevalent examples, the rich landscape of orientational orders breaking the rotational…

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…

Conjugate partial-symmetric (CPS) tensors are the high-order generalization of Hermitian matrices. As the role played by Hermitian matrices in matrix theory and quadratic optimization, CPS tensors have shown growing interest recently in…

Canonical Polyadic Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. We give an overview of existing results concerning uniqueness. We present new, relaxed, conditions that guarantee…

Canonical Polyadic Decomposition (CPD) represents a third-order tensor as the minimal sum of rank-1 terms. Because of its uniqueness properties the CPD has found many concrete applications in telecommunication, array processing, machine…

We propose a new algorithm for tensor decomposition, based on Jennrich's algorithm, and apply our new algorithmic ideas to blind deconvolution and Gaussian mixture models. Our first contribution is a simple and efficient algorithm to…

Canonical Polyadic (also known as Candecomp/Parafac) Decomposition (CPD) of a higher-order tensor is decomposition in a minimal number of rank-1 tensors. In Part I, we gave an overview of existing results concerning uniqueness and presented…

Feature extraction for tensor data serves as an important step in many tasks such as anomaly detection, process monitoring, image classification, and quality control. Although many methods have been proposed for tensor feature extraction,…

Tensor decomposition of high-dimensional data often struggles to capture semantically or physically meaningful structures, particularly when relying on reconstruction objectives and fixed-rank constraints. We introduce a no-rank tensor…

We present a comprehensive construction of scalar, vector and tensor harmonics on maximally symmetric three-dimensional spaces. Our formalism relies on the introduction of spin-weighted spherical harmonics and a generalized helicity basis…

We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only…

Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…

Tensors in the form of multilinear arrays are ubiquitous in data science applications. Captured real-world data, including video, hyperspectral images, and discretized physical systems, naturally occur as tensors and often come with…

Whether for fundamental studies or nuclear data evaluations, first-principle calculations of atomic nuclei constitute the path forward. Today, performing \textit{ab initio} calculations (a) of heavy nuclei, (b) of doubly open-shell nuclei…