Related papers: Recursive numerical calculus of one-loop tensor in…
In the framework of tensor spaces, we consider orthogonalization kernels to generate an orthogonal basis of a tensor subspace from a set of linearly independent tensors. In particular, we experimentally study the loss of orthogonality of…
We present classical and quantum algorithms based on spectral methods for a problem in tensor principal component analysis. The quantum algorithm achieves a quartic speedup while using exponentially smaller space than the fastest classical…
We present a new algorithm for recovering paths from their third-order signature tensors, an inverse problem in rough analysis. Our algorithm provides the exact solution to this learning problem and improves upon current approaches by an…
It is well known that forward limits of tree-level amplitudes (and those trivalent diagrams they consist of) produce one-loop amplitudes and trivalent diagrams with propagators linear in the loop momentum. They naturally arise from one-loop…
This paper is concerned with the approximation of tensors using tree-based tensor formats, which are tensor networks whose graphs are dimension partition trees. We consider Hilbert tensor spaces of multivariate functions defined on a…
We introduce a novel construction of a contour deformation within the framework of Loop-Tree Duality for the numerical computation of loop integrals featuring threshold singularities in momentum space. The functional form of our contour…
For a given symmetric tensor, we aim at finding a new one whose symmetric rank is small and that is close to the given one. There exist linear relations among the entries of low rank symmetric tensors. Such linear relations can be expressed…
Unlike the matrix case, computing low-rank approximations of tensors is NP-hard and numerically ill-posed in general. Even the best rank-1 approximation of a tensor is NP-hard. In this paper, we use convex optimization to develop…
We present an incremental, scalable and efficient dimension reduction technique for tensors that is based on sparse random linear coding. Data is stored in a compactified representation with fixed size, which makes memory requirements low…
In this paper, we propose an algorithm for the construction of low-rank approximations of the inverse of an operator given in low-rank tensor format. The construction relies on an updated greedy algorithm for the minimization of a suitable…
We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
Representations are derived for the basic scalar one-loop vertex Feynman integrals as meromorphic functions of the space-time dimension $d$ in terms of (generalized) hypergeometric functions $_2F_1$ and $F_1$. Values at asymptotic or…
We present a comprehensive analysis of an algorithm for evaluating high-dimensional polynomials that are invariant under permutations and rotations. The key bottleneck is the contraction of a high-dimensional symmetric and sparse tensor…
One-loop amplitudes may be expanded in a basis of scalar integrals multiplied by rational coefficients. We relate the coefficient of the one-point integral to the coefficients of higher-point integrals, by considering the effects of…
Small-scale scalar perturbations amplified during inflation can induce primordial gravitational waves through tensor-scalar interactions. A long-standing controversial issue is whether the one-loop corrections to tensor perturbations exist…
A fully tensorial theoretical framework for hypercomplex-valued neural networks is presented. The proposed approach enables neural network architectures to operate on data defined over arbitrary finite-dimensional algebras. The central…
A set of recurrence relations for on-shell two-loop self-energy diagrams with one mass is presented, which allows to reduce the diagrams with arbitrary indices (powers of scalar propagators) to a set of the master integrals. The SHELL2…
In this proceeding we consider QCD radiative corrections to the production of colourless high-mass systems in hadron collisions. At small transverse momentum the logarithmically-enhanced contributions can be organized to all perturbative…
We obtain a prediction for the hadron-collider event-shape variable transverse thrust in which the terms enhanced in the dijet limit are resummed to next-to-next-to-leading logarithmic accuracy. Our method exploits universality properties…