Nonnegative tensor decomposition has become increasingly important for multiway data analysis in recent years. The alternating proximal gradient(APG) is a popular optimization method for nonnegative tensor decompositi...Nonnegative tensor decomposition has become increasingly important for multiway data analysis in recent years. The alternating proximal gradient(APG) is a popular optimization method for nonnegative tensor decomposition in the block coordinate descent framework. In this study, we propose an inexact version of the APG algorithm for nonnegative CANDECOMP/PARAFAC decomposition, wherein each factor matrix is updated by only finite inner iterations. We also propose a parameter warm-start method that can avoid the frequent parameter resetting of conventional APG methods and improve convergence performance.By experimental tests, we find that when the number of inner iterations is limited to around 10 to 20, the convergence speed is accelerated significantly without losing its low relative error. We evaluate our method on both synthetic and real-world tensors.The results demonstrate that the proposed inexact APG algorithm exhibits outstanding performance on both convergence speed and computational precision compared with existing popular algorithms.展开更多
Array of Things (AoT)通过单一位置上的多传感器对城市系统进行连续动态观测。AoT观测数据量大且持续增长,使得如何利用有限的计算资源进行AoT序列数据的压缩传输成为其应用的关键瓶颈之一。本文提出了一种基于张量分解的AoT序列数据...Array of Things (AoT)通过单一位置上的多传感器对城市系统进行连续动态观测。AoT观测数据量大且持续增长,使得如何利用有限的计算资源进行AoT序列数据的压缩传输成为其应用的关键瓶颈之一。本文提出了一种基于张量分解的AoT序列数据的有损压缩方法。面向其海量、高维且需在传感器端处理的需求,该方法首先将AoT序列数据组织成高维张量,利用算法复杂度较低的张量CANDECOMP/PARAFAC (CP)分解提取各维度上的特征主分量,而后利用张量重构实现特征保持的数据有损压缩。利用基于张量分解的有损压缩方法,针对美国芝加哥市区的24 h内感测的声光电磁数据进行了实验,讨论了不同压缩参数对压缩比、压缩误差、压缩精度、压缩时间、压缩过程运行内存占用和压缩结果内存占用之间的影响。实验结果表明该方法可实现AoT序列数据的有损压缩,其较小的内存占用能够支持传感器端数据压缩。并且与原始光场强度对比表明,压缩后的数据保持了原有时空分布特征。与传统矢量量化编码压缩方法相比,在相同压缩精度下,本文方法的压缩比约高27%~76%,压缩时间约节省46%~73%,压缩结果所占内存约节省17%~57%,因此本文方法具有更高的压缩比,更低的压缩时间和内存占用,可为Ao T这一类数据的大规模有损压缩提供借鉴意义。展开更多
基金This work was supported by the National Natural Science Foundation of China(Grant No.91748105)the National Foundation in China(Grant Nos.JCKY2019110B009 and 2020-JCJQ-JJ-252)+1 种基金the Fundamental Research Funds for the Central Universities(Grant Nos.DUT20LAB303 and DUT20LAB308)in Dalian University of Technology in Chinathe scholarship from China Scholarship Council(Grant No.201600090043)。
文摘Nonnegative tensor decomposition has become increasingly important for multiway data analysis in recent years. The alternating proximal gradient(APG) is a popular optimization method for nonnegative tensor decomposition in the block coordinate descent framework. In this study, we propose an inexact version of the APG algorithm for nonnegative CANDECOMP/PARAFAC decomposition, wherein each factor matrix is updated by only finite inner iterations. We also propose a parameter warm-start method that can avoid the frequent parameter resetting of conventional APG methods and improve convergence performance.By experimental tests, we find that when the number of inner iterations is limited to around 10 to 20, the convergence speed is accelerated significantly without losing its low relative error. We evaluate our method on both synthetic and real-world tensors.The results demonstrate that the proposed inexact APG algorithm exhibits outstanding performance on both convergence speed and computational precision compared with existing popular algorithms.
文摘Array of Things (AoT)通过单一位置上的多传感器对城市系统进行连续动态观测。AoT观测数据量大且持续增长,使得如何利用有限的计算资源进行AoT序列数据的压缩传输成为其应用的关键瓶颈之一。本文提出了一种基于张量分解的AoT序列数据的有损压缩方法。面向其海量、高维且需在传感器端处理的需求,该方法首先将AoT序列数据组织成高维张量,利用算法复杂度较低的张量CANDECOMP/PARAFAC (CP)分解提取各维度上的特征主分量,而后利用张量重构实现特征保持的数据有损压缩。利用基于张量分解的有损压缩方法,针对美国芝加哥市区的24 h内感测的声光电磁数据进行了实验,讨论了不同压缩参数对压缩比、压缩误差、压缩精度、压缩时间、压缩过程运行内存占用和压缩结果内存占用之间的影响。实验结果表明该方法可实现AoT序列数据的有损压缩,其较小的内存占用能够支持传感器端数据压缩。并且与原始光场强度对比表明,压缩后的数据保持了原有时空分布特征。与传统矢量量化编码压缩方法相比,在相同压缩精度下,本文方法的压缩比约高27%~76%,压缩时间约节省46%~73%,压缩结果所占内存约节省17%~57%,因此本文方法具有更高的压缩比,更低的压缩时间和内存占用,可为Ao T这一类数据的大规模有损压缩提供借鉴意义。
