Pages that link to "Item:Q3458827"
From MaRDI portal
The following pages link to Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations (Q3458827):
Displaying 10 items.
- A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization (Q1790683) (← links)
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer (Q2161912) (← links)
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications (Q2189661) (← links)
- Stochastic Gradients for Large-Scale Tensor Decomposition (Q5037555) (← links)
- Generalized Canonical Polyadic Tensor Decomposition (Q5216247) (← links)
- Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking (Q5258607) (← links)
- Rank decomposition and symmetric rank decomposition over arbitrary fields (Q5870127) (← links)
- WINTENDED: WINdowed TENsor decomposition for densification event detection in time-evolving networks (Q6155196) (← links)
- Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering (Q6593833) (← links)
- Taming numerical imprecision by adapting the KL divergence to negative probabilities (Q6606973) (← links)
