Routing Channel-Patch Dependencies in Time Series Forecasting with Graph Spectral Decomposition

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Li, Dongyuan, Zheng, Shun, Xu, Chang, Bian, Jiang, Jiang, Renhe
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914392948342784
author Li, Dongyuan
Zheng, Shun
Xu, Chang
Bian, Jiang
Jiang, Renhe
author_facet Li, Dongyuan
Zheng, Shun
Xu, Chang
Bian, Jiang
Jiang, Renhe
contents Time series forecasting has attracted significant attention in the field of AI. Previous works have revealed that the Channel-Independent (CI) strategy improves forecasting performance by modeling each channel individually, but it often suffers from poor generalization and overlooks meaningful inter-channel interactions. Conversely, Channel-Dependent (CD) strategies aggregate all channels, which may introduce irrelevant information and lead to oversmoothing. Despite recent progress, few existing methods offer the flexibility to adaptively balance CI and CD strategies in response to varying channel dependencies. To address this, we propose a generic plugin xCPD, that can adaptively model the channel-patch dependencies from the perspective of graph spectral decomposition. Specifically, xCPD first projects multivariate signals into the frequency domain using a shared graph Fourier basis, and groups patches into low-, mid-, and high-frequency bands based on their spectral energy responses. xCPD then applies a channel-adaptive routing mechanism that dynamically adjusts the degree of inter-channel interaction for each patch, enabling selective activation of frequency-specific experts. This facilitates fine-grained input-aware modeling of smooth trends, local fluctuations, and abrupt transitions. xCPD can be seamlessly integrated on top of existing CI and CD forecasting models, consistently enhancing both accuracy and generalization across benchmarks. The code is available https://github.com/Clearloveyuan/xCPD.
format Preprint
id arxiv_https___arxiv_org_abs_2603_13702
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Routing Channel-Patch Dependencies in Time Series Forecasting with Graph Spectral Decomposition
Li, Dongyuan
Zheng, Shun
Xu, Chang
Bian, Jiang
Jiang, Renhe
Machine Learning
Artificial Intelligence
Time series forecasting has attracted significant attention in the field of AI. Previous works have revealed that the Channel-Independent (CI) strategy improves forecasting performance by modeling each channel individually, but it often suffers from poor generalization and overlooks meaningful inter-channel interactions. Conversely, Channel-Dependent (CD) strategies aggregate all channels, which may introduce irrelevant information and lead to oversmoothing. Despite recent progress, few existing methods offer the flexibility to adaptively balance CI and CD strategies in response to varying channel dependencies. To address this, we propose a generic plugin xCPD, that can adaptively model the channel-patch dependencies from the perspective of graph spectral decomposition. Specifically, xCPD first projects multivariate signals into the frequency domain using a shared graph Fourier basis, and groups patches into low-, mid-, and high-frequency bands based on their spectral energy responses. xCPD then applies a channel-adaptive routing mechanism that dynamically adjusts the degree of inter-channel interaction for each patch, enabling selective activation of frequency-specific experts. This facilitates fine-grained input-aware modeling of smooth trends, local fluctuations, and abrupt transitions. xCPD can be seamlessly integrated on top of existing CI and CD forecasting models, consistently enhancing both accuracy and generalization across benchmarks. The code is available https://github.com/Clearloveyuan/xCPD.
title Routing Channel-Patch Dependencies in Time Series Forecasting with Graph Spectral Decomposition
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2603.13702