Journal of the American Statistical Association · 2014 · 61 citations · 39 references
ComputingComputer ScienceBayesian Data AnalysisMachine LearningParallel ComputingBayesian ComputationBayesian InferenceDimension ReductionDimensionality ReductionFactor AnalysisMatrix FactorizationBayesian Matrix FactorizationGibbs SamplingHigh-dimensional StatisticsLow-rank Matrix FactorizationParallel Matrix FactorizationPosterior Concentration RatesTensor DecompositionsTensor Factorization
It has become routine to collect data that are structured as multiway arrays (tensors). There is an enormous literature on low rank and sparse matrix factorizations, but limited consideration of extensions to the tensor case in statistics. The most common low rank tensor factorization relies on parallel factor analysis (PARAFAC), which expresses a rank k tensor as a sum of rank one tensors. When observations are only available for a tiny subset of the cells of a big tensor, the low rank assumption is not sufficient and PARAFAC has poor performance. We induce an additional layer of dimension reduction by allowing the effective rank to vary across dimensions of the table. For concreteness, we focus on a contingency table application. Taking a Bayesian approach, we place priors on terms in the factorization and develop an efficient Gibbs sampler for posterior computation. Theory is provided showing posterior concentration rates in high-dimensional settings, and the methods are shown to have excellent performance in simulations and several real data applications.
39
Learning the parts of objects by non-negative matrix factorization
Daniel D. Lee, H. Sebastian Seung · Nature · 1999 · 14.1K citations
Tensor Decompositions and Applications
Tamara G. Kolda, Brett W. Bader · SIAM Review · 2009 · 10.5K citations
Trevor Park, George Casella · Journal of the American Statistical Association · 2008 · 3K citations
PARAFAC. Tutorial and applications
Rasmus Bro · Chemometrics and Intelligent Laboratory Systems · 1997 · 2.8K citations