Next Article in Journal
PSO-XGBoost-Based Method for In Situ Stress Inversion
Previous Article in Journal
A Method for Filling Blank Stripes in Electrical Imaging Based on the Fusion of Arbitrary Kernel Convolution and Generative Adversarial Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Time–Frequency Parallel and Channel-Adaptive Gating for Multivariate Time Series Prediction

School of Computer Science, China University of Geosciences (Wuhan), Wuhan 430074, China
*
Author to whom correspondence should be addressed.
Appl. Sci. 2026, 16(7), 3266; https://doi.org/10.3390/app16073266
Submission received: 11 March 2026 / Revised: 25 March 2026 / Accepted: 26 March 2026 / Published: 27 March 2026
(This article belongs to the Section Computing and Artificial Intelligence)

Abstract

In real-world scenarios, multivariate time series data typically presents a variety of complex characteristics simultaneously, including long-term trends, multiple seasonality, sudden event disturbances and random noise. Owing to remarkable discrepancies among different variables in dimensions, periodic stability and other aspects, and the gradual evolution of these periodic characteristics over time, models are confronted with numerous challenges in handling non-stationarity, multi-scale dynamic variations and heterogeneous fusion of variables. To tackle these problems, this paper proposes a time–frequency parallel fusion framework—TFDG-Net (Time–Frequency Dual-Branch Gated Fusion Network). This framework models the prior information in the frequency domain and the temporal query network in the time domain in parallel, and introduces a channel-wise gating mechanism to achieve more flexible adaptive fusion after data inverse normalization. Such a design enables the model to operate collaboratively on the original physical scale, which not only improves the long-term prediction capability for periodically stable variables, but also effectively suppresses the interference of noise and event-driven factors, thus significantly enhancing prediction accuracy and the robustness of the training process. In multiple long-term prediction benchmark tests covering fields such as energy and finance, compared with various mainstream models, TFDG-Net reduces the mean squared error and mean absolute error by an average of 12.0% and 7.8% respectively.

1. Introduction

Multivariate time series forecasting (MTSF) plays a pivotal role in numerous critical application domains, encompassing real-world scenarios such as traffic scheduling, financial risk control, industrial process monitoring, power and renewable energy dispatch, and healthcare management [1,2,3]. Unlike natural language or image tasks, real-world time series data generally exhibit the following characteristics: First, they demonstrate significant non-stationarity, manifested as slow drifts in long-term trends and seasonal or cyclical components over time, along with distributional shifts across different stages. Second, time series contain both stable short-term and long-term periodicities, yet are frequently accompanied by event-triggered drastic fluctuations and broadband noise interference. Third, there exists heterogeneity and dynamic coupling among multiple variables; different channels exhibit distinct scales, periodicities, and noise properties [4,5]. These complexities imply that forecasting models must not only possess the capability for accurate extrapolation of long-term cycles but also maintain robustness and adaptability when facing non-periodic disturbances and changes in data distribution [6].
Although various deep learning methods have made progress in their respective dimensions, they still face three universal challenges: First, pure time-domain end-to-end learning often requires the model to independently discover and align periodic structures. When phases drift slowly or amplitudes are modulated by external processes (e.g., weekday/weekend cycles, seasonal transitions, or changes in operating conditions), both training difficulty and sample complexity increase significantly. Second, while performing complex attention mechanisms directly in the frequency domain or simultaneously learning complex spectral magnitudes and phases offers strong expressiveness, such approaches are computationally heavy in both implementation and training. Moreover, phase learning tends to be unstable in the presence of drift and noise. Third, since prior information among multivariate variables is correlated but not universally applicable, a lack of channel-level fine-grained adaptive mechanisms in models can easily lead to over-correction or even performance degradation on channels with weak periodicity or high volatility. The temporal query (TQ) framework provides an effective structural prior for scenarios with strong periodicity: it retrieves query sequences consistent with the input length from a learnable query table via periodic indexing and interacts them with observed features, thereby achieving alignment and template reuse across different phases within the same cycle. TQNet [7], a representative baseline in this direction, relies on temporal queries and cross-channel aggregation to demonstrate robustness across various periodic tasks. However, as it remains confined to the paradigm of time-domain modeling and structural priors, there is still room for improvement when addressing complex scenarios that require frequency-domain extrapolation and explicit correction of periodic errors.
To address the aforementioned challenges, this paper proposes a hybrid time–frequency parallel model designed to exploit frequency-domain priors in a cost-effective and controllable manner while collaborating with a robust time-domain backbone. Specifically, the time-domain pathway employs periodic-indexed temporal query vectors and cross-channel attention to align and reuse periodic patterns. In the frequency-domain pathway, we introduce a frequency-domain correction module: first, a Real Fast Fourier Transform (RFFT) is applied to the input at its original scale, followed by a nonlinear mapping from historical frequency components to predictive ones via a Multilayer Perceptron (MLP) on the magnitude spectrum. The phase spectrum of the input is retained as a prior and paired with the predicted magnitude to reconstruct the complex spectrum for forecasting (phase values for frequency components beyond the historical bandwidth are zero-padded). The corrected complex spectrum is then converted back to the time domain via an Inverse Real Fast Fourier Transform (IRFFT) to yield the correction signal. The two pathways are fused at the original scale: the time-domain output is first denormalized to restore its physical dimensions, then added to the frequency-domain correction signal, with a channel-wise learnable gating mechanism g = σ(γ) introduced to modulate the intensity of frequency-domain injection. The gating is initialized with large negative values to ensure a safe starting state, and during training, it adaptively performs fine-grained channel selection by actively increasing gate values for channels with stable periodicity (e.g., power load, traffic flow, production line rhythms) and reducing them for event-driven or noisy channels (e.g., fault alarms, trading shocks, bursty traffic). This design avoids scaling risks in normalized-space fusion while enhancing interpretability: the magnitude of the gating g can be aligned with the target frequency band energy ratio and the band coherence between the time-domain residual and frequency-domain correction, enabling clear analysis of when and for which variables the model benefits from frequency-domain priors.
The main contributions of this paper are summarized as follows:
(a)
A magnitude-phase decoupling frequency-domain correction module is proposed, which maps only the magnitude spectrum while adopting historical phase values from the input spectrum. New frequency components beyond the historical bandwidth are uniformly zero-padded for completion. This approach stabilizes corrections of periodicity-related errors in the backbone prediction without introducing frequency-domain attention or phase learning.
(b)
Time–frequency fusion is achieved at the original scale through a channel-wise gating mechanism, initialized with low values to ensure stability. During training, the gate dynamically learns channel-specific weights to adjust the intensity of frequency-domain injection according to demand, thereby avoiding over-correction and ensuring robustness.

