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,657 papers · 148 categories

Trend · papers per month

126251377502 · May 202619922001200920172026
48 results for tensor structures

In the literature we see that after introducing a geometric structure by imposing some restrictions on Riemann-Christoffel curvature tensor, the same type structure given by imposing same restriction on other curvature tensors being studied. The main object of the present paper is to study the equivalency of various ge…

2013-01-30abs ↗pdf ↗

New framework extracts useful information from tensor data with structural properties.

problem Extract useful information from tensor data with structural properties.
method Proposed an additive tensor decomposition (ATD) framework and an ADMM algorithm to solve the high dimensional optimization problem.
result Versatile and effective framework demonstrated in simulations and real medical image analysis.

Enhances tensor regression for interpretability and performance.

problem Interpreting and modeling multidimensional tensor data with structural heterogeneity.
method Generalized Nonnegative Structured Kruskal Tensor Regression (NS-KTR) with hybrid regularization and nonnegativity constraints.
result NS-KTR outperforms conventional methods in synthetic and real hyperspectral datasets.

We construct a metrical framed structure on the tensor bundle of a Riemannian manifold equipped with a Cheeger-Gromoll type metric and by restricting this structure to the tensor sphere bundle, we obtain an almost metrical paracontact structure on the tensor sphere bundle. Moreover, we show that the tensor sphere bundl…

2013-06-08abs ↗pdf ↗

The paper classifies Lorentzian Lie groups based on Codazzi tensors and quasi-statistical structures.

problem Classifying Lorentzian Lie groups based on specific tensor properties.
method Classification of three-dimensional Lorentzian Lie groups based on Ricci tensors and quasi-statistical structures associated with different affine connections.
result The paper classifies three-dimensional Lorentzian Lie groups based on Codazzi tensors and quasi-statistical structures associated with Bott, canonical, and Kobayashi-Nomizu connections.

In recent years, a class of dictionaries have been proposed for multidimensional (tensor) data representation that exploit the structure of tensor data by imposing a Kronecker structure on the dictionary underlying the data. In this work, a novel algorithm called "STARK" is provided to learn Kronecker structured dictio…

2017-11-13abs ↗pdf ↗

New algorithm detects tensor dependence structure alterations efficiently.

problem Detecting alterations in tensor dependence structures.
method Tensor-normal distributions, decorrelation, centralization, SERA (Sparsity-Exploited Reranking Algorithm).
result The proposed SERA algorithm controls false discovery rates effectively.

Researchers found all homogeneous structure tensors on two specific 3D manifolds.

problem Classifying homogeneous structure tensors on specific 3D manifolds.
method Determined all homogeneous structure tensors on S2imesR\mathbb{S}^2 imes\mathbb{R} and H2imesR\mathbb{H}^2 imes\mathbb{R}.
result Complete classification of homogeneous structure tensors on three-dimensional homogeneous Riemannian manifolds.

Proposes FATTNN for tensor-on-tensor regression with improved prediction and reduced computation.

problem Tensor-on-tensor regression with complex tensor structures and nonlinear relationships.
method Integrates tensor factor models into deep neural networks to handle nonlinearity and reduce data dimensionality.
result Significant improvements in prediction accuracy and computational efficiency over traditional methods.

Dual-Channel Tensor Neural Network (DC-TNN) decomposes tensor data into low-rank and sparse components for better estimation and inference.

problem Tensor-valued data with multilinear dependencies are challenging to process due to loss of multiway geometry under vectorization.
method DC-TNN decomposes tensors into a low-rank core and a sparse refinement, processing them through coupled neural channels.
result Established non-asymptotic risk bounds and developed structure-aware conformal ROC and AUC confidence bands.

We investigate the relationship between the algebra of tensor categories and the topology of framed 3-manifolds. On the one hand, tensor categories with certain algebraic properties determine topological invariants. We prove that fusion categories of nonzero global dimension are 3-dualizable, and therefore provide 3-di…

2013-12-27abs ↗pdf ↗

The paper uses tensor decompositions to improve neural network models for tree data.

problem Encoding structural knowledge from tree-structured data efficiently.
method Introduces new aggregation functions using Canonical and Tensor-Train decompositions.
result Proposed models outperform traditional methods on tree classification tasks.

Data collected at very frequent intervals is usually extremely sparse and has no structure that is exploitable by modern tensor decomposition algorithms. Thus the utility of such tensors is low, in terms of the amount of interpretable and exploitable structure that one can extract from them. In this paper, we introduce…

2019-12-19abs ↗pdf ↗

We discuss structured Schatten norms for tensor decomposition that includes two recently proposed norms ("overlapped" and "latent") for convex-optimization-based tensor decomposition, and connect tensor decomposition with wider literature on structured sparsity. Based on the properties of the structured Schatten norms,…

2013-03-26abs ↗pdf ↗

