Related papers: Note on the Construction of Structure Tensor
Despite their simple intuition, convolutions are more tedious to analyze than dense layers, which complicates the transfer of theoretical and algorithmic ideas to convolutions. We simplify convolutions by viewing them as tensor networks…
Robust tensor CP decomposition involves decomposing a tensor into low rank and sparse components. We propose a novel non-convex iterative algorithm with guaranteed recovery. It alternates between low-rank CP decomposition through gradient…
Tensor-polarized structure functions of a spin-1 hadron are additional observables which do not exist for the spin-1/2 nucleon. They could probe novel aspects of the internal hadron structure. Twist-2 tensor-polarized structure functions…
High-dimensional data arise naturally in many areas of science and engineering, including machine learning, signal processing, computational physics, and statistics. Such data are often represented as tensors, multi-dimensional…
Information is extracted from large and sparse data sets organized as 3-mode tensors. Two methods are described, based on best rank-(2,2,2) and rank-(2,2,1) approximation of the tensor. The first method can be considered as a generalization…
Second-order (maximally) conformally superintegrable systems play an important role as models of mechanical systems, including systems such as the Kepler-Coulomb system and the isotropic harmonic oscillator. The present paper is dedicated…
High-dimensional tensor-valued predictors arise in modern applications, increasingly as learned representations from neural networks. Existing tensor classification methods rely on sparsity or Tucker structures and often lack theoretical…
We discuss structured Schatten norms for tensor decomposition that includes two recently proposed norms ("overlapped" and "latent") for convex-optimization-based tensor decomposition, and connect tensor decomposition with wider literature…
DeepTensor is a computationally efficient framework for low-rank decomposition of matrices and tensors using deep generative networks. We decompose a tensor as the product of low-rank tensor factors (e.g., a matrix as the outer product of…
The validity of two approximative linear tensor models to be used for grating based X-ray or neutron dark-field tensor tomography is investigated in a simulation study. While the dark-field contrast originating from anisotropic microscopic…
We show how to construct nonnegative low-rank approximations of nonnegative tensors in Tucker and tensor train formats. We use alternating projections between the nonnegative orthant and the set of low-rank tensors, using STHOSVD and TTSVD…
We adopt a new perspective on the tensor product of arbitrary semi-lattices. Our basic construction exploits a description of semi-lattices in terms of bi-extensional Chu spaces associated to a target space defined to be the boolean domain.…
Truss optimization is a rich research field receiving renewed interest in limiting the carbon emissions of construction. However, a persistent challenge has been to construct highly optimized and often complex designs. This contribution…
Almost Finsler manifolds and partial Finsler manifolds are introduced, extending the standard definition of a Finsler manifold to allow for a nontrivial slit containing points fixed under homogeneous scaling and for metrics where the…
This study investigates the theoretical and computational aspects of quaternion generalized inverses, focusing on outer inverses and {1,2}-inverses with prescribed range and/or null space constraints. In view of the non-commutative nature…
Wide neural networks with random weights and biases are Gaussian processes, as originally observed by Neal (1995) and more recently by Lee et al. (2018) and Matthews et al. (2018) for deep fully-connected networks, as well as by Novak et…
Tensor decomposition is a popular technique for tensor completion, However most of the existing methods are based on linear or shallow model, when the data tensor becomes large and the observation data is very small, it is prone to over…
We give an introduction to (pseudo-)Finsler geometry and its connections. For most results we provide short and self contained proofs. Our study of the Berwald non-linear connection is framed into the theory of connections over general…
Building blocks containing strongly coupled posts offer new possibilities for advanced coaxial (comb-line) filter designs. Equivalent circuits based on the individual resonances of the posts cannot be used to reliably describe the behavior…
The concept of double nonnegativity of matrices is generalized to doubly nonnegative tensors by means of the nonnegativity of all entries and $H$-eigenvalues. This generalization is defined for tensors of any order (even or odd), while it…