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.
Quadratic Killing tensors on Lie groups are always decomposable.
problem Characterize Killing tensors on Lie groups.
method Analyzing the algebraic structure of Killing tensors on Lie groups.
result Quadratic Killing tensors on compact Lie groups are decomposable.
Characterizes symmetric Killing tensors on specific Lie groups.
problem Understanding Killing tensors on specific Lie groups.
method Completely characterized left-invariant symmetric Killing tensors on almost abelian Lie groups.
result All such tensors are decomposable into polynomial expressions of Killing vector fields and metric.
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to n⌊p/2⌋ for a p-th order tensor in Rnp. Previously no efficient algorithm can decompose 3rd order ten…
The paper classifies Killing tensor fields on Riemannian symmetric spaces.
problem Understanding Killing tensor fields on Riemannian symmetric spaces.
method Reduced study to compact irreducible spaces, introduced top slot Killing tensor fields, and classified quadratic fields.
result Quadratic Killing tensor fields on Riemannian symmetric spaces of rank one are spanned by top-slot and decomposable fields.
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.
Unified approach tackles high-dimensional tensor bandits with convex optimization and weakly decomposable regularizers.
problem Challenges in high-dimensional generalized tensor bandits where existing algorithms fail.
method Proposes a generalized linear tensor bandits algorithm with a unified analytical framework using convex optimization and weakly decomposable regularizers.
result Unified analytical framework provides better bounds and broader applicability compared to existing methods.
A new method for decomposing non-negative tensors using energy-based modeling.
problem Challenges in traditional tensor decomposition methods, especially global optimization and rank selection.
method Energy-based modeling of tensors, considering interactions between modes for global optimization.
result Demonstrates effectiveness in tensor completion and approximation, revealing a relationship between many-body and low-rank approximations.
Researchers found indecomposable Killing tensor fields on quaternionic projective spaces.
problem Characterizing Killing tensor fields on projective spaces.
method Analyzing Killing tensor fields on quaternionic and complex projective spaces, proving algebraic properties.
result Generated algebras of Killing tensor fields on quaternionic and complex projective spaces.
Tensor decompositions have rich applications in statistics and machine learning, and developing efficient, accurate algorithms for the problem has received much attention recently. Here, we present a new method built on Kruskal's uniqueness theorem to decompose symmetric, nearly orthogonally decomposable tensors. Unlik…
We propose a completely unsupervised method to understand audio scenes observed with random microphone arrangements by decomposing the scene into its constituent sources and their relative presence in each microphone. To this end, we formulate a neural network architecture that can be interpreted as a nonnegative tenso…
GETF efficiently decomposes large-scale Boolean tensors.
problem Efficiently factorizing large-scale Boolean tensors.
method Geometric Expansion for all-order Tensor Factorization (GETF).
result GETF significantly improves reconstruction accuracy and efficiency.
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.
DeepTensor uses deep networks to efficiently decompose tensors with improved performance and robustness.
problem Efficiently decomposing tensors with deep learning to capture nonlinear structures.
method Low-rank tensor decomposition using deep generative networks trained to minimize approximation error.
result DeepTensor outperforms classical methods like SVD and PCA in various applications, including image denoising and 3D MRI.
We use results of Matzeu and Nikcevic to decompose the space of affine Kaehler curvature tensors as a direct sum of irreducible modules in the complex setting
Study spectral learning for odeco tensors, addressing initialization bottlenecks.
problem Recovering orthogonally decomposable tensors under noise.
method Investigates perturbation bounds, non-convex optimization, and initialization strategies.
result Initialization is the main bottleneck for efficient algorithms.
Tensor factorization has been demonstrated as an efficient approach for computational phenotyping, where massive electronic health records (EHRs) are converted to concise and meaningful clinical concepts. While distributing the tensor factorization tasks to local sites can avoid direct data sharing, it still requires t…
Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our formulation considerably improves the convergence rate of estimation while maint…
The space of the torsion (0,3)-tensors of the linear connections on almost contact manifolds with B-metric is decomposed in 15 orthogonal and invariant subspaces with respect to the action of the structure group. Three known connections, preserving the structure, are characterized regarding this classification.
HOTCAKE compresses CNNs by decomposing kernels into smaller parts.
problem Compressing deep CNNs without significant accuracy loss.
method Input channel decomposition, guided Tucker rank selection, higher order Tucker decomposition, fine-tuning.
result HOTCAKE produces highly compressed CNN models with good accuracy.
The integrability conditions for the existence of a conformal Killing-Yano tensor of arbitrary order are worked out in all dimensions and expressed in terms of the Weyl tensor. As a consequence, the integrability conditions for the existence of a Killing-Yano tensor are also obtained. By means of such conditions, it is…
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.
Decomposes submanifolds with special tensors into simpler parts.
problem Understanding the structure of submanifolds with special tensors.
method Established a decomposition theorem for submanifolds with nonnegative sectional curvature and a Codazzi tensor with parallel mean curvature.
result Submanifolds with these tensors are locally isometric to a direct product of irreducible factors.
Sparse incidence tensors can represent a variety of structured data. For example, we may represent attributed graphs using their node-node, node-edge, or edge-edge incidence matrices. In higher dimensions, incidence tensors can represent simplicial complexes and polytopes. In this paper, we formalize incidence tensors,…
Conformally recurrent pseudo-Riemannian manifolds of dimension n>4 are investigated. The Weyl tensor is represented as a Kulkarni-Nomizu product. If the square of the Weyl tensor is nonzero, a covariantly constant symmetric tensor is constructed, that is quadratic in the Weyl tensor. Then, by Grycak's theorem, the expl…
We propose an algorithm for the non-negative factorization of an occurrence tensor built from heterogeneous networks. We use l0 norm to model sparse errors over discrete values (occurrences), and use decomposed factors to model the embedded groups of nodes. An efficient splitting method is developed to optimize the non…
We prove theorems about the Ricci and the Weyl tensors on generalized Robertson-Walker space-times of dimension n≥3. In particular, we show that the concircular vector introduced by Chen decomposes the Ricci tensor as a perfect fluid term plus a term linear in the contracted Weyl tensor. The Weyl tensor is harmoni…
Robust tensor CP decomposition involves decomposing a tensor into low rank and sparse components. We propose a novel non-convex iterative algorithm with guaranteed recovery. It alternates between low-rank CP decomposition through gradient ascent (a variant of the tensor power method), and hard thresholding of the resid…
Researchers found non-Killing tensor fields on certain symmetric spaces.
problem Understanding Killing tensors on all Riemannian symmetric spaces.
method Constructed explicit examples of quadratic Killing tensors on quaternionic and Cayley projective spaces.
result Quadratic Killing tensors can be non-Killing on some symmetric spaces.
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.
New method for tensor classification with missing data.
problem Handling incomplete tensor data in high-dimensional classification.
method High-dimensional tensor linear discriminant analysis with TGMM and Tensor LDA-MD.
result Established convergence rates and minimax optimal bounds for misclassification rate.
The paper tackles tensor factorization and completion from noisy data.
problem Sparse nonnegative tensor factorization and completion from partial and noisy observations.
method Minimizes the sum of maximum likelihood estimation and tensor ℓ0 norm with nonnegativity constraints. result Error bounds and minimax lower bounds are established for the proposed model.
We consider the problem of decomposing a higher-order tensor with binary entries. Such data problems arise frequently in applications such as neuroimaging, recommendation system, topic modeling, and sensor network localization. We propose a multilinear Bernoulli model, develop a rank-constrained likelihood-based estima…
We present an efficient algorithm for learning mixed membership models when the number of variables p is much larger than the number of hidden components k. This algorithm reduces the computational complexity of state-of-the-art tensor methods, which require decomposing an O(p3) tensor, to factorizing…
New algorithm for tensor decomposition and Gaussian mixture models.
problem Efficiently decompose overcomplete order-3 tensors and estimate parameters of Gaussian mixtures.
method Proposes Jennrich's algorithm adapted for tensor decomposition and Gaussian mixture models.
result Efficient algorithm for decomposing symmetric overcomplete order-3 tensors and estimating parameters of Gaussian mixtures.
TATD predicts missing entries in time-evolving tensors by exploiting temporal dependency and sparsity.
problem Predict missing entries in time-evolving tensors with temporal dependency and sparsity issues.
method TATD (Time-Aware Tensor Decomposition) integrates temporal dependency and time-varying sparsity through a smoothing regularization with Gaussian kernel and alternating optimization.
result TATD achieves state-of-the-art accuracy for decomposing temporal tensors.
It is well known that the curvature tensor of a pseudo-Riemannian manifold can be decomposed with respect to the pseudo-orthogonal group into the sum of the Weyl conformal curvature tensor, the traceless part of the Ricci tensor and of the scalar curvature. A similar decomposition with respect to the pseudo-unitary gro…
Novel approach for estimating joint probability densities using tensor decompositions and dictionaries.
problem Estimating joint probability densities of mixed discrete and continuous variables.
method Low-rank tensor decomposition combined with dictionary learning.
result Better classification and lower error rates compared to existing methods.
We developed a perturbation model for affine gravity theories.
problem Cosmological perturbations in theories without metric.
method Segregated perturbations into symmetric and antisymmetric components, decomposing into irreducible elements.
result Fully addressed gauge freedom in affine gravity theories.
Tensor decomposition has been extensively used as a tool for exploratory analysis. Motivated by neuroscience applications, we study tensor decomposition with Boolean factors. The resulting optimization problem is challenging due to the non-convex objective and the combinatorial constraints. We propose Binary Matching P…
We study the structure group of a canonical algebraic curvature tensor built from a symmetric bilinear form, and show that in most cases it coincides with the isometry group of the symmetric form from which it is built. Our main result is that the structure group of the direct sum of such canonical algebraic curvature …
Method determines latent dimensionality in international trade flows.
problem Finding meaningful low-dimensional latent features in high-dimensional international trade data.
method Proposes a latent dimension determination method based on clustering of nonnegative RESCAL decompositions.
result Validates the latent features against empirical economic facts.
New divergence identity for scalar curvature helps prove rigidity of tensors.
problem Proving rigidity of Codazzi tensors under curvature and invariant conditions.
method Derived a divergence identity for a vector field and applied it to tensor rigidity.
result New proof of Tang-Yan theorem on constant eigenvalues for tensors.
Study classifies Einstein spaces and warped products in weighted geometry.
problem Characterizing geometric structures of weighted Einstein spaces.
method Complete local classification of weighted Einstein spaces with harmonic Weyl tensor.
result Spaces decompose into Einstein or specific warped products.
Unified framework for coupled tensor completion improves recovery accuracy.
problem Improving recovery accuracy in coupled tensor completion.
method Unified framework using tensor ring (TR) decomposition with shared latent factors and novel optimization model.
result The proposed method achieves superior recovery accuracy on real-world data compared to state-of-the-art methods.
Corrected whitening restores orthogonality in high-dimensional spherical Gaussian mixtures.
problem In high-dimensional data, standard whitening fails to preserve orthogonality of mixture means.
method Derived exact limits for whitened means dot products using random matrix theory, constructed a corrected whitening matrix.
result Corrected whitening allows for improved estimation of spherical Gaussian mixtures in the large-dimensional regime.
Global fixed income returns span across multiple maturities and economies, that is, they naturally reside on multi-dimensional data structures referred to as tensors. In contrast to standard "flat-view" multivariate models that are agnostic to data structure and only describe linear pairwise relationships, we introduce…
Researchers decompose curvature to confirm Hopf conjecture and prove new rigidity theorems.
problem Confirming the Hopf conjecture on compact Riemannian manifolds of even dimension.
method Decomposing the curvature operator into Hermitian components and developing eigenvalue criteria for sectional curvature.
result Prove vanishing theorems for Betti numbers under integral bounds on the Weyl tensor and confirm the Hopf conjecture for manifolds with sufficiently small Weyl curvature.