2. Related Work

2.1. Deep Learning for Time Series Modeling

Early deep learning methods mainly relied on recurrent structures and probabilistic modeling. Autoregressive frameworks based on LSTM and GRU can perform point prediction and interval prediction at the conditional distribution level. Among them, DeepAR maps observation sequences to parameterized distributions for multi-step rolling forecasting, which has been widely validated in scenarios such as e-commerce and energy [8]. On the other hand, convolutional models feature favorable parallelism. TCN enlarges the receptive field while maintaining computational efficiency via dilated convolutions, and has been proven to be highly competitive in capturing short- and medium-term dependencies [9]. In recent years, the paradigm of explicit decomposition and feedforward networks has emerged: N-BEATS parametrically models trend and seasonal components using learnable polynomial and Fourier bases, achieving both interpretability and long-range extrapolation capability [10]. N-HiTS further improves robustness and efficiency through hierarchical interpolation and multi-scale aggregation [11]. To address the inconsistency between training and testing distributions, RevIN performs instance-level reversible normalization and restores the scale at the output end, significantly stabilizing the training process and generalization performance in long-term forecasting tasks across seasons and domains [12].

2.2. Transformer Series

The advantages of Transformers in parallel long-range dependency modeling have spurred numerous time series-adapted variants. Informer proposes ProbSparse attention and a distilling encoder, which significantly reduces spatial–temporal complexity while preserving accuracy, establishing the first strong baseline of efficient attention for long-sequence benchmarks [13]. Autoformer integrates trend–season decomposition with the autocorrelation mechanism, yielding more robust performance in long-period extrapolation [14]. FEDformer further shifts part of the computation to the frequency domain and implements efficient modeling with sparse frequency points and decomposition blocks [15]. Beyond attention sparsification and structural priors, recent works have also highlighted the importance of the variable dimension. PatchTST employs intra-channel independent modeling and cross-channel aggregation, and splits the time axis into patches for representation, achieving prominent gains in Long-Term Time Series Forecasting (LTSF) [16]; iTransformer inverts the token design and emphasizes the expressive capacity of the variable dimension, further advancing performance in multivariate settings [17]. In addition, TimesNet reshapes 1D sequences into multi-period 2D time–frequency variation maps and captures cross-period couplings via convolutions, demonstrating the efficacy of exploiting periodic priors [18].

2.3. Linear Models

Zeng et al. systematically evaluated the effectiveness of Transformers on time series and proposed DLinear and NLinear: after decomposing the problem via simple trend–season decomposition, prediction is accomplished using only a single linear layer, which still achieves or outperforms complex Transformer models on multiple LTSF datasets [19]. This result indicates that the dominant patterns in many data series (especially seasonality) can be sufficiently captured by low-capacity linear modules. DLinear therefore serves as both a strong baseline and a commonly used interpretable linear branch in hybrid models.

2.4. Summary

Existing models suffer from several critical drawbacks: non-stationarity and distribution shift give rise to model mismatch; the evolution of long- and short-term dependencies makes it difficult for a single pathway to balance periodic extrapolation and disturbance suppression; and variable heterogeneity coupled with dynamic coupling leads to over-correction of unified fusion weights. Research by Bernardini et al. has validated the practical feasibility and effectiveness of modeling approaches that integrate frequency-domain modules with neural networks in engineering time series analysis tasks [20]. Therefore, based on TQNet, we organically combine temporal query and cross-channel aggregation with a frequency-domain correction module, and achieve robust fusion at the original scale via channel-wise gating, ultimately obtaining superior performance.

3. Methods

The multivariate time series forecasting problem can be formally defined as follows: Given a historical observation sequence X t R C × L , comprising C variables (or channels) observed over L time steps prior to time step t, the task objective is to generate a prediction sequence Y t R C × H for the next H future time steps. To address this task, we propose a model named the Time–Frequency Dual-Branch Gated Fusion Network (TFDG-Net).

3.1. Model Overview

The core idea of TFDG-Net is to decompose the time series forecasting task into two parallel subtasks: temporal dependency modeling and frequency-domain periodicity correction. The overall architecture of the model, as illustrated in Figure 1, consists of four key components:
Input Pre-processing: Instance normalization is applied to mitigate distributional discrepancies across different sequences, enhancing the model’s generalization capability.
Time-Domain Backbone: A network based on multi-head attention and MLP, responsible for directly learning temporal dependencies and dynamic correlations between variables from the input sequence.
Enhanced Frequency Correction Block: Converts the signal to the frequency domain via Fourier transform, learns the evolution patterns of frequency amplitudes using an MLP, and generates a time-domain correction signal.
Channel-wise Gated Fusion Mechanism: Introduces a learnable gating unit to adaptively determine the proportion of frequency-domain correction signals fused for each feature channel, enabling intelligent integration of information.

3.2. Time-Domain Backbone Network

The time-domain backbone network aims to capture local dynamic characteristics of sequences and complex interactions between variables. Its design draws inspiration from the core concept of TQNet, enhancing feature representation capabilities through temporal queries and channel aggregation.
(1)
Temporal Query and Channel Aggregation
We introduce a learnable global temporal query matrix θ t Q R W × C , where W is the primary periodic length of the dataset based on prior knowledge (e.g., for hourly power data, W can be 24 or 168). For the b -th sample in the batch with starting time index t b , a query vector sequence Q b R L × C is dynamically extracted through the following modulo operation:
i n d e x = ( t b ( m o d   W ) + { 0,1 , , L 1 } ) ( m o d   W )
Q b = θ t Q [ index ]
This query vector Q is fed into a standard multi-head attention module alongside the key ( K ) and value ( V ) vectors generated via linear transformation from the normalized input X norm . The attention computation is defined as
Attention ( Q , K , V ) = Softmax ( Q K T d k ) V
By using globally shared Q and sample-specific K , V , the attention mechanism effectively smooths out noise and outliers in individual samples when computing inter-channel correlations, thereby learning more stable and generalizable cross-channel dependency patterns.
(2)
Residual MLP Module
The feature representations after channel aggregation are fed into a deep nonlinear module. This module comprises an input projection layer, a core MLP, and an output projection layer, with residual connections widely adopted to stabilize training and prevent information loss. The core MLP contains two linear layers and a GELU activation function, structured as Linear→GELU→Linear, specifically designed to capture temporal dependencies within sequences. Finally, this branch outputs the initial time-domain prediction Y time R B × H × C .

3.3. Frequency-Domain Correction Module

To explicitly leverage the stable periodicity inherent in time series data, we have designed a frequency-domain correction module. The core hypothesis of this module is that periodic patterns manifest more clearly and stably in the frequency domain, and that future frequency amplitudes can be predicted from historical frequency amplitudes.
(1)
Time-to-Frequency Domain Transformation
The input to this module is a raw historical time series x R B × L i n × C , where B denotes the batch size, L i n represents the input sequence length, and C corresponds to the number of channels (i.e., variables). To analyze its frequency composition, we first transform the input signal from the time domain to the frequency domain. This process is achieved by applying the Real Fast Fourier Transform (RFFT), which is optimized for real-valued inputs and effectively leverages the conjugate symmetry of the spectrum. The transformation can be formulated as
X fft = F RFFT ( x )
where F R F F T ( ) denotes the RFFT operator. The output X f f t C B × C × F i n is a complex-valued tensor representing the spectrum of the input sequence, with F i n = L i n / 2 + 1 being the number of non-redundant frequency components determined by the input length. Each complex value X f f t [ f ] in the spectrum encodes both the amplitude and phase information corresponding to frequency f .
(2)
Nonlinear Mapping of Spectral Magnitudes
We propose a core hypothesis: the evolution of time series is primarily reflected in the redistribution of energy across different frequencies, which directly manifests as changes in the magnitude spectrum in the frequency domain. In contrast, the phase spectrum can be considered relatively stable or inherited from historical phase information in short-term forecasting. Based on this, we decompose the spectrum X fft into its magnitude A in and phase Φ in :
A i n = | X fft | , Φ i n = X fft
To learn the complex mapping from the historical magnitude spectrum A in to the future magnitude spectrum A pred , we abandon simple linear transformations and instead employ an MLP. This MLP consists of two linear layers and a ReLU activation function, enabling it to model nonlinear dependencies between frequencies, such as energy redistribution, harmonic generation, or attenuation at specific frequencies. The mapping process is defined as
A p r e d = W 2 σ ( A i n W 1 + b 1 ) + b 2
Here, A pred R B × C × F out represents the predicted magnitude spectrum of the future sequence, where F out = L pred / 2 + 1 denotes the number of frequency components corresponding to the prediction length L pred , W 1 and b 1 denote the weight and bias of the first linear layer, while W 2 and b 2 denote those of the second linear layer.
Compared with existing mainstream frequency-domain processing methods, representative approaches such as FEDformer and TimesNet adopt the joint learning paradigm of the full complex spectrum. They conduct end-to-end synchronous mapping for both the amplitude and phase of the frequency-domain complex spectrum, where both components participate in gradient update and learning, resulting in high modeling complexity. In contrast, the amplitude-spectrum-only mapping method proposed in this paper is formulated as follows:
F o u t = M L P ( | F i n | ) e j F i n
In this method, only the amplitude spectrum | F i n | undergoes nonlinear mapping via MLP, while the phase spectrum F i n is directly inherited from the historical observations and does not involve any learning process. This represents a lightweight and robust improvement over existing frequency-domain modeling approaches.
(3)
Spectrum Reconstruction via Phase Reuse
We adopt an efficient reuse strategy for phase information by directly inheriting the phase spectrum of the historical sequence to construct the phase spectrum Φ resued of the predicted sequence. The validity of this strategy stems from the fact that phase typically defines the starting position of a waveform, while in many applications, the focus lies on how the intensity (magnitude) of the waveform evolves over time. Using Euler’s formula, we combine the predicted magnitude spectrum A pred with the reused phase spectrum Φ resued to reconstruct the complete future complex spectrum X pred _ fft :
X p r e d _ f f t = A p r e d e i Φ reused
(4)
Frequency-to-Time Domain Inverse Transformation
Finally, the reconstructed complex spectrum X pred _ fft is transformed back to the time domain to generate the final prediction correction signal. This process is accomplished by applying the Inverse Real Fast Fourier Transform (IRFFT):
Y freq = F IRFFT 1 ( X p r e d _ f f t , n = L p r e d )
where F I R F F T 1 ( ) denotes the IRFFT operator, and the parameter n = L pred ensures that the length of the output time-domain signal matches the desired prediction horizon L pred . The resulting tensor Y f r e q R B × L pred × C constitutes the final output of this module.

