A Generalized Nesterov's Accelerated Gradient-Incorporated Non-Negative Latent-Factorization-of-Tensors Model for Efficient Representation to Dynamic QoS Data
Minzhi Chen, Renfang Wang, Yan Qiao, Xin Luo
Abstract
Dynamic Quality-of-Service (QoS) data can be efficiently represented by a Non-negative Latent-factorization-of-tensors model, which relies on a Non-negative and Multiplicative Update on Incomplete Tensors (NMU-IT) algorithm. Nevertheless, NMU-IT frequently encounters slow convergence and inefficient hyper-parameters selection. Targeting at overcome these critical defects, this paper proposed to improve the NMU-IT algorithm from two perspectives: a) integrating a generalized Nesterov's accelerated gradient method to accelerate the resultant model's convergence rate, and b) establishing the hyper-parameter adaptation mechanism through the particle swarm optimization strategy. On the basis of these conceptions, this study successfully builds a <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">G</u> eneralized Nesterov's Accelerated Gradient-incorporated <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</u> on-negative <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">L</u> atent-factorization-of-tensors (GNL) model for precisely and high-efficiently representing the dynamic QoS data. The proposed GNL model has shown its superiority over several advanced models concerning both the precision of estimating missing QoS data and training efficiency, as demonstrated by the experiments conducted on two dynamic QoS datasets.