Research
On-device research index

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.

168,982 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for tensor similarity

Enhances clustering performance by integrating tensor similarity.

problem Noise contamination and imbalance in samples or features hinder accurate clustering.
method Proposes a high-order similarity matrix from tensor similarity, which captures spatial information and complements pairwise similarity.
result The proposed IPS2 method significantly outperforms previous similarity-based methods on real-world datasets.

Algorithm estimates tensors from sparse observations with robust error bounds.

problem Estimating tensors from sparse noisy observations.
method Similarity-based collaborative filtering algorithm for tensor estimation.
result Achieves sample complexity nearly matching conjectured lower bound.

The tensor-tensor product (t-product) [M. E. Kilmer and C. D. Martin, 2011] is a natural generalization of matrix multiplication. Based on t-product, many operations on matrix can be extended to tensor cases, including tensor SVD, tensor spectral norm, tensor nuclear norm [C. Lu, et al., 2018] and many others. The line…

2018-06-17abs ↗pdf ↗

In this paper we focus on the problem of completion of multidimensional arrays (also referred to as tensors) from limited sampling. Our approach is based on a recently proposed tensor-Singular Value Decomposition (t-SVD) [1]. Using this factorization one can derive notion of tensor rank, referred to as the tensor tubal…

2015-02-16abs ↗pdf ↗

On manifolds with an even Riemannian conformally compact Einstein metric, the resolvent of the Lichnerowicz Laplacian, acting on trace-free, divergence-free, symmetric 2-tensors is shown to have a meromorphic continuation to the complex plane, defining quantum resonances of this Laplacian. For higher rank symmetric ten…

2016-09-21abs ↗pdf ↗

The paper shows how gradient flow on over-parametrized tensor decomposition behaves like deflation.

problem Understanding the training dynamics of gradient flow on tensor decomposition.
method Empirical observation and mathematical proof of gradient flow dynamics for orthogonally decomposable tensors.
result Gradient flow dynamics for orthogonally decomposable tensors follows a tensor deflation process, recovering all tensor components.

We study when the Jacobi operator associated to the Weyl conformal curvature tensor has constant eigenvalues on the bundle of unit spacelike or timelike tangent vectors. This leads to questions in the conformal geometry of pseudo-Riemannian manifolds which generalize the Osserman conjecture to this setting. We also stu…

2003-10-15abs ↗pdf ↗

Our principal goal is to study the Prescribed Curvature Tensor problem in locally conformally flat manifolds. The solution to this problem is given explicitly for the special cases of the tensor R, including a case where the metric g is complete on Rn. Similar problems are considered for locally conformally flat manifo…

2015-12-21abs ↗pdf ↗

Defines natural tensors for submanifolds of pseudo-Riemannian manifolds.

problem Characterizing tensors for submanifolds of pseudo-Riemannian manifolds.
method Constructs geodesic normal coordinates and expresses metric coefficients as polynomials in curvature and second fundamental form derivatives.
result Natural tensors are linear combinations of contractions of curvature and second fundamental form derivatives.

We present a new method for online prediction and learning of tensors (NN-way arrays, N>2N >2) from sequential measurements. We focus on the specific case of 3-D tensors and exploit a recently developed framework of structured tensor decompositions proposed in [1]. In this framework it is possible to treat 3-D tensors …

2015-07-28abs ↗pdf ↗

Deterministic bounds for tensor singular values and vectors, differing from matrix cases.

problem Spectral learning of higher-order orthogonally decomposable tensors.
method Deterministic perturbation bounds for singular values and vectors of orthogonally decomposable tensors.
result Perturbation affects each essential singular value/vector in isolation, independent of multiplicity and distance from other singular values.

Consider a Riemannian manifold in dimension n3n\geq 3 with strictly convex boundary. We prove the local invertibility, up to potential fields, of the geodesic ray transform on tensor fields of rank four near a boundary point. This problem is closely related with elastic \textit{qP}-wave tomography. Under the condition …

2018-10-25abs ↗pdf ↗