3.4. Channel-Independent Adaptive Gated Fusion

To address the heterogeneity among variables in multivariate time series—where different variables may exhibit distinct periodic and stochastic characteristics—we have designed an adaptive gated fusion mechanism. The core of this mechanism is a learnable, channel-independent gating parameter g R 1 × 1 × C . The outputs of the two branches, Y t i m e and Y f r e q , are fused as follows:
Y final _ norm = Y time + σ ( g ) Y freq
where σ ( ) denotes the Sigmoid function, which compresses g into the interval ( 0,1 ) to serve as a dynamic weight for the frequency-domain correction signal, and represents element-wise multiplication implemented via broadcasting.
This design empowers the model to learn a dedicated fusion strategy for each channel. For channels with strong periodicity, the model can optimize the corresponding gating values to approach 1; conversely, for channels dominated by randomness, the gating values are driven towards 0. To guide the training process, we initialize g with negative values. This fusion strategy ensures that during the early stages of training, the model relies primarily on the more easily learned time-domain branch. As the model deepens its understanding of the data structure, it gradually and prudently incorporates the frequency-domain correction information.

4. Experiments and Results

4.1. Experimental Setup

The experiments in this section are implemented based on PyTorch (Paszke et al., 2019) [21], the version number is 2.5.1. The model is optimized using L2 loss and evaluated based on two metrics: mean squared error (MSE) and mean absolute error (MAE). In the experiments, we split the dataset into training, validation and test sets with a fixed ratio of 7:2:1. The datasets used for evaluation and the baseline models are outlined below.
Datasets: We evaluate the proposed method on five widely used real-world datasets, including the ETT series, the Exchange Rate dataset, as well as the Electricity and Weather datasets. These datasets vary in scale, dimensionality (i.e., number of variables), sampling frequency, and application domain. Detailed information about the datasets is provided in Table 1.
Baseline Models: To evaluate the performance of our proposed model, TFDG-Net, we compare it against several representative models from recent years, including TQNet [7], CycleNet [22], iTransformer [17], MSGNet [23], TimesNet [18], PatchTST [16], and DLinear [19]. Following the setup of iTransformer, TFDG-Net defaults to a look-back length of 96.

4.2. Main Results and Analysis

The specific experimental results are as follows. Table 2 summarizes the performance of our model, TFDG-Net, compared to various baseline models across multiple representative datasets. The results clearly demonstrate that TFDG-Net achieves top-two performance in both MSE and MAE across all presented datasets, fully reflecting its overall leading predictive accuracy. Notably, TFDG-Net exhibits superior prediction accuracy on more complex, high-dimensional datasets. For instance, it achieves the best predictive accuracy on both the Weather dataset (21 variables) and the Electricity dataset (321 variables).
Compared to the TQNet model, the performance improvement of TFDG-Net validates the effectiveness of our hybrid time–frequency domain design. Although TQNet effectively models cross-channel dependencies, its pure time-domain architecture still has room for improvement when dealing with data exhibiting strong, stable periodicity (such as Electricity). Our frequency-domain branch provides more accurate periodic predictions for such data by directly extrapolating the frequency spectrum, thereby achieving performance gains.
In comparison with powerful pure time-domain models like iTransformer, the advantage of TFDG-Net lies in its robustness. While Transformer models excel at capturing complex dynamics, they are susceptible to interference from local noise or outliers in the input sequence. The frequency-domain branch of TFDG-Net is insensitive to high-frequency noise and provides a stable baseline prediction. When combined with the dynamic predictions from the time-domain branch, this yields more reliable final results.

4.3. Ablation Studies

