MLOct 18, 2017

Weighted Tensor Decomposition for Learning Latent Variables with Partial Data

arXiv:1710.06818v12 citations
Originality Incremental advance
AI Analysis

This addresses a common issue in applied settings with incomplete measurements, offering an incremental improvement over standard tensor decomposition methods.

The paper tackles the problem of learning latent variables from partial data where some dimensions are missing, by developing a weighted tensor decomposition method that is computationally efficient and outperforms existing approaches that do not account for varying data quality.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes