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.

169,341 papers · 148 categories

Trend · papers per month

93186278371 · Jun 202019922001200920182026
48 results for 3rd order tensors

A novel approach to improve knowledge base completion using tensor decomposition.

problem Knowledge Base Completion (KBC) as a tensor completion problem.
method Canonical Tensor Decomposition (CP) with novel regularizers and reformulation.
result Improved KBC results using CP decomposition and ComplEx model.

We answer to the question whether a system of the 3rd order ODEs describes geodesics of a conformal structure. We construct a functor from a category of conformal geometries to a category of Cartan geometries associated to the 3rd order ODEs systems. Explicit formulas which define the family of all equations on conform…

2013-03-21abs ↗pdf ↗

We provide five examples of conformal geometries which are naturally associated with ordinary differential equations (ODEs). The first example describes a one-to-one correspondence between the Wuenschmann class of 3rd order ODEs considered modulo contact transformations of variables and (local) 3-dimensional conformal …

2004-06-21abs ↗pdf ↗

The paper extends higher-order operators in higher spin spaces.

problem Generalizing higher-order operators in higher spin spaces.
method Constructing 3rd order fermionic and 4th order bosonic operators in higher spin spaces.
result Fundamental solutions and intertwining operators of 3rd order fermionic and 4th order bosonic operators are presented.

Study of SO(3)-irreducible geometry in complex 5D and ternary Pauli exclusion principle.

problem Exploring SO(3)-irreducible geometry in complex 5D.
method Defined a ternary skew-symmetric tensor, split the 10D space into irreducible SO(3) subspaces, found invariants and defined geometric structures.
result Defined a SO(3)-irreducible geometric structure on a 5D complex Hermitian manifold.

Formulates quantum jet bundles over noncommutative algebras with connections and braiding.

problem Defining jet bundles over noncommutative algebras with connections and braiding.
method Formalizes jet bundles over noncommutative algebras with flat connections and braiding tensor obeying Yang-Baxter equation.
result Examples include permutation groups, matrix algebras, and quantum spacetime models.

Optimizes Euclidean functions on Riemannian manifolds with warped metrics.

problem Optimizing functions in high-dimensional Euclidean spaces.
method Riemannian geometry, warped metric, geodesic curves, Taylor approximations, retraction maps.
result Efficient optimization of functions using third-order approximations of geodesics.

Amobee won 3rd and 1st place in SemEval 2018 sentiment classification tasks.

problem Sentiment classification in multiple languages.
method Training GRU-CNN model with word embeddings and stacking ensembles.
result 3rd and 1st place in valence ordinal classification sub-tasks in English and Spanish.

Paper studies second order symmetric parallel tensors in generalized f.pk-space forms.

problem Exploring properties of second order symmetric parallel tensors in generalized f.pk-space forms.
method Analyzes the properties of second order symmetric parallel tensors and deduces the existence or non-existence of certain tensors and hypersurfaces.
result There does not exist second order skew-symmetric parallel tensor in f.pk-space form. There is no parallel hypersurface in a generalized f.pk-space form but there is semi-parallel hypersurface.

Investigates the impact of batch size on GPU and TPU performance.

problem Optimizing performance of GPUs and TPUs during training and inference phases.
method Investigated the impact of batch size on performance of GPUs and TPUs using standard MNIST and Fashion-MNIST datasets.
result Significant speedup was achieved even with low-scale usage of TPUv2 units, up to 10x for training and 2x for prediction.

This paper is an expansion of my lecture for David Epstein's birthday, which traced a logical progression from ideas of Euclid on subdividing polygons to some recent research on invariants of hyperbolic 3-manifolds. This `logical progression' makes a good story but distorts history a bit: the ultimate aims of the chara…

1997-12-04abs ↗pdf ↗

The properties of a Killing-Yano tensor of order n-1 in an n-dimensional manifold are investigated. The integrability conditions are worked out and all metrics admitting a Killing-Yano tensor of order n-1 are found. It is pointed out a connection between such tensors and a generalization of the concept of angular momen…

