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…
Adaptive algorithm learns tensor network structures from data.
problem Identifying optimal tensor network structure from data.
method Greedy approach starting from rank one tensor, small rank increments.
result Adaptive algorithm identifies efficient tensor network structures.
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…
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.
Tensoring p-weak differentiable structures preserves their properties.
problem Tensorization of p-weak differentiable structures. method Proving the product of p-weak charts is a p-weak chart, and showing isometric embeddings. result Tensorization of p-weak differentiable structures is possible under certain conditions. 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…
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 and H2imesR. result Complete classification of homogeneous structure tensors on three-dimensional homogeneous Riemannian manifolds.
Paper tackles sparse, unstructured data tensors by optimizing adaptive aggregation granularity.
problem Sparse, unstructured data tensors are hard to analyze.
method Introduces IceBreaker, a greedy algorithm that optimizes adaptive tensor aggregation.
result IceBreaker constructs tensors with high structure quality from various datasets.
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.
The projective curvature tensor P is invariant under a geodesic preserving transformation on a semi-Riemannian manifold. It is well known that P is not a generalized curvature tensor and hence it possesses different geometric properties than other generalized curvature tensors. The main object of the present paper …
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…
Small Nijenhuis tensor found on compact manifolds.
problem Finding compact manifolds with small Nijenhuis tensor.
method Provided explicit examples of manifolds with small Nijenhuis tensor.
result Examples of manifolds with small Nijenhuis tensor in various dimensions.
SLTR model preserves tensor structure and reduces prediction time costs.
problem Efficiently predicting tensor data relationships with structural preservation.
method SLTR model enforces sparsity and low-rankness via proximal gradient method.
result SLTR achieves better solutions with significantly reduced time costs.
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.
We show that well known structures on Lie algebroids can be viewed as Nijenhuis tensors or pairs of compatible tensors on Courant algebroids. We study compatibility and construct hierarchies of these structures.
An associated Nijenhuis tensor of endomorphisms in the tangent bundle is introduced. Special attention is paid to such tensors for an almost hypercomplex structure and the metric of Hermitian-Norden type. There are studied relations between the six associated Nijenhuis tensors as well as their vanishing. It is given a …
Proposes tensor Q-rank for better tensor rank recovery in complex data.
problem Improving tensor rank recovery for complex data with low sampling rate.
method Introduces tensor Q-rank and two selection methods for Q, proposing VMTQN and MOTQN models. result Demonstrates superior performance in tensor completion problems compared to TNN-based methods.
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,…
For a positive definite fundamental tensor all known examples of Osserman algebraic curvature tensors have a typical structure. They can be produced from a metric tensor and a finite set of skew-symmetric matrices which fulfil Clifford commutation relations. We show by means of Young symmetrizers and a theorem of S. A.…
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…
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…
New tensor model reduces GLM estimation error and sample complexity.
problem Estimating GLM coefficients with reduced sample complexity.
method Developed LSR tensor model and block coordinate descent algorithm.
result Minimax lower bound on estimation error, suggesting lower sample complexity.
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.
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.
Proposes GTTN for discovering all low-rank structures in deep multi-task learning.
problem Discovering all low-rank structures among tasks in deep multi-task models.
method Introduces GTTN, a convex combination of matrix trace norms of all tensor flattenings, to automatically determine the importance of components.
result Demonstrates the effectiveness of GTTN on real-world datasets.
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…
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…
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 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.
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 paper studies lifts of complex structures on a manifold.
problem Understanding higher-order lifts of extended almost complex structures.
method Proved theorems on Nijenhuis tensor and introduced a new tensor field.
result Basic results on almost analytic complex vectors are investigated.
The paper formalizes incidence tensors and their decomposition for geometric deep learning.
problem Representing structured data like graphs and simplicial complexes.
method Formalizes incidence tensors, analyzes their structure, and presents equivariant networks.
result Incidence tensors decompose into invariant subsets, leading to efficient linear map implementations.
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…
Proposes a new kernel technique for tensor data in SVM.
problem Handling tensorial data in machine learning.
method Kernelized support tensor train machine for image classification.
result Tensorizes the standard SVM on its input structure and kernel mapping scheme.
We endow projective (resp. direct) limits of Banach tensor structures with Fréchet (resp. convenient) structures and study adapted connections to G-structures in both frameworks. This situation is illustrated by a lot of examples.
A new tensor model captures complex structures in heterogeneous data.
problem Complex joint and discriminative structures in heterogeneous datasets.
method Double core tensor factorization with smoothing loss functions and linearized ADMM.
result The model accurately estimates factors even with missing entries.
We show the existence of conformal Killing-Yano tensors on a manifold endowed with a mixed 3-Sasakian structure.
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…
Paper improves MVSC using tensor low-rank modeling.
problem Improving multi-view spectral clustering.
method Structured tensor low-rank norm for MVSC optimization.
result Proposed method outperforms state-of-the-art methods.
New tensors reveal full curvature structure from Riemann tensor.
problem Limited information from Ricci contraction of Riemann tensor.
method Contracting double dual of Riemann tensor to reveal full curvature.
result New tensors provide canonical parents of Einstein tensor.
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.