Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
DOI10.1137/19M1299633zbMath1467.15022arXiv1911.03813MaRDI QIDQ5146702
Samantha N. Sherman, Tamara G. Kolda
Publication date: 26 January 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.03813
higher-order momentsGaussian mixture modelshigher-order cumulantssymmetric tensor decompositionimplicit tensor formation
Learning and adaptive systems in artificial intelligence (68T05) Multilinear algebra, tensor calculus (15A69) Numerical methods for low-rank matrix approximation; matrix compression (65F55)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Computing symmetric rank for symmetric tensors
- Multivariate skewness and kurtosis measures with an application in ICA
- A comparison of algorithms for fitting the PARAFAC model
- Anomaly detection in scientific data using joint statistical moments
- Numerical optimization for symmetric tensor decomposition
- Generating polynomials and symmetric tensor decompositions
- Tensor decompositions for learning latent variable models
- Learning Mixtures of Gaussians in High Dimensions
- Learning mixtures of spherical gaussians
- Estimation and Testing of Parameters in Multivariate Laplace Distribution
- Efficient Computation of Higher-Order Cumulant Tensors
- Shifted Power Method for Computing Tensor Eigenpairs
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Algorithm 778: L-BFGS-B
- The Sample Complexity of Multireference Alignment
- NPSA: Nonorthogonal Principal Skewness Analysis
- Fourier PCA and robust tensor decomposition
- Symmetric Tensors and Symmetric Tensor Rank
- Most Tensor Problems Are NP-Hard
This page was built for publication: Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