To verify the indispensability of each innovative component in TFDG-Net, we conducted a series of ablation experiments. Starting from the full TFDG-Net model, we sequentially removed or replaced its core modules and evaluated the variants on two datasets with distinct characteristics: Weather and Electricity.
Removing the entire frequency-domain branch resulted in a significant drop in predictive accuracy (as shown in Table 3). Compared to our complete TFDG-Net model, the average performance decreased by 12.0% on the Weather dataset and 7.0% on the Electricity dataset. This demonstrates the critical role of frequency-domain correction signals in enhancing prediction accuracy.
Replacing the gated fusion mechanism with simple element-wise addition also led to a decline in performance. Relative to the full TFDG-Net, the average performance dropped by 0.6% on the Weather dataset and 3.4% on the Electricity dataset. This indicates that it is crucial to allow the model to adaptively learn fusion weights for each channel, rather than employing a simple addition strategy. Direct addition may introduce unnecessary noise, particularly in channels lacking strong periodicity.
When the gating mechanism is substituted with linear projection fusion, the model performance likewise deteriorates. Relative to the TFDG-Net model, the average performance decreases by 6.2% on the Weather dataset and by 6.3% on the Electricity dataset, respectively. As a linear structure, the projection gating performs weighted aggregation of all input information, which may result in the forcible incorporation of channel-wise noise into the final prediction. Furthermore, linear architectures are prone to overfitting given limited training data, thereby leading to the degradation of model performance.

4.4. Autonomous Regulation of the Gating Mechanism

To investigate the impact of different gating initialization values on the model, we conducted experiments on the ETTh2 dataset with a prediction length of 96. The results show that the MSE is 0.293 when the initialization value is set to −50, 0.295 for 0, 0.299 for 3, and 0.300 for 10. Since the gating values are computed via the sigmoid function, low negative values cause the gating values to be closer to 0 at initialization. Gating units initialized to be open tend to fit the frequency-domain noise in the training set, leading to overfitting. In contrast, initialization with large negative values activates the gating mechanism only when there is a gain in the frequency domain, which suppresses noise fitting and significantly improves generalization.
To intuitively understand the operation of the channel-independent gating mechanism, we visualized the learned gating weights σ ( g ) after training convergence on the Weather dataset, as presented in Figure 2. Overall, we observe that the gating values (frequency gates) primarily serve a corrective function. Rather than drastically altering the predictions generated by the time-domain backbone network, they perform fine-grained adjustments upon this baseline to achieve higher accuracy. This aligns precisely with our objective in incorporating the frequency-domain correction module: to enable the network to adaptively integrate frequency information as needed, without compromising the stability of the backbone.
The gating values are relatively high. Surface pressure sequences exhibit stable semi-diurnal ( 12 h) and diurnal ( 24 h) cycles (atmospheric tides), characterized by minimal phase shifts across seasons and moderate yet stable amplitudes. This strongly aligns with the frequency branch’s hypothesis of “mapping amplitudes while borrowing phases,” resulting in significantly higher gating weights.
Wind Speed and Precipitation: The gating values are lower. Wind speed is heavily influenced by terrain, turbulence, and gusts, exhibiting strong randomness and unstable phases. Precipitation is a typical event-driven sparse sequence that closely resembles broadband noise. Since the frequency branch struggles to reliably extrapolate such signals, the gating mechanism learns to suppress their contribution (approaching zero) to prevent erroneous injection.

4.5. Phase Strategy Analysis

To verify the rationality of the proposed phase reuse strategy, this section compares the prediction performance of three typical phase handling strategies. The experimental results are shown in Table 4, where the prediction length is uniformly set to 96. It can be observed from the table that the phase reuse strategy achieves the optimal performance among the three strategies. Zero-phase padding directly fills zeros for newly added frequency components, which disrupts phase continuity and periodic alignment, introduces spectral leakage and reconstruction artifacts, and results in a slight degradation of prediction accuracy. This impact is more pronounced on the phase-sensitive ETTh2 dataset. Full complex spectrum learning necessitates simultaneous phase learning. However, phase is characterized by strong nonlinearity and high noise sensitivity, making it arduous to learn and prone to overfitting. Furthermore, for period-dominated time series data, phase only determines the starting position of the waveform, while the core information is dominated by magnitude. Phase learning constitutes redundant modeling, which conversely interferes with the effective learning of magnitude, thus leading to inferior performance relative to phase reuse.

4.6. Efficiency Analysis

Our hardware environment consists of an Intel Core Ultra 5 125H CPU (Intel Corporation, Santa Clara, CA, USA), an NVIDIA RTX 4060 (8 GB) GPU (NVIDIA Corporation, Santa Clara, CA, USA), and 32 GB of memory. The prediction horizon is set to 720, and the detailed experimental results are presented in Figure 3. The per-epoch training time of TFDG-Net is lower than that of iTransformer and PatchTST, and only higher than that of the purely linear model DLinear. The time-domain backbone of TFDG-Net adopts an MLP architecture, whose core computations originate from input projection, two layers of nonlinear MLP, and output projection, with a time complexity of O ( L C + d m o d e l 2 ) (where L denotes the input sequence length, C denotes the number of channels, and d m o d e l denotes the hidden dimension). The channel attention module employs a 4-head multi-head attention mechanism, which performs feature aggregation solely along the channel dimension without global self-attention in the temporal dimension, thus avoiding the high O( L 2 ) complexity inherent to Transformer-based models. Temporal queries are learnable parameters that implement periodic modeling only via indexing and broadcasting operations, resulting in negligible computational overhead. The core computations of the frequency-domain module are FFT/IRFFT and MLP, where the time complexity of FFT/IRFFT is O ( L log L + H log H ) . The frequency-domain MLP is a two-layer linear structure with an input dimension of F i n = L / 2 + 1 (only half of the input sequence length) and a hidden layer dimension of ( F i n + F o u t ) / 2 .

5. Limitations

