动态时间弯曲空间的非光滑分析与次梯度平均方法
Nonsmooth Analysis and Subgradient Methods for Averaging in Dynamic Time Warping Spaces
摘要:
动态时间规整(DTW)空间中的时间序列平均已成功地应用于改进模式识别系统。本文提出并分析了次梯度方法在DTW空间中寻找样本均值的问题。这类次梯度方法推广了现有的样本均值算法,如DTW重心平均(DBA)。我们表明,DBA是一个优化最小化算法,收敛到必要条件的最优性后,许多迭代。实验结果表明,随着样本容量的增加,所提出的随机次梯度(SSG)算法是更稳定的,并找到更好的解决方案,在更短的时间比DBA算法的平均。因此,SSG在在线设置和非小样本量中很有用。理论和实证结果为设计样本均值算法开辟了新的途径:非光滑优化方法和成对平均方法的修改变体。
英文摘要:
Time series averaging in dynamic time warping (DTW) spaces has been successfully applied to improve pattern recognition systems. This article proposes and analyzes subgradient methods for the problem of finding a sample mean in DTW spaces. The class of subgradient methods generalizes existing sample mean algorithms such as DTW Barycenter Averaging (DBA). We show that DBA is a majorize-minimize algorithm that converges to necessary conditions of optimality after finitely many iterations. Empirical results show that for increasing sample sizes the proposed stochastic subgradient (SSG) algorithm is more stable and finds better solutions in shorter time than the DBA algorithm on average. Therefore, SSG is useful in online settings and for non-small sample sizes. The theoretical and empirical results open new paths for devising sample mean algorithms: nonsmooth optimization methods and modified variants of pairwise averaging methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。