Paper presents a method for imputing and forecasting structural response from incomplete sensor data.

problem Missing sensor data in structural health monitoring (SHM).
method Incremental Bayesian tensor learning for spatiotemporal missing data reconstruction and forecasting.
result The proposed method achieves accurate and robust imputation and prediction even with high rates of missing data.

The main goal of this paper is to study the geometric structures associated with the representation of tensors in subspace based formats. To do this we use a property of the so-called minimal subspaces which allows us to describe the tensor representation by means of a rooted tree. By using the tree structure and the d…

2015-05-12abs ↗pdf ↗

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…

2017-08-24abs ↗pdf ↗

Study the rank of Nijenhuis tensor on parallelizable almost complex manifolds.

problem Understanding the rank of Nijenhuis tensor on parallelizable almost complex manifolds.
method Reduction of computations to solving PDEs, explicit solutions on specific manifolds, analysis of curve of almost complex structures, classification of Lie algebras.
result Classification of Lie algebras admitting almost complex structures with specific Nijenhuis tensor ranks.

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…

2019-10-26abs ↗pdf ↗

Study shows almost complex structures with certain tensor properties are prevalent.

problem Characterizing almost complex structures with specific tensor properties.
method Analyzes the space of almost complex structures on compact manifolds.
result The space of almost complex structures with rank at least k Nijenhuis tensor is either empty or dense in each component.

Two methods preserve tensor structure for reduced dimensionality in tensor regression.

problem Reducing dimensionality of tensor predictors for improved interpretation and accuracy.
method Developed two tensor dimension reduction methods using Tucker and CP decompositions.
result Substantial improvement in accuracy over existing methods in simulations and applications.

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.

We consider flows of Spin(7)-structures. We use local coordinates to describe the torsion tensor of a Spin(7)-structure and derive the evolution equations for a general flow of a Spin(7)-structure on an 8-manifold M. Specifically, we compute the evolution of the metric and the torsion tensor. We also give an explicit d…

2007-09-28abs ↗pdf ↗

Properties of pairs of product conjugate connections are stated with a special view towards the integrability of the given almost product structure. We define the analogous in product geometry of the structural and the virtual tensors from the Hermitian geometry and express the product conjugate connections in terms of…

2013-02-05abs ↗pdf ↗

Study curvature properties of specific Riemannian manifolds with skew-circulant structures.

problem Investigate curvature of Riemannian manifolds with a particular tensor structure.
method Analyze 4D Riemannian manifolds with right skew-circulant tensor S, invariant under S and g, focusing on Ricci tensor and sectional curvatures.
result Obtained properties of curvature tensors and sectional curvatures for specific manifolds.

A unified framework for Poisson and Jacobi structures from 2-covariant tensors

problem Constructing Poisson and Jacobi structures from non-degenerate 2-covariant tensors
method Deriving a formula for the Schouten-Nijenhuis bracket of the associated bivector field
result Recovering classical brackets associated with symplectic, locally conformally symplectic, cosymplectic, and contact geometries

Study on almost complex structures with maximal Nijenhuis tensor rank and cohomological properties.

problem Maximally non-integrable almost complex structures and their cohomological properties.
method h-principle and topological invariants characterization.
result Existence of almost complex structures with maximal Nijenhuis tensor rank on parallelizable and certain manifolds.

The space of the structure (0,3)-tensors of the covariant derivatives of the structure endomorphism and the metric on almost contact B-metric manifolds is considered. A known decomposition of this space in orthogonal and invariant subspaces with respect to the action of the structure group is used. We determine the cor…

2014-05-13abs ↗pdf ↗

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 ↗

Develops TOFU for tensor bandits with low-rank structure.

problem Linear bandit models fail to capture high-dimensional, low-rank tensor structures.
method Develops TOFU, a tensor bandit algorithm that estimates low-dimensional subspaces and uses norm constraints.
result Improves regret bound by a multiplicative factor that grows exponentially in system order.

Paper reviews multi-way graph signal processing for tensor data.

problem Maximizing use of multi-way structure in irregular tensor data.
method Generalizes GSP to multi-way data, focusing on graph signals across tensor modes.
result Synthesizes common themes in combining GSP with tensor analysis.

Paper identifies tensor ranks via prior predictive matching, solving system of equations.

problem Determining the latent dimensions (ranks) in tensor factorization models.
method Prior predictive moment matching to transform moment matching conditions into a log-linear system of equations.
result Identifies which tensor models have identifiable ranks and derives rank estimators.

TEAFormers preserve multi-dimensional time series structures for better forecasting.

problem Traditional Transformers flatten multi-dimensional time series data, losing critical multi-dimensional relationships.
method Tensor-Augmented Transformer (TEAFormer) with Tensor-Augmentation (TEA) module.
result Significant performance enhancements in time series forecasting across benchmarks.