关于SFA实现sfa-tk的数值稳定性
On the numeric stability of the SFA implementation sfa-tk
摘要:
慢特征分析(SFA)是一种从快速变化的多维信号中提取慢变化特征的方法。一个开源的Matlab实现sfa-tk使SFA易于使用。我们在这里表明,在某些情况下,即当非线性扩展的数据的协方差阵不具有满秩,这种实现运行到数值不稳定性。我们提出了一种基于奇异值分解(SVD)的改进算法,即使在矩阵的秩仅小于其大小的10%的情况下,该算法也没有这些不稳定性。此外,我们表明,处理数值问题的另一种方法是注入少量的噪声到多维输入信号,可以恢复秩不足的协方差阵满秩,但在修改原始数据的价格和噪声参数调整的需要。
英文摘要:
Slow feature analysis (SFA) is a method for extracting slowly varying features from a quickly varying multidimensional signal. An open source Matlab-implementation sfa-tk makes SFA easily useable. We show here that under certain circumstances, namely when the covariance matrix of the nonlinearly expanded data does not have full rank, this implementation runs into numerical instabilities. We propse a modified algorithm based on singular value decomposition (SVD) which is free of those instabilities even in the case where the rank of the matrix is only less than 10% of its size. Furthermore we show that an alternative way of handling the numerical problems is to inject a small amount of noise into the multidimensional input signal which can restore a rank-deficient covariance matrix to full rank, however at the price of modifying the original data and the need for noise parameter tuning.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。