To refer to this page use:
|Abstract:||Low rank decomposition of tensors is a powerful tool for learning generative models. The uniqueness results that hold for tensors give them a significant advantage over matrices. However, tensors pose serious algorithmic challenges; in particular, much of the matrix algebra toolkit fails to generalize to tensors. Efficient decomposition in the overcomplete case (where rank exceeds dimension) is particularly challenging. We introduce a smoothed analysis model for studying these questions and develop an efficient algorithm for tensor decomposition in the highly overcomplete case (rank polynomial in the dimension). In this setting, we show that our algorithm is robust to inverse polynomial error -- a crucial property for applications in learning since we are only allowed a polynomial number of samples. While algorithms are known for exact tensor decomposition in some overcomplete settings, our main contribution is in analyzing their stability in the framework of smoothed analysis. Our main technical contribution is to show that tensor products of perturbed vectors are linearly independent in a robust sense (i.e. the associated matrix has singular values that are at least an inverse polynomial). This key result paves the way for applying tensor methods to learning problems in the smoothed setting. In particular, we use it to obtain results for learning multi-view models and mixtures of axis-aligned Gaussians where there are many more "components" than dimensions. The assumption here is that the model is not adversarially chosen, which we formalize by thinking of the model parameters as being perturbed. We believe this an appealing way to analyze realistic instances of learning problems, since this framework allows us to overcome many of the usual limitations of using tensor methods.|
|Citation:||Bhaskara, Aditya, Moses Charikar, Ankur Moitra, and Aravindan Vijayaraghavan. "Smoothed analysis of tensor decompositions." In Proceedings of the forty-sixth annual ACM symposium on Theory of computing (2014): 594-603. doi: 10.1145/2591796.2591881|
|Pages:||594 - 603|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of the Annual ACM Symposium on Theory of Computing|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.