The author introduces Alℓ0core, a new probabilistic tensor decomposition method that combines the computational tractability of canonical polyadic (CP) decomposition with the qualitative appeal of Tucker. The approach aims to achieve a middle ground between CP and Tucker by introducing a sparsity constraint on the core tensor.
Alℓ0core introduces a new probabilistic tensor decomposition method that balances computational efficiency and interpretability.