mlsanityData to 7 Oct 2026

Correlating Time Series with Interpretable Convolutional Kernels

arXiv 2409.01362 ↗First posted 2 Sep 2024cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 10 of its 39 references that are in the map. First posted on arXiv 2 Sep 2024.

Builds on

10 of 39 references.

References · 10

  1. 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
  2. 2018Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overviewcited by 159
  3. 2014Dynamic mode decomposition with controlcited by 128
  4. 2015Best Subset Selection via a Modern Optimization Lenscited by 99
  5. 2013Regularized estimation in sparse high-dimensional time series modelscited by 40
  6. 2023Graph Signal Processing: History, Development, Impact, and Outlookcited by 39
  7. 2022Learning Sparse Nonlinear Dynamics via Mixed-Integer Optimizationcited by 29
  8. 2022Laplacian Convolutional Representation for Traffic Time Series Imputationcited by 18
  9. 2019Recovery of Future Data via Convolution Nuclear Norm Minimizationcited by 11
  10. 2021Slowly Varying Regression under Sparsitycited by 7

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.