The recent proposed Tensor Nuclear Norm (TNN) [Lu et al., 2016; 2018a] is an interesting convex penalty induced by the tensor SVD [Kilmer and Martin, 2011]. It plays a similar role as the matrix nuclear norm which is the convex surrogate of the matrix rank. Considering that the TNN based Tensor Robust PCA [Lu et al., 2…

2018-06-07abs ↗pdf ↗

We show that near-horizon geometries in the presence of a positive cosmological constant cannot exist with ring topology. In particular, de Sitter black rings with vanishing surface gravity do not exist. Our result relies on a known mathematical theorem which is a straightforward consequence of a type of energy conditi…

2017-08-11abs ↗pdf ↗

Let X be a smooth manifold of dimension 1+n endowed with a lorentzian metric g, and let T be the electromagnetic energy tensor associated to a 2-form F. In this paper we characterize this tensor T as the only 2-covariant natural tensor associated to a lorentzian metric and a 2-form that is independent of the unit of sc…

2012-01-17abs ↗pdf ↗

Paper proposes LATC for multivariate time series prediction and missing data imputation.

problem Large-scale, incomplete, and corrupted multivariate time series data.
method Transforms multivariate time series into a tensor structure, models global and local trends, and uses autoregressive norm.
result Integration of global and local trends improves missing data imputation and rolling prediction.

Hybrid tensor networks improve machine learning by combining quantum and classical methods.

problem Limitations of regular tensor networks in machine learning.
method Quantum-classical hybrid tensor networks (HTN) combining tensor networks and classical neural networks.
result HTN overcomes limitations of regular tensor networks and enables deep learning training.

A spinorial approach to 6-dimensional differential geometry is constructed and used to analyze tensor fields of low rank, with special attention to the Weyl tensor. We perform a study similar to the 4-dimensional case, making full use of the SO(6) symmetry to uncover results not easily seen in the tensorial approach. U…

2012-12-12abs ↗pdf ↗

The Einstein equations (EE) are certain conditions on the Riemann tensor on the real Minkowski space M. In the twistor picture, after complexification and compactification M becomes the Grassmannian Gr24Gr_{2}^{4} of 2-dimensional subspaces in the 4-dimensional complex one. Here we answer for which of the classical domai…

2003-06-12abs ↗pdf ↗

A tensor invariant is defined on a quaternionic contact manifold in terms of the curvature and torsion of the Biquard connection involving derivatives up to third order of the contact form. This tensor, called quaternionic contact conformal curvature, is similar to the Weyl conformal curvature in Riemannian geometry an…

2007-07-09abs ↗pdf ↗

This work considers a computationally and statistically efficient parameter estimation method for a wide class of latent variable models---including Gaussian mixture models, hidden Markov models, and latent Dirichlet allocation---which exploits a certain tensor structure in their low-order observable moments (typically…

2012-10-29abs ↗pdf ↗

We present a local formulation for 2D Discrete Exterior Calculus (DEC) similar to that of the Finite Element Method (FEM), which allows a natural treatment of material heterogeneity (element by element). It also allows us to deduce, in a robust manner, anisotropic fluxes and the DEC discretization of the pullback of 1-…

2018-12-28abs ↗pdf ↗

Gradient descent can find better tensor decompositions than lazy training in over-parameterized settings.

problem Finding better tensor decompositions in over-parameterized settings.
method Gradient descent on over-parameterized tensor decomposition problems.
result Gradient descent can find an approximate tensor decomposition with rank m=O(r2.5llogd)m = O^*(r^{2.5l}\log d), while lazy training requires m=Ω(dl1)m = Ω(d^{l-1}).

The paper proves rigidity results for manifolds with special holonomy.

problem Proving rigidity results for compact Riemannian manifolds with special holonomy.
method Using divergence free Weyl tensors and curvature operators, the paper proves similar results for manifolds with special holonomy.
result The paper proves that manifolds with special holonomy are locally symmetric or conformally equivalent to a quotient of the sphere.

VecHGrad solves complex tensor decomposition problems more accurately and efficiently.

problem Complex tensor decomposition with multiple matrices and diagonal tensors.
method VecHGrad algorithm using gradient, Hessian-vector product, and adaptive line search.
result VecHGrad converges faster and more accurately than existing methods.

This paper finds a new way to compress CNN weights, improving on pruning and quantization.

problem Improving performance and storage efficiency of CNNs.
method Identifying and exploiting repeated patterns in CNN weight tensors, using Huffman coding and block sparse matrix formats.
result Achieved compaction ratios of 1.4x to 3.1x in addition to pruning and quantization.

A new tensor-based method improves multi-dimensional data classification accuracy.

problem Efficient representation and classification of multi-dimensional data from multiple sensors.
method n-mode generalized difference subspace (n-mode GDS) for tensor data, with improved metric based on geodesic distance.
result The proposed method outperforms existing methods in gesture and action recognition.