arXiv:2409.01362cs.LGcs.AI2024-09被引 6

通过稀疏与非负约束,自动学习可解释的时间序列卷积核。

Correlating Time Series with Interpretable Convolutional Kernels

  • 将卷积核学习建模为带非负约束的稀疏回归问题。
  • 在纽约、芝加哥网约车数据中发现周周期等可解释模式。
  • 适合需要理解时间模式的时序分析任务,如流体重建。

本研究针对单变量、多变量及多维时间序列中的卷积核学习问题,该问题对解析时间模式并支持下游机器学习任务至关重要。首先,将单变量时间序列的卷积核学习表述为具有非负约束的稀疏回归问题,利用循环卷积和循环矩阵的性质。其次,为推广至多变量与多维时间序列,采用张量计算,将卷积核学习问题转化为张量形式,并通过向量化与张量展开操作转换为标准稀疏回归问题。优化过程采用现有的非负子空间追踪方法,使卷积核能捕捉时间相关性与模式。在多个真实世界时间序列数据集上评估模型:在纽约与芝加哥的多维共享出行数据中,卷积核揭示了可解释的局部相关性与周期模式(如周周期);在多维流体流动数据中,卷积核捕获的局部与非局部相关性可增强张量分解,在流体重建任务中提升性能。本研究为从时间序列中自动学习卷积核提供了有洞察力的基础,强调通过稀疏性与非负性实现可解释性。

原文摘要 · Abstract (English)

This study addresses the problem of convolutional kernel learning in univariate, multivariate, and multidimensional time series data, which is crucial for interpreting temporal patterns in time series and supporting downstream machine learning tasks. First, we propose formulating convolutional kernel learning for univariate time series as a sparse regression problem with a non-negative constraint, leveraging the properties of circular convolution and circulant matrices. Second, to generalize this approach to multivariate and multidimensional time series data, we use tensor computations, reformulating the convolutional kernel learning problem in the form of tensors. This is further converted into a standard sparse regression problem through vectorization and tensor unfolding operations. In the proposed methodology, the optimization problem is addressed using the existing non-negative subspace pursuit method, enabling the convolutional kernel to capture temporal correlations and patterns. To evaluate the proposed model, we apply it to several real-world time series datasets. On the multidimensional rideshare and taxi trip data from New York City and Chicago, the convolutional kernels reveal interpretable local correlations and cyclical patterns, such as weekly seasonality. In the context of multidimensional fluid flow data, both local and nonlocal correlations captured by the convolutional kernels can reinforce tensor factorization, leading to performance improvements in fluid flow reconstruction tasks. Thus, this study lays an insightful foundation for automatically learning convolutional kernels from time series data, with an emphasis on interpretability through sparsity and non-negativity constraints.

时间序列可解释性张量计算卷积核

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。