This work addresses the problem of learning sparse representations of tensor data using structured dictionary learning. It proposes learning a mixture of separable dictionaries to better capture the structure of tensor data by generalizing the separable dictionary learning model. Two different approaches for learning m…
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,695 papers · 148 categories
Trend · papers per month
48 results for “Tensor Separation Learning”
A tensor field generates separation of variables for certain metrics.
problem Finding metrics with specific tensor field properties.
method Constructing differential invariants for a -tensor field.
result Explicit system of invariants for metrics generating separation of variables.
Tensors play a central role in many modern machine learning and signal processing applications. In such applications, the target tensor is usually of low rank, i.e., can be expressed as a sum of a small number of rank one tensors. This motivates us to consider the problem of low rank tensor recovery from a class of lin…
Constructs orthogonal coordinates in curved spaces.
problem Separating variables in curved spaces.
method Explicit construction of orthogonal coordinates and transformations.
result Explicit formulas for Killing tensors and Stäckel matrices.
TSL learns separable models to avoid signal cancellation and off-support extrapolation.
problem Signal cancellation and off-support extrapolation in additive models.
method Tensor Separation Learning (TSL) via stagewise greedy procedure with orthogonal refitting.
result TSL avoids information loss caused by marginalizing higher-order interactions.
SRTC model for background/foreground separation with missing pixels.
problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.
The paper proves local laws for non-separable sample covariance matrices.
problem Analyzing non-separable sample covariance matrices with dependent or nonlinearly transformed data.
method Tensor network framework for analyzing fluctuation averaging in the presence of higher-order cumulant structure.
result Optimal averaged local law and full anisotropic local law for non-separable sample covariance matrices.
Tensor Decompositions Meet Control Theory: Learning General Mixtures of Linear Dynamical Systemscs.LG
New approach learns mixtures of linear dynamical systems without separation conditions.
problem Learning mixtures of linear dynamical systems with better fit or understanding.
method Tensor decompositions to learn mixtures of linear dynamical systems.
result Algorithm succeeds without strong separation conditions and can compete with Bayes optimal clustering.
Improved tensor GLM estimation for complex data.
problem Complex tensor data in GLMs leads to high-dimensional, ill-posed estimation.
method Proposed LSRTR-M algorithm using Muon updates for faster convergence and lower errors.
result LSRTR-M converges faster and achieves lower errors than LSRTR.
Community detection in graphs has been extensively studied both in theory and in applications. However, detecting communities in hypergraphs is more challenging. In this paper, we propose a tensor decomposition approach for guaranteed learning of communities in a special class of hypergraphs modeling social tagging sys…
In this work we propose a method for reducing the dimensionality of tensor objects in a binary classification framework. The proposed Common Mode Patterns method takes into consideration the labels' information, and ensures that tensor objects that belong to different classes do not share common features after the redu…
The fundamental tool in the classification of orthogonal coordinate systems in which the Hamilton-Jacobi and other prominent equations can be solved by a separation of variables are second order Killing tensors which satisfy the Nijenhuis integrability conditions. The latter are a system of three non-linear partial dif…
We solve the equivalence problem for the orthogonally separable webs on the three-sphere under the action of the isometry group. This continues a classical project initiated by Olevsky in which he solved the corresponding canonical forms problem. The solution to the equivalence problem together with the results by Olev…
Integrable Killing tensors are used to classify orthogonal coordinates in which the classical Hamilton-Jacobi equation can be solved by a separation of variables. We completely solve the Nijenhuis integrability conditions for Killing tensors on the sphere and give a set of isometry invariants for the integrabilit…
A simple self-supervised model for tensor RPCA using deep unfolding.
problem Tensor robust principal component analysis (RPCA) challenges in practical applications.
method Deep unfolding with only four hyperparameters.
result Competitive or superior performance compared to supervised methods, even in data-starved scenarios.
Extends multivariate regression for tensor-variate data, identifying brain regions and facial characteristics.
problem Challenges in fitting regression models with multivariate responses and covariates.
method Low-rank tensor formats on regression coefficients and tensor-variate normal distribution for errors.
result Maximum likelihood estimators for tensor-on-tensor regression via block-relaxation algorithms.
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.
We study the separability of the Neumann-Rosochatius system on the n-dimensional sphere using the geometry of bi-Hamiltonian manifolds. Its well-known separation variables are recovered by means of a separability condition relating the Hamiltonian with a suitable (1,1) tensor field on the sphere. This also allows us to…
Starting from a bundle E over R, the dual of the first jet bundle, which is a co-dimension 1 sub-bundle of the cotangent bundle of E, is the appropriate manifold for the geometric description of time-dependent Hamiltonian systems. Based on previous work, we recall properties of the complete lifts of a type (1,1) tensor…
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.
Tensors or {\em multi-way arrays} are functions of three or more indices -- similar to matrices (two-way arrays), which are functions of two indices for (row,column). Tensors have a rich history, stretching over almost a century, and touching upon numerous disciplines; but they have only recent…
Develops a new tensor model for clustering with degree correction.
problem Clustering with unknown degree heterogeneity in multiway data.
method Degree-corrected tensor block model with estimation guarantees.
result Demonstrates an intrinsic statistical-to-computational gap for tensors of order three or greater.
Study reveals new geometric structures for magnetic field Hamiltonian systems.
problem Understanding Hamiltonian systems in magnetic fields.
method Investigation of symplectic-Haantjes geometry.
result Non-trivial symplectic-Haantjes manifolds found.
We augment the nonnegative matrix factorization method for audio source separation with cues about directionality of sound propagation. This improves separation quality greatly and removes the need for training data, with only a twofold increase in run time. This is the first method which can exploit directional inform…
Matrix factorizations and their extensions to tensor factorizations and decompositions have become prominent techniques for linear and multilinear blind source separation (BSS), especially multiway Independent Component Analysis (ICA), NonnegativeMatrix and Tensor Factorization (NMF/NTF), Smooth Component Analysis (Smo…
Tensor-network techniques have enjoyed outstanding success in physics, and have recently attracted attention in machine learning, both as a tool for the formulation of new learning algorithms and for enhancing the mathematical understanding of existing methods. Inspired by these developments, and the natural correspond…
Efficiently analyzes multidimensional functional data using separable basis functions.
problem Curse of dimensionality in traditional functional data analysis.
method Marginal product basis systems for multidimensional data, tensor decomposition, differential operator-based penalties.
result Efficient estimation of multidimensional functional data representations.
The increasing use of multiple sensors, which produce a large amount of multi-dimensional data, requires efficient representation and classification methods. In this paper, we present a new method for multi-dimensional data classification that relies on two premises: 1) multi-dimensional data are usually represented by…
Necessary and/or sufficient conditions are studied for the existence, uniqueness and holonomicity of bases in which on sufficiently general subsets of a differentiable manifold the components of derivations of the tensor algebra over it vanish. The linear connections and the equivalence principle are considered form th…
Study recovers spike order in noisy tensor estimation without SNR assumptions.
problem Estimating multiple signal vectors from noisy tensor observations.
method Gradient flow optimization of a nonconvex function.
result Determines sample complexity for efficient permutation recovery.
Carter tensor analysis aids wave equation on Kerr-Newman spacetime.
problem Analyzing perturbations of Kerr-Newman spacetime using wave equation.
method Physical-space analysis adapted to Kerr-Newman spacetime, leveraging Carter operator commutation.
result Carter operator commutes with wave equation on Kerr-Newman spacetime, enabling wave equation analysis.
A method for online tensor dictionary learning is proposed. With the assumption of separable dictionaries, tensor contraction is used to diminish a -way model of into a simple matrix equation of with a real-time capability. To avoid numerical instability d…
In this paper we continue the study of bi-conformal vector fields started in {\em Class. Quantum Grav.} {\bf 21} 2153-2177. These are vector fields defined on a pseudo-Riemannian manifold by the differential conditions $\lie P_{ab}=φP_{ab}$, $\lieΠ_{ab}=χΠ_{ab}$ where , are orthogonal and complementary…
AMP algorithm for matrix tensor product model provides recovery conditions.
problem Generalization of standard spiked matrix models with multiple pairwise observations.
method Approximate message passing with optimal weighing and combining of estimates.
result Asymptotically exact performance description and necessary/sufficient recovery conditions.
New algorithm for nonnegative tensor completion with linear convergence rate.
problem Tensor completion without known optimal sample complexity rate.
method Integer optimization using a specific 0-1 polytope gauge norm.
result Achieves information-theoretic rate with linear convergence.
Closed conformal Killing-Yano tensor and uniqueness of generalized Kerr-NUT-de Sitter spacetimehep-th
The higher-dimensional Kerr-NUT-de Sitter spacetime describes the general rotating asymptotically de Sitter black hole with NUT parameters. It is known that such a spacetime possesses a rank-2 closed conformal Killing-Yano (CKY) tensor as a ``hidden'' symmetry which provides the separation of variables for the geodesic…
Tensor-EM method learns MoLDS from complex, noisy data.
problem Modeling diverse temporal dynamics in neural data.
method Tensor-based moment method followed by EM updates.
result Tensor-EM achieves more reliable recovery and robustness.
This work establishes universality for deep equivariant networks, overcoming limitations of previous approaches.
problem Rarity of universality results for equivariant neural networks, especially in high-dimensional settings.
method Develops a more general account of universality for equivariant networks, introducing entry-wise separability and readout layers.
result Deep equivariant networks achieve universality under entry-wise separability, with or without readout layers.
Paper studies nonnegative Tucker decomposition identifiability with sparsity conditions.
problem Identify nonnegative Tucker decomposition factors uniquely.
method Adapting NMF identifiability results, derive procedures using tensor unfoldings or slices.
result Nonnegative Tucker decomposition factors are identifiable under certain sparsity conditions.
Study of asymmetric rank-one tensor models with non-Gaussian noise.
problem Analyzing maximum-likelihood estimators for asymmetric rank-one tensor models.
method Spectrally separated branch analysis, resolvent methods, cumulant expansions, Efron-Stein-type variance bounds.
result Asymptotic singular value and mode-wise alignments are robust to non-Gaussian noise.
Spectral learning extends matrix methods to tensors for better latent variable modeling.
problem Limitations of matrix-based spectral methods in capturing non-Gaussian data.
method Extend spectral decomposition to tensor-based methods for higher-order moments.
result Tensor decomposition can identify latent effects missed by matrix methods.
Proves elliptic operator images are closed on Hilbert bundles.
problem Closedness of images of elliptic operators on Hilbert bundles.
method Analyzes tensor product of elliptic operators and compares images.
result Establishes closedness of images with respect to natural topology.
TGCCA analyzes higher-order tensors using orthogonal rank-R CP decomposition.
problem Handling higher-order structures in multi-block data analysis.
method Tensor Generalized Canonical Correlation Analysis (TGCCA) with orthogonal rank-R CP decomposition.
result TGCCA outperforms state-of-the-art methods on simulated and real data.
Low-rank tensor completion recovers missing entries based on different tensor decompositions. Due to its outstanding performance in exploiting some higher-order data structure, low rank tensor ring has been applied in tensor completion. To further deal with its sensitivity to sparse component as it does in tensor princ…
Develops efficient algorithms for learning latent-variable models using implicit moment tensor computation.
problem Learning latent-variable models with moment tensors of super-constant degree.
method Implicit moment tensor computation for general models, extending previous work on clustering mixtures of spherical Gaussians.
result First poly(d, k) time learning algorithms for various models including mixtures of linear regressions, spherical Gaussians, and positive linear combinations of non-linear activations.
This paper derives sufficient conditions for local recovery of coordinate dictionaries comprising a Kronecker-structured dictionary that is used for representing th-order tensor data. Tensor observations are assumed to be generated from a Kronecker-structured dictionary multiplied by sparse coefficient tensors that …
Study of Langevin dynamics for tensor PCA recovery in high dimensions.
problem Recovering hidden signal vectors (spikes) from noisy Gaussian tensor observations.
method Langevin dynamics approach for nonconvex optimization.
result Sample complexity matches the single-spike case but degrades for all spikes.
Alteration Detection of Tensor Dependence Structure via Sparsity-Exploited Reranking Algorithmstat.ME
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.