New currents derived from Killing-Yano tensors for gravity.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
New characterization of Osserman tensors using Jacobi-orthogonality.
In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a biased random way, only of the possible elements while s…
New expressions for Nijenhuis tensor squares found.
New method tackles non-smooth tensor data for better recovery.
The paper defines minimal norm tensors for curvature and divergence tensors, explaining Weyl and Cotten tensors.
New tensors help solve magnetic flow integrability.
New stability and isolation results for Einstein manifolds.
In all dimensions and arbitrary signature, we demonstrate the existence of a new local potential -- a double (2,3)-form -- for the Weyl curvature tensor, and more generally for all tensors with the symmetry properties of the Weyl curvature tensor. The classical four-dimensional Lanczos potential for a Weyl tensor -- a …
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 they are not presented this way, can be viewed as spectral methods on matrices bui…
Paper proposes a new method for exact recovery in robust tensor principal component analysis.
Tensor networks improve anomaly detection at LHC for new physics.
In this paper, we consider the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is based on the recently proposed tensor-tensor product (or t-product). Induced by the t-product, we first rigorously deduce the tensor sp…
This work studies the Tensor Robust Principal Component Analysis (TRPCA) problem, which aims to exactly recover the low-rank and sparse components from their sum. Our model is motivated by the recently proposed linear transforms based tensor-tensor product and tensor SVD. We define a new transforms depended tensor rank…
New algorithm for nonnegative tensor completion with linear convergence rate.
A new tree method for tensor data improves regression accuracy.
The present study initially identified the generalized symmetric connections typed, which can be regarded as more generalised forms of quarter and semi-symmetric connections. The quarter and semi-symmetric connections are obtained respectively particularly when and are taken into con…
In Lorentzian manifolds of any dimension the concept of causal tensors is introduced. Causal tensors have positivity properties analogous to the so-called ``dominant energy condition''. Further, it is shown how to build, from ANY given tensor , a new tensor quadratic in and ``positive'', in the sense that it is …
New proof shows gradient Ricci solitons with harmonic Weyl tensor have at most three eigenvalues.
Defines a new tensor related to special geometric spaces.
Derdzinski and Shen's theorem on the restrictions posed by a Codazzi tensor on the Riemann tensor holds more generally when a Riemann-compatible tensor exists. Several properties are shown to remain valid in this broader setting. Riemann compatibility is equivalent to the Bianchi identity of the new "Codazzi deviation …
A new kernel improves tensor classification accuracy and reduces computation time.
New method estimates tensors from noisy data with missing entries.
Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), NonnegativeMatrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (Smo…
New model improves portfolio selection by analyzing tensor data.
Proposes a new nonlocal curvature tensor concept.
Recently, the \textit{Tensor Nuclear Norm~(TNN)} regularization based on t-SVD has been widely used in various low tubal-rank tensor recovery tasks. However, these models usually require smooth change of data along the third dimension to ensure their low rank structures. In this paper, we propose a new definition of da…
New method for multiway clustering of 3rd order tensors.
Maxwell meets Korn: A New Coercive Inequality for Tensor Fields with Square-Integrable Exterior Derivative
New algorithm for tensor decomposition and Gaussian mixture models.
We extend a classical result by Derdzinski and Shen, on the restrictions imposed on the Riemann tensor by the existence of a nontrivial Codazzi tensor. The new conditions of the theorem include Codazzi tensors (i.e. closed 1-forms) as well as tensors with gauged Codazzi condition (i.e. "recurrent 1-forms"), typical of …
New tensor completion method converges linearly and is highly practical.
We prove new lower bounds for the first eigenvalue of the Dirac operator on compact manifolds whose Weyl tensor or curvature tensor, respectively, is divergence free. In the special case of Einstein manifolds, we obtain estimates depending on the Weyl tensor.
New concentration inequalities for tensors with heavy-tailed coefficients.
We interpret tensors on a smooth manifold M as differential forms over a graded commutative algebra called the algebra of iterated differential forms over M. This allows us to put standard tensor calculus in a new differentially closed context and, in particular, enriches it with new natural operations. Applications wi…
Extends geometrical description of tensor manifolds in tree-based formats.
Unified approach to tensor PCA and related problems using tensor cumulants.
New framework extracts useful information from tensor data with structural properties.
New tensor completion method reduces impact of outliers.
Using Hilbert's criterion, we consider the stress-energy tensor associated to the bienergy functional. We show that it derives from a variational problem on metrics and exhibit the peculiarity of dimension four. First, we use this tensor to construct new examples of biharmonic maps, then classify maps with vanishing or…
We provide a novel analysis of low-rank tensor completion based on hypergraph expanders. As a proxy for rank, we minimize the max-quasinorm of the tensor, which generalizes the max-norm for matrices. Our analysis is deterministic and shows that the number of samples required to approximately recover an order- tensor…
New method combines Monte Carlo and tensor networks for solving complex equations.
Enhances knowledge graph completion with mixed geometry tensor factorization.
We use an isomorphism between the space of valence two Killing tensors on an n-dimensional constant sectional curvature manifold and the irreducible GL(n+1)-representation space of algebraic curvature tensors in order to translate the Nijenhuis integrability conditions for a Killing tensor into purely algebraic integra…
Given the Riemann, or the Weyl, or a generalized curvature tensor K, a symmetric tensor is named `compatible' with the curvature tensor if . Amongst showing known and new properties, we prove that they form a special Jordan algebra, i.e. the symmetriz…
We introduce a weighted de Rham operator which acts on arbitrary tensor fields by considering their structure as r-fold forms. We can thereby define associated superpotentials for all tensor fields in all dimensions and, from any of these superpotentials, we deduce in a straightforward and natural manner the existence …
A second-order differential identity for the Riemann tensor is obtained, on a manifold with symmetric connection. Several old and some new differential identities for the Riemann and Ricci tensors descend from it. Applications to manifolds with Recurrent or Symmetric structures are discussed. The new structure of K-rec…
Dynamic tensor data are becoming prevalent in numerous applications. Existing tensor clustering methods either fail to account for the dynamic nature of the data, or are inapplicable to a general-order tensor. Also there is often a gap between statistical guarantee and computational efficiency for existing tensor clust…