Weighted Tensor Decomposition for Learning Latent Variables with Partial Data
Not on the map. Why?
Abstract (arXiv)
Tensor decomposition methods are popular tools for learning latent variables given only lower-order moments of the data. However, the standard assumption is that we have sufficient data to estimate these moments to high accuracy. In this work, we consider the case in which certain dimensions of the data are not always observed---common in applied settings, where not all measurements may be taken for all observations---resulting in moment estimates of varying quality. We derive a weighted tensor decomposition approach that is computationally as efficient as the non-weighted approach, and demonstrate that it outperforms methods that do not appropriately leverage these less-observed dimensions.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 18 Oct 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.