The performance of TFDG-Net heavily relies on the assumption of frequency-domain stationarity of signals, which still imposes limitations on its application to certain extreme scenarios. In chaotic dynamic systems such as severe convective weather or high-frequency turbulence, the data often lack stable evolutionary laws, and the scattered spectral distribution makes it difficult for MLP-based mapping operators to capture effective patterns. Furthermore, the phase reuse strategy is essentially a prior based on physical inertia. Once the sequence undergoes severe phase shift or is disturbed by noise, reusing historical phases will instead cause destructive interference with the time-domain signal, even introducing spectral artifacts and impairing prediction accuracy. To tackle these challenges, the channel adaptive gating mechanism we designed serves as a safety net: when frequency-domain prediction fails, the model can automatically switch to the robust time-domain backbone, thereby safeguarding the bottom line of performance. In future work, we will introduce tools such as dynamic phase compensation and wavelet transform to enhance the extraction of non-stationary features, and explore a lightweight paradigm via sparse sampling to meet the deployment requirements of edge monitoring devices.

6. Conclusions

Addressing the challenges in current multivariate time series forecasting tasks regarding periodic feature mining, scale matching for cross-branch information fusion, and adaptation to variable heterogeneity, this paper proposes a Time–Frequency Hybrid Parallel Modeling Framework. This framework establishes a robust time-domain backbone based on time queries and cross-channel aggregation. In parallel, it incorporates a frequency-domain correction module: it applies the Real Fast Fourier Transform (RFFT) to the input at its original scale, learns a nonlinear mapping from historical frequency bins to predicted ones via an MLP exclusively on the amplitude spectrum, retains the phase from the input spectrum, and completes components beyond the historical band with zero phase. These are combined to obtain the predicted complex spectrum, which is then restored to a time-domain correction signal via the Inverse RFFT (IRFFT). To ensure robust fusion and interpretability, we perform post-fusion at the original scale and introduce a channel-wise learnable gating mechanism. We adopt a safer initialization strategy that suppresses the frequency branch during early training and adaptively activates it as data learning progresses, thereby actively injecting corrections into channels with stable periodicity while automatically shrinking contributions from noisy or event-driven channels. TFDG-Net demonstrates superior performance across five challenging real-world datasets, fully showcasing the model’s effectiveness and practicality in solving complex multivariate time series forecasting problems in the real world.

Author Contributions

