English
Related papers

Related papers: Uniqueness of Nonnegative Tensor Approximations

200 papers

In this article the notion of the nondecreasing (ND) rank of a matrix or tensor is introduced. A tensor has an ND rank of r if it can be represented as a sum of r outer products of vectors, with each vector satisfying a monotonicity…

Machine Learning · Statistics 2025-10-21 Andrew McCormack

Let $N_1, \ldots, N_d$ be positive integers with $N_1\leq\cdots\leq N_d$. Set $N=N_1\cdots N_{d-1}$. We show in this paper that an integer $r$ is a typical nonnegative rank of nonnegative tensors of format $N_1\times\cdots\times N_d$ if and…

Rings and Algebras · Mathematics 2018-01-15 Toshio Sumi , Mitsuhiro Miyazaki , Toshio Sakata

We prove an analog of Perron-Frobenius theorem for multilinear forms with nonnegative coefficients, and more generally, for polynomial maps with nonnegative coefficients. We determine the geometric convergence rate of the power algorithm to…

Spectral Theory · Mathematics 2011-12-30 S. Friedland , S. Gaubert , L. Han

An optimal rank-1 approximation of state transition tensors was developed as an efficient alternative to state transition tensors for nonlinear uncertainty quantification. While previous directional state transition tensors used the…

Systems and Control · Electrical Eng. & Systems 2025-11-11 Grace E. Calkins , Jay W. McMahon , Jackson Kulik

The universal approximation theorem asserts that a single hidden layer neural network approximates continuous functions with any desired precision on compact sets. As an existential result, the universal approximation theorem supports the…

Machine Learning · Computer Science 2023-09-15 Wington L. Vital , Guilherme Vieira , Marcos Eduardo Valle

In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained…

Numerical Analysis · Mathematics 2014-12-12 Shmuel Friedland , Venu Tammali

Let $T$ be a real tensor of (real) rank $r$. $T$ is 'identifiable' when it has a unique decomposition in terms of rank $1$ tensors. There are cases in which the identifiability fails over the complex field, for general tensors of rank $r$.…

Algebraic Geometry · Mathematics 2018-01-23 Elena Angelini , Cristiano Bocci , Luca Chiantini

We address the general problem of estimating the probability that a real symmetric tensor is close to rank-one tensors. Using Weyl's tube formula, we turn this question into a differential geometric one involving the study of metric…

Algebraic Geometry · Mathematics 2024-12-10 Alberto Cazzaniga , Antonio Lerario , Andrea Rosana

For a nonnegative weakly irreducible tensor, its spectral radius is an eigenvalue corresponding to a unique positive eigenvector up to a scalar called the Perron vector. But including the Perron vector, it may have more than one eigenvector…

Combinatorics · Mathematics 2018-05-22 Yi-Zheng Fan , Tao Huang , Yan-Hong Bao

We first prove two new spectral properties for symmetric nonnegative tensors. We prove a maximum property for the largest H-eigenvalue of a symmetric nonnegative tensor, and establish some bounds for this eigenvalue via row sums of that…

Spectral Theory · Mathematics 2012-11-27 Liqun Qi

We first show that the eigenvector of a tensor is well-defined. The differences between the eigenvectors of a tensor and its E-eigenvectors are the eigenvectors on the nonsingular projective variety $\mathbb S=\{\mathbf x\in\mathbb…

Spectral Theory · Mathematics 2015-03-13 Shenglong Hu , Liqun Qi

For tensors of fixed order, we establish three types of upper bounds for the geometric rank in terms of the subrank. Firstly, we prove that, under a mild condition on the characteristic of the base field, the geometric rank of a tensor is…

Combinatorics · Mathematics 2025-06-23 Qiyuan Chen , Ke Ye

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

Functional Analysis · Mathematics 2021-07-26 David Alonso-Gutiérrez , Bernardo González Merino , Rafael Villa

Matrices of rank at most k are defined by the vanishing of polynomials of degree k + 1 in their entries (namely, their (k + 1)-times-(k + 1)-subdeterminants), regardless of the size of the matrix. We prove a qualitative analogue of this…

Algebraic Geometry · Mathematics 2015-01-14 Jan Draisma , Jochen Kuttler

The Perron-Frobenius theorem says that the spectral radius of an irreducible nonnegative tensor is the unique positive eigenvalue corresponding to a positive eigenvector. With this in mind, the purpose of this paper is to find the spectral…

Optimization and Control · Mathematics 2023-07-26 Xueli Bai , Dong-Hui Li , Lei Wu , Jiefeng Xu

We prove that the spectral radius of even order nonnegative irreducible tensors is real geometrically simple. In the case when the order of the tensor is odd, or in the complex field, some conditions are given to guarantee the geometric…

Spectral Theory · Mathematics 2012-03-14 Yuning Yang , Qingzhi Yang

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…

Combinatorics · Mathematics 2025-12-10 Zeev Dvir

For a nonnegative symmetric weakly irreducible tensor, its spectral radius is an eigenvalue corresponding to a unique positive eigenvector up to a scalar called the Perron vector. But including the Perron vector, there may have more than…

Combinatorics · Mathematics 2019-02-15 Yi-Zheng Fan , Yan-Hong Bao , Tao Huang

We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of…

Algebraic Geometry · Mathematics 2026-01-22 Khazhgali Kozhasov , Alan Muniz , Yang Qi , Luca Sodomaco

The universal approximation theorem states that a neural network with one hidden layer can approximate continuous functions on compact sets with any desired precision. This theorem supports using neural networks for various applications,…

Machine Learning · Computer Science 2024-08-13 Marcos Eduardo Valle , Wington L. Vital , Guilherme Vieira