A Decomposition for Three-Way Arrays
From MaRDI portal
Recommendations
- The typical rank of tall three-way arrays
- On uniqueness in CANDECOMP/PARAFAC
- Typical rank and indscal dimensionality for symmetric three-way arrays of order I 2 2 or I 3 3
- Some numerical results on the rank of generic three-way arrays over \(\mathbb{R}\)
- A singular value decomposition of a \(k\)-way array for a principal component analysis of multiway data, \(\text{PTA-}k\)
Cited in
(63)- Multilinear models: applications in spectroscopy. With comments by Jan de Leeuw, Pieter M. Kroonenberg and Donald S. Burdick and a rejoinder by the authors
- On the spectral problem for trivariate functions
- A new method of moments for latent variable models
- A stabilized normal form algorithm for generic systems of polynomial equations
- Weighted tridiagonal matrix enhanced multivariance products representation (WTMEMPR) for decomposition of multiway arrays: applications on certain chemical system data sets
- Typical rank and indscal dimensionality for symmetric three-way arrays of order I 2 2 or I 3 3
- Dimensionality reduction in higher-order signal processing and rank-\((R_1,R_2,\ldots,R_N)\) reduction in multilinear algebra
- A contemporary linear representation theory for ordinary differential equations: multilinear algebra in folded arrays (folarrs) perspective and its use in multidimensional case
- Bilinear factorizations subject to monomial equality constraints via tensor decompositions
- Tensor decomposition for learning Gaussian mixtures from moments
- The typical rank of tall three-way arrays
- Sufficient conditions for uniqueness in Candecomp/Parafac and Indscal with random component matrices
- A spectral algorithm for latent Dirichlet allocation
- Condition numbers for the tensor rank decomposition
- Numerical multilinear algebra and its applications
- Some numerical results on the rank of generic three-way arrays over \(\mathbb{R}\)
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Canonical polyadic decomposition of third-order tensors: relaxed uniqueness conditions and algebraic algorithm
- Imposing Independence Constraints in the CP Model
- A probabilistic foundation for dynamical systems: theoretical background and mathematical formulation
- Low rank symmetric tensor approximations
- Systems of polynomial equations, higher-order tensor decompositions, and multidimensional harmonic retrieval: a unifying framework. Part I: the canonical polyadic decomposition
- Multi-reference alignment in high dimensions: sample complexity and phase transition
- The sample complexity of multireference alignment
- Overcomplete order-3 tensor decomposition, blind deconvolution, and Gaussian mixture models
- (L_r,L_r,1)-decompositions, sparse component analysis, and the blind separation of sums of exponentials
- scientific article; zbMATH DE number 7409363 (Why is no real title available?)
- Nonparametric modeling of higher-order interactions via hypergraphons
- Finding a low-rank basis in a matrix subspace
- Pencil-based algorithms for tensor rank decomposition are not stable
- Fiber sampling approach to canonical polyadic decomposition and application to tensor completion
- The dynamics of swamps in the canonical tensor approximation problem
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_r,n,L_r,n,1)\) terms. I: Uniqueness
- Effective criteria for specific identifiability of tensors and forms
- Hankel Tensor Decompositions and Ranks
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_{r,n},L_{r,n},1)\) terms. II: Algorithms
- News algorithms for tensor decomposition based on a reduced functional
- A recursive eigenspace computation for the canonical polyadic decomposition
- Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
- A review on octupolar tensors
- Generic identifiability of pairs of ternary forms
- An algorithm for the non-identifiability of rank-3 tensors
- Learning polynomial transformations via generalized tensor decompositions
- Average-case complexity of tensor decomposition for low-degree polynomials
- Decomposition of a tensor into multilinear rank-(M_r,N_r,) terms
- A normal form algorithm for tensor rank decomposition
- Uniqueness proof for a family of models sharing features of Tucker's three-mode factor analysis and PARAFAC/CANDECOMP
- Tensor decomposition beyond uniqueness, with an application to the minrank problem
- A direct method for computing the complex-valued triple decomposition of third-order tensors
- Partially observable RL: benign structures and simple generic algorithms
- Small ball probabilities for simple random tensors
- Reducing swamp behavior for the canonical polyadic decomposition problem by rank-1 freezing
- Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
- On uniqueness of power sum decomposition
- A low-rank tensor completion method via Strassen-Ottaviani flattening
- Gaussian mixture identifiability from degree 6 moments
- Low rank tensor decompositions and approximations
- Subspace power method for symmetric tensor decomposition
- A chiseling algorithm for low-rank Grassmann decomposition of skew-symmetric tensors
- Hadamard-Hitchcock decompositions: identifiability and computation
- Hankel tensor completion via two-layer optimization for functional magnetic resonance images recovery
- Blind PARAFAC signal detection for polarization sensitive array
- 4D near-field source localization using cumulant
This page was built for publication: A Decomposition for Three-Way Arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142611)
