Related papers: Recursive numerical calculus of one-loop tensor in…
In this paper, we develop an iterative sector-level reduction strategy for Feynman integrals, which bases on module intersection in the Baikov representation and auxiliary vector for tensor structure. Using this strategy we have studied the…
We propose a sampling-based method for computing the tensor ring (TR) decomposition of a data tensor. The method uses leverage score sampled alternating least squares to fit the TR cores in an iterative fashion. By taking advantage of the…
Unlike matrix completion, tensor completion does not have an algorithm that is known to achieve the information-theoretic sample complexity rate. This paper develops a new algorithm for the special case of completion for nonnegative…
In general, matrix or tensor-valued functions are approximated using the method developed for vector-valued functions by transforming the matrix-valued function into vector form. This paper proposes a tensor-based interpolation method to…
Motivated by the many potential applications of low-rank multi-way tensor approximations, we set out to count the rank-one tensors that are critical points of the distance function to a general tensor v. As this count depends on v, we…
This work considers the notion of random tensors and reviews some fundamental concepts in statistics when applied to a tensor based data or signal. In several engineering fields such as Communications, Signal Processing, Machine learning,…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
Large corrections to the inflationary tensor power spectrum have been speculated to emerge either as second-order scalar-induced classical effects, or as 1-loop quantum corrections. These two sources are not independent of each other.…
General one-loop integrals with arbitrary mass and kinematical parameters in $d$-dimensional space-time are studied. By using Bernstein theorem, a recursion relation is obtained which connects $(n+1)$-point to $n$-point functions. In…
Formulas are presented for the recursive generation of four-body integrals in which the integrand consists of arbitrary integer powers (>= -1) of all the interparticle distances r_ij, multiplied by an exponential containing an arbitrary…
This paper proposes an efficient algorithm (HOLRR) to handle regression tasks where the outputs have a tensor structure. We formulate the regression problem as the minimization of a least square criterion under a multilinear rank…
Because of the attractiveness of the canonical polyadic (CP) tensor decomposition in various applications, several algorithms have been designed to compute it, but efficient ones are still lacking. Iterative deflation algorithms based on…
We compute the six-dimensional hexagon integral with three non-adjacent external masses analytically. After a simple rescaling, it is given by a function of six dual conformally invariant cross-ratios. The result can be expressed as a sum…
We consider the problem of recovering a low-multilinear-rank tensor from a small amount of linear measurements. We show that the Riemannian gradient algorithm initialized by one step of iterative hard thresholding can reconstruct an…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
This paper concerns the reconstruction of a complex-valued anisotropic tensor $\gamma=\sigma+\i\omega\varepsilon$ from knowledge of several internal magnetic fields $H$, where $H$ satisfies the anisotropic Maxwell system on a bounded domain…
As a key method to deal with loop integrals, Integration-By-Parts (IBP) method can be used to do reduction as well as establish the differential equations for master integrals. However, when talking about tensor reduction, the…