MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
From MaRDI portal
Recommendations
- Scaling Probabilistic Tensor Canonical Polyadic Decomposition to Massive Data
- Optimization-based algorithms for tensor decompositions: canonical polyadic decomposition, decomposition in rank-(L_r,L_r,1) terms, and a new generalization
- On the optimization landscape of tensor decompositions
- Probabilistic Tensor Canonical Polyadic Decomposition With Orthogonal Factors
- An adaptive algebraic multigrid algorithm for low-rank canonical tensor decomposition
- Generalized canonical polyadic tensor decomposition
- Multiscale co-clustering for tensor data based on canonical polyadic decomposition and slice-wise factorization
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions
- Dictionary-Based Tensor Canonical Polyadic Decomposition
- Optimization via separated representations and the canonical tensor decomposition
Cites work
Cited in
(4)- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions
- Multiscale co-clustering for tensor data based on canonical polyadic decomposition and slice-wise factorization
- Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
- Stochastic gradients for large-scale tensor decomposition
This page was built for publication: MuLOT: multi-level optimization of the canonical polyadic tensor decomposition at large-scale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140454)