2014-05-16abs ↗pdf ↗

A new sketching method reduces tensor memory usage and enables efficient tensor operations.

problem Efficiently compressing and retaining tensor structure in large datasets.
method Higher-order Count Sketch (HCS) using multiple hash functions and tensor products.
result HCS achieves significant memory savings and efficient tensor operations.

Study on tensor nuclear norm's decomposability and subdifferential.

problem Understanding tensor nuclear norm in higher-order tensors.
method Showed decomposability over specific subspaces, derived subdifferential inclusions, and studied subgradients.
result Established the statistical performance of tensor robust principal component analysis.

Local invertibility of higher order tensor transforms on compact manifolds.

problem Invertibility of higher order tensor transforms on compact manifolds.
method Local invertibility of transverse and mixed ray transforms of tensors on compact Riemannian manifolds.
result Local invertibility of transverse and mixed ray transforms of tensors for specific dimensions.

Algorithm for exact partitioning of high-order models using convex tensor relaxation.

problem Exact partitioning of high-order models.
method Defining a general class of mm-degree Homogeneous Polynomial Models, relaxing the high-order combinatorial problem to a convex conic form problem, defining the Carathéodory symmetric tensor cone, and constructing a primal-dual certificate.
result The solution of the convex relaxation is correct and provides a statistical upper bound for exact partitioning.

We construct new examples of algebraic curvature tensors so that the Jordan normal form of the higher order Jacobi operator is constant on the Grassmannian of subspaces of type (r,s)(r,s) in a vector space of signature (p,q)(p,q). We then use these examples to establish some results concerning higher order Osserman and highe…

2002-05-07abs ↗pdf ↗

Yasutaka Nakanishi asked in 1981 whether a 3-move is an unknotting operation. In Kirby's problem list, this question is called `The Montesinos-Nakanishi 3-move conjecture'. We define the n-th Burnside group of a link and use the 3rd Burnside group to answer Nakanishi's question; ie, we show that some links cannot be re…

2002-05-04abs ↗pdf ↗

Optimal low rank tensor recovery requires a minimum number of entries for accurate reconstruction.

problem Exact recovery of high order tensors of low rank from a subset of their entries.
method Riemannian optimization algorithm with initial value from a spectral method, leveraging tensor restricted isometry property and curvature of the manifold.
result Tensor of size nimesnimesimesnn imes n imes \cdots imes n of ranks (r,,r)(r,\cdots,r) can be reconstructed with high probability from O((rd+dnr)log(d))O((r^d+dnr)\log(d)) entries.

Paper proposes efficient methods for high-order clustering in tensor block models.

problem High-order clustering of multiway datasets in neuroimaging, genomics, etc.
method Tensor block model and computationally efficient algorithms (HLloyd, HSC)
result Achieves high-order exact clustering with statistical optimality and computational efficiency.

Study on Haantjes tensors for superintegrable systems, focusing on vanishing properties.

problem Understanding the vanishing of Haantjes tensors in superintegrable systems.
method Investigating Killing tensor fields associated with second-order superintegrable systems.
result Characterization of Haantjes-zero Killing tensor fields.

Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.

problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.

This paper deals with the problem of describing the vector spaces of divergence-free, natural tensors on a pseudo-Riemannian manifold that are second-order; i.e., that are defined using only second derivatives of the metric. The main result establishes isomorphisms between these spaces and certain spaces of tensors (at…

2013-06-18abs ↗pdf ↗

The paper presents a new tensor sparsification method that reduces sample complexity for tensor approximation.

problem Efficiently approximating high-dimensional tensors with reduced sample size.
method Proposes a novel tensor sparsification algorithm to retain a subset of tensor entries.
result Achieves a given level of approximation accuracy with a much smaller sample complexity.

Introduces P-tensors for generalized higher-order message passing in graph neural networks.

problem Expanding the expressive power of graph neural networks through higher-order structures.
method Introduces P-tensors to define the most general form of permutation equivariant message passing.
result Achieves state-of-the-art performance on molecular datasets.