Pages that link to "Item:Q1741867"
From MaRDI portal
The following pages link to Computing dense tensor decompositions with optimal dimension trees (Q1741867):
Displaying 7 items.
- Decomposition-by-normalization (DBN): leveraging approximate functional dependencies for efficient CP and Tucker decompositions (Q1741131) (← links)
- On the optimization landscape of tensor decompositions (Q2144549) (← links)
- Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees (Q4603494) (← links)
- Exploiting Efficient Representations in Large-Scale Tensor Decompositions (Q4631411) (← links)
- Comparison of Accuracy and Scalability of Gauss--Newton and Alternating Least Squares for CANDECOMC/PARAFAC Decomposition (Q5009907) (← links)
- Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking (Q5258607) (← links)
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition (Q6087747) (← links)