Conceptualization, X.H.; Methodology, X.H.; Software, X.H.; Writing—original draft, X.H.; Writing—review and editing, Z.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Key Research and Development Program of China (2022YFF0801203, 2022YFF0801200) and the National Natural Science Foundation of China (41972306).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The analysis datasets used during the current study are available from the corresponding author on reasonable request (zwhe@cug.edu.cn).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Hochreiter, S.; Schmidhuber, J. Long short-term memory. Neural Comput. 1997, 9, 1735–1780. [Google Scholar] [CrossRef] [Scilit] [PubMed]
  2. Lai, G.; Chang, W.-C.; Yang, Y.; Liu, H. Modeling long-and short-term temporal patterns with deep neural networks. In Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, Ann Arbor, MI, USA, 8–12 July 2018; pp. 95–104. [Google Scholar]
  3. Wang, Y.; Wu, H.; Dong, J.; Liu, Y.; Long, M.; Wang, J. Deep Time Series Models: A Comprehensive Survey and Benchmark. arXiv 2024, arXiv:2407.13278. [Google Scholar] [CrossRef] [Scilit]
  4. Pantiskas, L.; Verstoep, K.; Bal, H. Interpretable Multivariate Time Series Forecasting with Temporal Attention Convolutional Neural Networks. In Proceedings of the 2020 IEEE Symposium Series on Computational Intelligence (SSCI), Canberra, ACT, Australia, 1–4 December 2020; pp. 1687–1694. [Google Scholar] [CrossRef] [Scilit]
  5. Yi, K.; Zhang, Q.; Fan, W.; Cao, L.; Wang, S.; He, H.; Long, G.; Hu, L.; Wen, Q.; Xiong, H. A Survey on Deep Learning based Time Series Analysis with Frequency Transformation. In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, New York, NY, USA, 3–7 August 2025; pp. 6206–6215. [Google Scholar] [CrossRef] [Scilit]
  6. Wang, Y.; Wu, H.; Dong, J.; Qin, G.; Zhang, H.; Liu, Y.; Qiu, Y.; Wang, J.; Long, M. TimeXer: Empowering transformers for time series forecasting with exogenous variables. In Proceedings of the 38th Annual Conference on Neural Information Processing Systems (NeurIPS 2024), Vancouver, BC, Canada, 8–14 December 2024. [Google Scholar]
  7. Lin, S.; Chen, H.; Wu, H.; Qiu, C.; Lin, W. Temporal Query Network for Efficient Multivariate Time Series Forecasting. arXiv 2025, arXiv:2505.12917. [Google Scholar] [CrossRef] [Scilit]
  8. Salinas, D.; Flunkert, V.; Gasthaus, J.; Januschowski, T. DeepAR: Probabilistic forecasting with autoregressive recurrent networks. Int. J. Forecast. 2020, 36, 1181–1191. [Google Scholar] [CrossRef] [Scilit]
  9. Bai, S.; Kolter, J.Z.; Koltun, V. An empirical evaluation of generic convolutional and recurrent networks for sequence modeling. arXiv 2018, arXiv:1803.01271. [Google Scholar] [CrossRef] [Scilit]
  10. Oreshkin, B.N.; Carpov, D.; Chapados, N.; Bengio, Y. N-BEATS: Neural basis expansion analysis for interpretable time series forecasting. arXiv 2019, arXiv:1905.10437. [Google Scholar]
  11. Challu, C.; Olivares, K.G.; Oreshkin, B.N.; Ramirez, F.K.; Canseco, M.M.; Dubrawski, A. Nhits: Neural hierarchical interpolation for time series forecasting. In Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, USA, 7–14 February 2023. [Google Scholar]
  12. Kim, T.; Kim, J.; Tae, Y.; Park, C.; Choi, J.H.; Choo, J. Reversible instance normalization for accurate time-series forecasting against distribution shift. In Proceedings of the International Conference on Learning Representations (ICLR 2022), Virtual, 25–29 April 2022. [Google Scholar]
  13. Zhou, H.; Zhang, S.; Peng, J.; Zhang, S.; Li, G.; Mei, H.; Ma, H.; Wen, Q. Informer: Beyond efficient transformer for long sequence time-series forecasting. In Proceedings of the 35th AAAI Conference on Artificial Intelligence, Virtual, 2–9 February 2021. [Google Scholar]
  14. Wu, H.; Xu, J.; Wang, J.; Long, M. Autoformer: Decomposition transformers with auto-correlation for long-term series forecasting. Adv. Neural Inf. Process. Syst. 2021, 34, 22419–22430. [Google Scholar]
  15. Zhou, T.; Ma, Z.; Wen, Q.; Wang, X.; Sun, L.; Jin, R. Fedformer: Frequency enhanced decomposed transformer for long-term series forecasting. In Proceedings of the 39th International Conference on Machine Learning, Baltimore, MD, USA, 17–23 July 2022. [Google Scholar]
  16. Nie, Y.; Nguyen, N.H.; Sinthong, P.; Kalagnanam, J. A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. arXiv 2022, arXiv:2211.14730. [Google Scholar]
  17. Liu, Y.; Hu, T.; Zhang, H.; Wu, H.; Wang, S.; Ma, L.; Long, M. itransformer: Inverted transformers are effective for time series forecasting. arXiv 2023, arXiv:2310.06625. [Google Scholar]
  18. Wu, H.; Hu, T.; Liu, Y.; Zhou, H.; Wang, J.; Long, M. Timesnet: Temporal 2D-variation modeling for general time series analysis. arXiv 2022, arXiv:2210.02186. [Google Scholar]
  19. Zeng, A.; Chen, M.; Zhang, L.; Xu, Q. Are transformers effective for time series forecasting? In Proceedings of the 37th AAAI Conference on Artificial Intelligence, Washington, DC, USA, 7–14 February 2023. [Google Scholar]
  20. Bernardini, L.; Bono, F.M.; Collina, A. Drive-by damage detection and localization exploiting continuous wavelet transform and multiple sparse autoencoders. Railw. Eng. Sci. 2025, 33, 721–745. [Google Scholar] [CrossRef] [Scilit]
  21. Paszke, A.; Gross, S.; Massa, F.; Lerer, A.; Bradbury, J.; Chanan, G.; Killeen, T.; Lin, Z.; Gimelshein, N.; Antiga, L.; et al. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In Proceedings of the 33rd International Conference on Neural Information Processing Systems, Vancouver, BC, Canada, 8–14 December 2019; Curran Associates Inc.: Red Hook, NY, USA, 2019; pp. 8026–8037. [Google Scholar]
  22. Lin, S.; Lin, W.; Hu, X.; Wang, S. Cyclenet: Enhancing time series forecasting through modeling periodic patterns. Adv. Neural Inf. Process. Syst. 2024, 37, 106315–106345. [Google Scholar]
  23. Cai, W.; Liang, Y.; Liu, X.; Feng, J.; Zhou, K. Msgnet: Learning multi-scale inter-series correlations for multivariate time series forecasting. In Proceedings of the 38th AAAI Conference on Artificial Intelligence, Vancouver, BC, Canada, 20–27 February 2024. [Google Scholar]
