Detects missing tensor signals in a KS subspace with high probability.
problem Detecting tensor signals with many missing entities in a KS subspace.
method Projecting the signal onto the KS subspace and bounding residual energy.
result Reliable detection is possible if the missing signal cardinality exceeds KS subspace dimensions.
Paper explores tradeoffs in classification using tensor subspaces.
problem Supervised classification with sample, computation, and storage complexities.
method Use of tensor subspaces, particularly hierarchical Kronecker structured subspaces.
result Hierarchical Kronecker structured subspaces improve classification tradeoffs.
Online tensor subspace tracking algorithm for incomplete data.
problem Online subspace tracking of partially observed high-dimensional data.
method OLSTEC algorithm based on CP decomposition and recursive least squares.
result OLSTEC outperforms state-of-the-art algorithms in convergence rate.
New faster, space-saving methods for subspace embeddings in tensors.
problem Efficiently embedding large tensors with fewer random bits.
method Modewise Johnson-Lindenstrauss embeddings for rank-r tensors. result Improved space complexity for tensor subspaces with fewer random bits.
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.
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.
Proposes CMP method for reducing tensor object dimensions in binary classification.
problem Reduction of tensor object dimensions while maintaining class separability.
method Proposes Common Mode Patterns (CMP) method considering class labels.
result CMP method increases inter-class separability compared to MPCA.
New method guarantees simultaneous decomposition of tensor components.
problem Existing methods fail to recover all tensor components simultaneously.
method S-ASI method using slicing initialization and subspace iterations.
result Guaranteed recovery of top r components simultaneously for symmetric tensors.
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…
Proposes a tensor Laplacian-based method for better subspace clustering of non-uniformly distributed data.
problem LRR's inability to handle non-uniform data distribution and local information loss.
method Tensor Laplacian Regularized Low-Rank Representation (TLRR) using hypergraph model and tensor Laplacian algorithm.
result Higher accuracy and precision in subspace clustering compared to state-of-the-art methods.
Proposes a method to reveal nonlinearities in tensor data.
problem Capturing nonlinear relationships in high-dimensional tensor data.
method Linear tensor projection method to maximize prediction accuracy.
result Effective in revealing nonlinear relationships in tensor data.
The study analyzes perturbation bounds for HOSVD and introduces new tensor denoising estimators.
problem Perturbation analysis of HOSVD under random noise.
method Developed sup-norm perturbation bounds and introduced new tensor denoising estimators.
result Sharp deviation bounds in the sup-norm for singular subspaces and fast convergence rate for tensor denoising.
Adaptive tensor modeling preserves continuity in multidimensional data.
problem Discretization of continuous multidimensional data loses important information.
method Functional Tucker decomposition (FTD) with RKHS modeling.
result FTD enables adaptive and expressive tensor modeling.
Extends MSC for triclustering tensors, using DBSCAN to find clusters.
problem Finding clusters in multi-slice triclustering of tensors with unknown cluster sizes.
method Extends Multi-Slice Clustering (MSC) with DBSCAN to find clusters in tensors.
result Can find clusters in tensors that are sums of multiple rank-one tensors.
Novel tensor perturbation bounds for orthogonal iteration methods.
problem Developing robust bounds for tensor reconstruction and subspace estimation.
method Blockwise tensor perturbation bounds for high-order orthogonal iteration (HOOI).
result Upper bounds for singular subspace estimation converge linearly and tensor reconstruction error bound is characterized by a simple quantity.
Constructs finite element spaces for (p,q)-forms, excluding one subspace.
problem Constructing finite element spaces for (p,q)-forms. method Piecewise polynomial finite element spaces for all natural subspaces of (p,q)-forms, excluding one subspace. result Recovers known finite element spaces and introduces new ones.
Paper projects GP basis functions using tensor networks to reduce complexity.
problem Efficiently approximating Gaussian process regression with a large number of basis functions.
method Develops a method using tensor networks to approximate GP regression with an exponential number of basis functions without exponential computational complexity.
result Shows efficient GP regression on an 18-dimensional benchmark data set.
The study examines algebraic structures of specific tensor forms in four-dimensional spacetimes.
problem Investigating algebraic features of certain tensor forms in spacetimes.
method General treatment followed by specialization to four-dimensional spacetimes, focusing on invariant subspaces and generalizing relations.
result Generalized relations such as the Ruse-Lanczos identity, Bel-Matte decomposition, and Lovelock-like quadratic identities.
A new tensor-based method for multi-view clustering.
problem Lack of explicit correlations between features across multiple views.
method Introduces a tensor-based approach to explore higher-order interactions among multiple views.
result Our MMC algorithm outperforms other methods on real-world datasets.
We consider the problem of recovering a low-rank tensor from its noisy observation. Previous work has shown a recovery guarantee with signal to noise ratio O(n⌈K/2⌉/2) for recovering a Kth order rank one tensor of size n×⋯×n by recursive unfolding. In this paper, we first improve…
Stochastic trace estimation with tensor train random vectors
problem Stochastic trace estimation for large-scale matrices
method Gaussian random tensor train vectors
result Median-of-means variant achieves dimension-independent guarantees
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) in a vector space of signature (p,q). We then use these examples to establish some results concerning higher order Osserman and highe…
Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace W^{\bot} of W within the dual space of K[S_r] yield linear identities needed for a t…
Paper introduces G-LowTESTR for efficient tensor bandits.
problem Efficient decision-making in multi-dimensional data with non-linear reward functions.
method Generalized low-rank tensor contextual bandits model and G-LowTESTR algorithm.
result G-LowTESTR achieves superior regret bound compared to vectorization and matricization methods.
Proposes TTNPE for tensor data embedding with improved trade-offs.
problem Embedding multi-dimensional tensor data into low dimensions.
method Tensor Train Neighborhood Preserving Embedding (TTNPE) with novel optimization approaches.
result Improves classification, computation, and dimensionality reduction trade-offs.
New method clusters tensors with heteroskedastic noise.
problem Clustering tensors with varying noise levels.
method Two-stage method: subspace estimation followed by approximate k-means. result Proves exact clustering for SNR above computational limit.
This work improves smoothed analysis for several unsupervised learning problems.
problem Overcoming worst-case intractability in unsupervised learning and high-dimensional data analysis.
method Developed high-confidence lower bounds on the least singular value of structured random matrix ensembles and used them to design algorithms with polynomial time smoothed analysis guarantees.
result Polynomial time smoothed analysis guarantees for robust subspace recovery, learning overcomplete hidden markov models, and higher order tensor decompositions.
In 1996/7, J. Bernstein observed that smooth or analytic supermanifolds that mathematicians study are real or (almost) complex ones, while Minkowski superspaces are completely different objects. They are what we call almost real-complex supermanifolds, i.e., real supermanifolds with a non-integrable distribution, the c…
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.
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 …
We construct an algebra of nonlinear generalized tensor fields on manifolds in the sense of J.-F. Colombeau, i.e., containing distributional tensor fields as a linear subspace and smooth tensor fields as a faithful subalgebra. The use of a background connection on the manifold allows for a simplified construction based…
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…
Paper extends matrix completion to nonlinear algebraic varieties.
problem Matrix completion for nonlinear algebraic varieties.
method Tensorization and Kronecker product approach.
result New method outperforms existing state-of-the-art methods.
In this paper, we describe the space of adapted connections on a metric contact manifold through the space of their torsion tensors. The torsion tensor is an element of the space of TM-valued two-forms, which splits into various subspaces. We study the parts of the torsion tensor according to this splitting to complete…
Develops a new feature theory for robust machine learning.
problem Creating robust machine learning features from training data.
method Stochastic tensor space feature theory with Karhunen-Loeve expansion and hierarchical subspaces.
result Dramatic increases in accuracy for predicting Alzheimer's disease stages.
New conditions for GRW space-times to be perfect-fluid space-times.
problem Conditions for GRW space-times to be perfect-fluid.
method Gray's decomposition of the gradient of the Ricci tensor, determining Ricci tensor forms in invariant subspaces.
result For most GRW space-times, the Ricci tensor is Einstein or perfect fluid.
Efficient biclustering of tensor data for identifying similar signal patterns over time.
problem Identifying similar signal patterns over time in multi-dimensional data.
method Spectral decomposition to build biclusters.
result Quality of biclusters evaluated using synthetic and real data.
Paper perfect clusters sparse, diverse multilayer networks.
problem Clustering sparse, diverse multilayer networks.
method Tensor-based methodology pooling all layers' information.
result Achieves perfect clustering under sparser conditions than previous models.
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.
The study classifies Riemannian manifolds with curvature nullity.
problem Classifying Riemannian manifolds with nontrivial curvature nullity.
method Classification theorems based on curvature nullity, scalar curvature, and quotient existence.
result New classification theorems and revisited previous results.
The purpose of this paper is to classify α-para Kenmotsu manifolds M3 such that the projection of the image of concircular curvature tensor L in one-dimensional linear subspace of Tp(M3) generated by ξp is zero.
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…
An expansion is developed for the Weil-Petersson Riemann curvature tensor in the thin region of the Teichmüller and moduli spaces. The tensor is evaluated on the gradients of geodesic-lengths for disjoint geodesics. A precise lower bound for sectional curvature in terms of the surface systole is presented. The curvatur…
Study efficient estimation of hidden subspaces in Gaussian Multi-index models.
problem Estimating hidden subspaces in Gaussian Multi-index models with low-dimensional projections.
method Introduced the generative leap exponent and developed an agnostic sequential estimation procedure using spectral U-statistics.
result Achieved optimal sample complexity of $n=Θ(d^{1 \vee \k/2})$ for efficient estimation.
We consider two problems that arise in machine learning applications: the problem of recovering a planted sparse vector in a random linear subspace and the problem of decomposing a random low-rank overcomplete 3-tensor. For both problems, the best known guarantees are based on the sum-of-squares method. We develop new …
PixelHop++ improves image classification with a smaller model size.
problem Improving image classification models with smaller sizes.
method Decomposing input tensor, channel-wise Saab transform, successive subspace learning, feature ranking.
result PixelHop++ offers a flexible tradeoff between model size and performance.
Randomly shuffled kernels can be compressed efficiently.
problem Reducing storage cost of CNN parameters on resource-limited platforms.
method Randomly-shuffled tensor decomposition (RsTD) to embed kernels into random low-rank subspaces.
result CNNs can be significantly compressed even with randomly shuffled kernels, achieving more stable accuracy.
Study stability of Einstein manifolds with boundary.
problem Stability of Einstein manifolds with geometric boundary conditions.
method Using Ricci flow and calculus of variations, analyze stability with respect to the Einstein-Hilbert action.
result Introduce a new subspace of tensors (TVg tensors) for stability condition due to boundary constraints.