Pages that link to "Item:Q5258607"
From MaRDI portal
The following pages link to Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking (Q5258607):
Displaying 6 items.
- On norm compression inequalities for partitioned block tensors (Q2174201) (← links)
- On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← 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)
- A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem (Q5376452) (← links)
- Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition (Q6087747) (← links)