Figure 1. TFDG-Net model structure.
Figure 1. TFDG-Net model structure.
Applsci 16 03266 g001
Figure 2. Frequency gate values of each channel in Weather dataset.
Figure 2. Frequency gate values of each channel in Weather dataset.
Applsci 16 03266 g002
Figure 3. Comparison of training speed among models (seconds/epoch).
Figure 3. Comparison of training speed among models (seconds/epoch).
Applsci 16 03266 g003
Table 1. Detailed information of the dataset.
Table 1. Detailed information of the dataset.
DatasetChannelsTimestepsIntervalCycleDomain
ETTh2714,4001 h24Electricity
ETTm2757,60015 min96Electricity
Weather2152,69610 min144Weather
Electricity32126,3041 h168Electricity
Exchange875881 day7Finance
Table 2. Multivariate time series prediction performance comparison (red indicates the best result, and blue indicates the second-best result).
Table 2. Multivariate time series prediction performance comparison (red indicates the best result, and blue indicates the second-best result).
ModelTFDG-Net (Ours)TQNet
(2025)
CycleNet (2024)iTransformer (2024)MSGNet
(2024)
TimesNet (2023)PatchTST
(2023)
DLinear
(2023)
MetricMSEMAEMSEMAEMSEMAEMSEMAEMSEMAEMSEMAEMSEMAEMSEMAE
ETTh2960.2930.3430.2950.3430.2980.3440.2970.3490.3290.3710.3400.3740.3020.3480.3330.387
1920.3710.3930.3670.3930.3720.3960.3800.4000.4020.4140.4020.4140.3880.4000.4770.476
3360.4150.4280.4170.4270.4310.4390.4280.4320.4400.4450.4520.4520.4260.4330.5940.541
7200.4250.4420.4330.4460.4500.4580.4270.4450.4800.4770.4620.4680.4310.4460.8310.657
Avg0.3760.4020.3780.4020.3880.4090.3830.4070.4130.4270.4140.4270.3870.4070.5590.515
ETTm2960.1720.2540.1730.2560.1630.2460.1800.2640.1820.2660.1870.2670.1750.2590.1930.292
1920.2380.2970.2380.2980.2290.2900.2500.3090.2480.3060.2490.3090.2410.3020.2840.362
3360.2960.3360.3010.3400.2840.3270.3110.3480.3120.3460.3210.3510.3050.3430.3690.427
7200.3970.3950.3970.3960.3890.3910.4120.4070.4140.4040.4080.4030.4020.4000.5540.522
Avg0.2760.3200.2770.3230.2660.3140.2880.3320.2890.330.2910.3330.2810.3260.350.401
Electricity960.1330.2270.1340.2290.1360.2290.1480.240.1650.2740.1680.2720.1810.2700.1970.282
1920.1460.2420.1540.2470.1520.2440.1620.2530.1850.2920.1840.2890.1880.2740.1960.285
3360.1550.2570.1690.2640.1700.2640.1780.2690.1970.3040.1980.3000.2040.2930.2090.301
7200.1810.2850.2010.2940.2120.2990.2250.3170.2310.3320.2200.3200.2460.3240.2450.333
Avg0.1540.2530.1640.2590.1680.2590.1780.2700.1940.3010.1930.2950.2050.2900.2120.300
Weather960.1450.1920.1570.2000.1580.2030.1740.2140.1630.2120.1720.220.1770.2100.1960.255
1920.1860.2320.2060.2450.2070.2470.2210.2540.2110.2540.2190.2610.2250.2500.2370.296
3360.2350.2700.2620.2870.2620.2890.2780.2960.2730.2990.2800.3060.2780.2900.2830.335
7200.2990.3180.3440.3420.3440.3440.3580.3490.3510.3480.3650.3590.3540.3400.3450.381
Avg0.2160.2530.2420.2690.2430.2710.2580.2780.2490.2780.2590.2870.2590.2730.2650.317
Exchange960.0820.2000.0830.2020.0850.2030.0860.2060.1020.230.1060.2340.1370.2730.0880.218
1920.1730.2950.1770.3010.1780.2990.1770.2990.1950.3170.2270.3440.2500.3700.1760.315
3360.3240.4120.3350.4190.3500.4270.3310.4170.3590.4360.3670.4480.4460.5020.3130.427
7200.8270.6840.9130.7140.8810.7030.8470.6910.9400.7380.9640.7460.9010.7170.8390.695
Avg0.3510.3980.3770.4090.3730.4080.3600.4030.3990.4300.4160.4430.4340.4650.3540.414
Table 3. TFDG-Net component ablation experiment results (MSE/MAE).
Table 3. TFDG-Net component ablation experiment results (MSE/MAE).
SettingsWithout Frequency-Domain Correction, Without GatingWith Frequency-Domain Correction, Without
Gating
With Frequency-Domain Correction, With
Adaptive Gating
With Frequency-Domain Correction, With
Projection Gating
MetricsMSEMAEMSEMAEMSEMAEMSEMAE
Weather960.1570.20.1470.1950.1450.1920.1510.198
1920.2060.2450.1880.2340.1860.2320.1930.241
3360.2620.2870.2350.2710.2350.2700.2580.288
7200.3440.3420.3000.3190.2990.3180.3170.325
Electricity960.1340.2290.1380.2300.1330.2270.1400.248
1920.1540.2470.1490.2440.1460.2420.1520.249
3360.1690.2640.1600.2610.1550.2570.1670.263
7200.2010.2940.1890.2920.1810.2850.1950.292
Table 4. Comparative analysis of phase strategies.
Table 4. Comparative analysis of phase strategies.
Phase StrategyPhase
Reuse
Zero-Phase
Padding
Full Complex
Spectrum Learning
MetricMSEMAEMSEMAEMSEMAE
Weather0.1450.1920.1480.1900.1490.191
Electricity0.1330.2270.1340.2260.1340.226
ETTh20.2930.3430.2950.3450.3050.348
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

He, X.; He, Z. Time–Frequency Parallel and Channel-Adaptive Gating for Multivariate Time Series Prediction. Appl. Sci. 2026, 16, 3266. https://doi.org/10.3390/app16073266

AMA Style

He X, He Z. Time–Frequency Parallel and Channel-Adaptive Gating for Multivariate Time Series Prediction. Applied Sciences. 2026; 16(7):3266. https://doi.org/10.3390/app16073266

Chicago/Turabian Style

He, Xin, and Zhenwen He. 2026. "Time–Frequency Parallel and Channel-Adaptive Gating for Multivariate Time Series Prediction" Applied Sciences 16, no. 7: 3266. https://doi.org/10.3390/app16073266

APA Style

He, X., & He, Z. (2026). Time–Frequency Parallel and Channel-Adaptive Gating for Multivariate Time Series Prediction. Applied Sciences, 16(7), 3266. https://doi.org/10.3390/app16073266

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop