Nesterov-Based Parallel Algorithm For Large-Scale Nonnegative Tensor Factorization
2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP)(2017)
摘要
We consider the problem of nonnegative tensor factorization. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization (AO) framework and solve each matrix nonnegative least-squares problem via a Nesterov-type algorithm for strongly convex problems. We describe a parallel implementation of the algorithm and measure the speedup attained by its Message Passing Interface implementation on a parallel computing environment. It turns out that the attained speedup is significant, rendering our algorithm a competitive candidate for the solution of very large-scale dense nonnegative tensor factorization problems.
更多查看译文
关键词
Tensors, constrained optimization, CANDECOMP, PARAFAC, nonnegative factorization, parallel algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络