Generalized Canonical Polyadic Tensor Decomposition
From MaRDI portal
Publication:5216247
DOI10.1137/18M1203626zbMath1432.68385arXiv1808.07452OpenAlexW3005990752MaRDI QIDQ5216247
Jed A. Duersch, David Hong, Tamara G. Kolda
Publication date: 17 February 2020
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.07452
missing dataCANDECOMPPARAFACcanonical polyadic tensor decompositionPoisson tensor factorizationBernoulli tensor factorization
Learning and adaptive systems in artificial intelligence (68T05) Multilinear algebra, tensor calculus (15A69) Missing data (62D10)
Related Items (15)
An optimal statistical and computational framework for generalized tensor estimation ⋮ Stochastic Gradients for Large-Scale Tensor Decomposition ⋮ Tensor factorization recommender systems with dependency ⋮ Generalized Tensor Decomposition With Features on Multiple Modes ⋮ Half-quadratic alternating direction method of multipliers for robust orthogonal tensor approximation ⋮ Generalized co-clustering analysis via regularized alternating least squares ⋮ Accelerated doubly stochastic gradient descent for tensor CP decomposition ⋮ Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations ⋮ Software for Sparse Tensor Decomposition on Emerging Computing Architectures ⋮ A proximal point like method for solving tensor least-squares problems ⋮ On Koopman mode decomposition and tensor component analysis ⋮ Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints ⋮ Unnamed Item ⋮ Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors ⋮ Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Families of alpha-, beta- and gamma-divergences: flexible and robust measures of similarities
- Tensor-product approximation to operators and functions in high dimensions
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Positive tensor factorization
- Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data
- Generalized Low Rank Models
- Algorithms for Nonnegative Matrix Factorization with the β-Divergence
- Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations
- Algorithm 862
- Multivariate Regression and Machine Learning with Sums of Separable Functions
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Numerical operator calculus in higher dimensions
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- A Limited Memory Algorithm for Bound Constrained Optimization
- On Tensors, Sparsity, and Nonnegative Factorizations
- Low Complexity Damped Gauss--Newton Algorithms for CANDECOMP/PARAFAC
- Learning the parts of objects by non-negative matrix factorization
- Robust Estimation of a Location Parameter
- Algorithms for Numerical Analysis in High Dimensions
This page was built for publication: Generalized Canonical Polyadic Tensor Decomposition