alphaFeedback

WorksComputer Science

CATF: A Manager-Worker Framework for Context-Aware Time-Series Forecasting

AI contributions
Not recorded for this paper
View details
Ancillary data
1 code link
View

Abstract

We study context-aware time-series forecasting, in which a single target variable is predicted from its own history and a set of contextual variables, such as weather and calendar information. As the context becomes more diverse, a single model struggles to capture all of its regimes, while ensemble learning and Mixture-of-Experts approaches rely on manual data partitioning or soft routing, which increases the inference cost and hinders interpretability. We propose CATF, a Context-Aware Time-Series Forecasting framework built on a Manager-Worker architecture: a Transformer-based Manager routes each input to a single Worker based on the context, using hard routing during both training and inference. The Workers thus specialize without manual data partitioning, and any single-model forecaster can serve as a Worker. On five context-rich datasets, four horizons, and two normalization schemes, CATF improves over its standalone counterpart in 162 of 200 comparisons, the best CATF-enhanced model outperforms the best standalone baseline in 19 of 20 settings, and it outperforms the zero-shot Time-MoE foundation model in 15 of 20 settings. A case study on bike-sharing data shows that the Manager routes inputs by the calendar and that each Worker specializes in a different weekly pattern.

Introduction

Time-series forecasting is critical to applications such as weather prediction, electricity load management, traffic analysis, financial forecasting, and industrial monitoring [3, 5, 44, 58, 62]. However, growing temporal complexity and rich contextual dependencies make accurate forecasting increasingly difficult and computationally expensive. Contextual variables are often heterogeneous and dynamic, evolving abruptly or nonlinearly over time. For example, hourly bike-sharing demand depends on weather, temperature, and the calendar: on working days it peaks during the morning and evening commutes, whereas on weekends and holidays it follows a single midday peak, and a holiday on a weekday can switch the demand to the weekend pattern. In this work, we focus on such context-aware forecasting: the goal is to forecast a single target variable from its history and the contextual variables that drive it, a setting also known as forecasting with exogenous variables. This differs from the setting of most multivariate forecasting benchmarks [1], in which all variables are forecast jointly; here, the contextual variables serve only as inputs.

Recent advances in deep learning have led to impressive results in time-series forecasting. Convolutional networks [60], graph neural networks [30], and Transformer-based models [42] have been adapted to capture complex temporal dependencies. More recently, large-scale time-series foundation models (TSFMs) [32, 48] have shown strong performance in zero-shot and few-shot settings. However, these models are expensive to fine-tune, struggle with distribution shifts, and often fail to generalize to domain-specific dynamics. To improve adaptability, researchers have explored alternatives such as retrieval-augmented forecasting [40], meta learning [46], and adaptive policies [22].

Hybrid forecasting approaches offer another promising direction by allowing model specialization under diverse conditions. Ensemble methods [23, 26] train specialized models on partitioned subsets and aggregate their predictions. However, they incur inference overhead and require

Authors’ Contact Information: Yueqiao Chen, UC Davis, Davis, CA, USA, [email protected]; Dongyu Liu, UC Davis, Davis, CA, USA, [email protected]. manual segmentation and weighting strategies. Mixture-of-Experts (MoE) models [33, 54] improve efficiency through sparse activation but demand careful gating design and are prone to expert under-utilization without strong regularization.

To address these challenges, we propose CATF, a _Context-Aware Time-Series Forecasting_ framework based on a Manager-Worker (MW) architecture. CATF consists of a high-level transformer-based _Manager_ and a set of _Worker_ models trained via joint optimization. The Manager dynamically routes each input to a single specialized Worker based on contextual features, enabling each Worker to focus on a distinct subset of conditions. Inspired by economic specialization [29], we formulate training as a competitive yet cooperative process: the Manager learns to assign inputs to the most suitable Worker, while Workers specialize in minimizing error within their assigned contexts.

Unlike conventional MoEs, CATF employs _hard routing_, assigning each input to a single Worker during both training and inference. This improves interpretability, encourages Worker specialization, and eliminates the need for manual partitioning or complex gating mechanisms. In addition, CATF supports heterogeneous architectures, enabling seamless integration of state-of-the-art forecasting models with minimal tuning. We evaluated CATF on five real-world context-rich datasets across four forecasting horizons, observed improvements over strong single-model baselines, and analyze its routing decisions. Our key contributions are as follows.

  • Modular framework. We propose CATF, a Manager-Worker framework in which a Transformer-based Manager routes each input to one of several Worker models through hard routing, trained with a joint mechanism that lets the Workers specialize without manual data partitioning (§ 4). CATF is model-agnostic: any single-model forecaster can serve as a Worker without modification, in homogeneous or heterogeneous configurations, and we instantiate it with five representative architectures, Autoformer [61], Informer [67], FEDformer [68], TimesNet [60], and iTransformer [42].

  • Context-aware interpretation. Because each prediction is produced by a single, identifiable Worker, the routing decisions can be inspected and related to the context. In a case study on a real-world bike-sharing dataset, we show that the Manager learns to route inputs by the most relevant contextual variables (e.g., working days vs. weekends) and that the Workers specialize accordingly (§ 6); on synthetic data with known context-driven regimes, the same analysis recovers the ground truth (Appendix § 12.§ 2).

  • Performance improvement. On five context-rich real-world datasets, four horizons, and two normalization schemes, CATF improves over its standalone counterpart in 162 of the 200 comparisons (81%), the best CATF-enhanced model outperforms the best standalone baseline in 19 of the 20 settings, CATF reduces the run-to-run variance of unstable baselines, and it outperforms the zero-shot Time-MoE foundation model [54] in 15 of the 20 settings (§ 5.2).

Related Work

Time Series Forecasting

Single-Model Approaches. Early forecasting models relied on convolutional (CNN) [8, 19, 41, 60] and recurrent (RNN) [50, 53, 66] architectures to capture temporal dependencies. CNNs are efficient and effective for local patterns, while RNNs model autoregressive behavior. However, both struggle with long-range dependencies. Graph neural networks (GNNs) [30, 63] address inter-variable relationships but incur high computational cost in high-dimensional or long-sequence settings. More recently, multilayer perceptron (MLP) models [37, 57] have emerged as efficient alternatives, relying on token mixing or linear projections. Transformer-based models [42, 45, 61, 67, 68] have become more popular due to their ability to model global dependencies through self-attention. Despite their strengths, single-model architectures often struggle to generalize across heterogeneous and dynamic temporal regimes. Models tuned for specific conditions may underperform under unexpected shifts such as holidays or extreme events. Our proposed framework addresses this limitation by enabling dynamic model selection based on contextual cues.

Time-Series Foundation Models (TSFMs). These approaches aim to build universal forecasting models pretrained on large-scale datasets [32, 38]. These models vary in architecture (e.g., Transformer, diffusion, or MLP), pretraining objectives (supervised or self-supervised), and downstream adaptation strategies (fine-tuning, prompting, zero-shot) [4, 9, 17, 18, 24, 25, 43]. While TSFMs offer general-purpose representations and cross-domain transferability, they are computationally expensive and often brittle under distribution shifts, particularly in domains with limited or highly specialized data.

Hybrid Forecasting Architectures

Hybrid frameworks combine multiple models to leverage their complementary strengths.

Ensemble learning. Ensemble learning methods—including bagging, boosting, stacking, and hybrid approaches—consistently improve prediction accuracy in time series forecasting by reducing variance, mitigating bias, and modeling complex non-linear dependencies [13, 21, 23, 26, 34, 52]. These methods combine predictions from multiple independent models, typically through averaging or weighting, which enhances robustness but often overlooks input-specific context. Their effectiveness can be constrained by the need for manual design of segmentation and aggregation strategies, and performance gains tend to diminish when base models are highly correlated. Moreover, ensemble methods are computationally more demanding and less interpretable compared to individual models. Achieving superior performance over the best single model requires careful tuning of integration strategies, such as model weighting and diversity enforcement.

Mixture-of-Experts (MoE). MoE architectures [15, 31, 33, 35, 36, 51, 54] dynamically route inputs to specialized expert models via a gating mechanism. While sparse activation improves computational efficiency, these models require careful gating design and are prone to issues such as expert collapse or under-utilization without strong regularization. In time-series forecasting, recent MoE variants like Time-MOE [54] have shown promising results. Time-MOE is a decoder-only autoregressive Transformer trained on over 300 billion time points. It employs point-wise tokenization, multi-resolution attention heads, and top-kk expert activation with load-balancing to achieve scalability with minimal inference overhead. However, such models remain challenging to optimize and are often tightly coupled to specific architectural choices, limiting their flexibility across forecasting domains.

Our framework builds on the core principle of specialization, but replaces soft gating with hard routing implemented through a learned Transformer-based Manager. This design eliminates the instability commonly associated with gating mechanisms and enables transparent, deterministic input-to-expert assignments. Unlike prior MoE approaches, our framework naturally supports heterogeneous Workers and allows seamless integration of SOTA forecasting models. As a result, it achieves both scalability and interpretability—while also mitigating the challenges faced by ensemble methods, such as manual data partitioning and extensive tuning.

Preliminaries

Data Description

This study focuses on context-aware multivariate time-series forecasting: the model observes the history of a target variable together with multiple contextual variables, and predicts the future values of the target variable.

Target Time-Series Data. Let xt∈Rx_t \in\mathbb{R} denote the value of the target variable at time tt (e.g., the PM2.5 concentration or the number of rented bikes). Its past observations up to time tt are

Xt,Δt,L=(xt−(L−1)Δt,xt−(L−2)Δt,…,xt),X_{t,\Delta t,L} = (x_{t-(L-1)\Delta t}, x_{t-(L-2)\Delta t}, \ldots, x_t),

where Δt\Delta t is the time interval between consecutive observations and LL is the length of the historical (lookback) window.

Multivariate Contextual Data. In addition to the target, we observe NN contextual variables that capture external factors influencing the target dynamics, such as weather conditions, co-pollutants, or calendar indicators. Let ct∈RN\mathbf{c}_t \in\mathbb{R}^{N} denote the contextual observations at time tt; the contextual history over the same window is

Ct,Δt,L=(ct−(L−1)Δt,ct−(L−2)Δt,…,ct).C_{t,\Delta t,L} = (\mathbf{c}_{t-(L-1)\Delta t}, \mathbf{c}_{t-(L-2)\Delta t}, \ldots, \mathbf{c}_t).

The target and contextual variables are temporally aligned, so the model input at each time step is the (N+1)(N+1)-dimensional vector (xt,ct)(x_t, \mathbf{c}_t), and the full input is an L×(N+1)L \times(N+1) matrix.

Problem Formulation

Given the historical target sequence X=Xt,Δt,LX = X_{t,\Delta t,L} and the associated contextual sequence C=Ct,Δt,LC = C_{t,\Delta t,L}, the objective is to forecast the future values of the target variable over a horizon of length LyL_y:

Y=(xt+Δt,xt+2Δt,…,xt+LyΔt)∈RLy.Y = (x_{t+\Delta t}, x_{t+2\Delta t}, \ldots, x_{t+L_y\Delta t}) \in\mathbb{R}^{L_y}.

A forecasting model ff learns the mapping

Y^=f(X,C),Y^=(x^t+Δt,…,x^t+LyΔt),\widehat{Y} = f(X,C), \qquad\widehat{Y} = (\widehat{x}_{t+\Delta t}, \ldots, \widehat{x}_{t+L_y\Delta t}),

that is, a multivariate-input, univariate-output mapping. The contextual variables are only used as inputs; their future values are neither predicted nor assumed to be known.

Normalization and Evaluation. Because the target and contextual variables have very different scales, the inputs are normalized by a transform gg before being fed to the model, and the model is trained to minimize the MSE between its output and g(Y)g(Y) in the normalized space. We consider two choices of gg: global normalization, which standardizes every variable with the mean and standard deviation of the training split, and sample normalization, which standardizes each input window with its own per-variable statistics and scales the target horizon with the statistics of the target in the input window. At test time, predictions are mapped back to the original scale with the inverse transform, and the error is computed against the raw ground truth:

MSE=1∣T∣Ly∑t∈T∑i=1Ly(g−1(Y^i)−xt+iΔt)2(1)\mathrm{MSE} = \frac{1}{|\mathcal{T}|L_y} \sum_{t \in\mathcal{T}} \sum_{i=1}^{L_y} \left(g^{-1}(\widehat{Y}_i) - x_{t+i\Delta t}\right)^2 \tag*{(1)}

where T\mathcal{T} is the set of forecast origins in the test split. Reporting the error in the original units of the target makes the results directly interpretable (e.g., squared rentals per hour for Bike Share) and comparable across normalization schemes, but not across datasets.

While recent forecasting models have achieved strong performance by modeling complex temporal dependencies, their effectiveness often degrades in the presence of heterogeneous and context-dependent patterns. Different temporal regimes may exhibit distinct dynamics, making it difficult for a single model to capture all forecasting behaviors effectively. This motivates model specialization, where different forecasting models focus on different subsets of the data distribution.

To address this challenge, the proposed CATF framework adopts a Manager–Worker architecture. A manager model first extracts contextual characteristics from the target history XX and the context CC and dynamically assigns each instance to one of several specialized worker models. By routing each instance to the most suitable worker, CATF enables adaptive specialization without requiring manual data partitioning, thereby improving forecasting accuracy across diverse temporal patterns, while the routing decisions reveal which patterns each worker specializes in.

CATF Framework

This section presents the technical details of CATF framework, a context-aware time-series forecasting approach based on a Manager–Worker (MW) architecture. We describe its model structure and training algorithm.

Modeling

CATF consists of a manager model M\mathcal{M} and KK worker models W1,…,WK\mathcal{W}_1,\ldots,\mathcal{W}_K, as illustrated in Figure 1a. The manager M\mathcal{M} takes the target history XX and the context history CC as input and estimates, for each worker Wi\mathcal{W}_i, the probability P^i\hat{P}_i that it is best suited to predict the future target sequence. The worker with the highest probability, Wk∗\mathcal{W}_{k^*} with k∗=arg⁡max⁡iP^ik^*=\arg\max_i\hat{P}_i, is selected and generates the forecast Y^=Wk∗(X,C)\hat{Y}=\mathcal{W}_{k^*}(X,C) from the same input; at inference time, the other workers are not executed.

Manager–Worker architecture of CATF

Figure 1. Manager–Worker architecture of CATF. (a) Given the target history XX and the context history CC, the manager M\mathcal{M} outputs routing probabilities P^\hat{P} over the KK workers. The worker with the highest probability, Wk∗\mathcal{W}_{k^*}, receives the same input (X,C)(X,C) and alone predicts the future target sequence Y^\hat{Y}. (b) Inside the manager: feature encoding (L1), LmL_m Transformer encoder layers (L2), last-timestep pooling, a decoder (L3), and softmax (L4).

Manager Model

Manager Model. The manager performs a KK-class classification task, mapping input (X,C)(X,C) to a probability distribution over the KK worker models. As shown in Figure 1b, the manager follows a Transformer-based architecture [56], consisting of:

  • Feature Encoding (L1): A linear projection followed by layer normalization, ReLU activation, and dropout transforms raw input into high-dimensional embeddings. This preprocessing ensures stable training and expressive representations, which are essential for downstream temporal modeling.

  • Transformer Encoder Stack (L2): A stack of LmL_m Transformer encoder layers models long-range and complex temporal-contextual dependencies through self-attention mechanisms. Each layer consists of multi-head self-attention and position-wise feedforward sub-layers, equipped

with GELU activation [27] and residual connections. GELU is chosen for its smooth, non-linear behavior, which preserves gradient flow and has been empirically shown to enhance optimization stability and performance in deep Transformer-based networks.

  • Output Layer (L3–L4): Following Transformer-based classification designs [14, 65], last-timestep pooling summarizes the sequence into a fixed-length representation. This is passed through a decoder (L3) and softmax (L4) to produce the output distribution over workers. Last-timestep pooling preserves the most recent temporal information, which is critical for decision-making in time-sensitive forecasting scenarios.

4.1.2 Worker Model. The selected worker predicts the future target sequence Y^\hat{Y} given the input sequence XX and covariates CC, as illustrated in Figure 1. CATF allows each worker to be instantiated with any time-series forecasting model, supporting both homogeneous and heterogeneous ensembles. In most experiments, we use multiple instances of the same base model to assess the effectiveness of the framework, while heterogeneous mixtures are examined in ablation studies.

We incorporate several established models as workers, including Informer [67], Autoformer [61], FedFormer [68], TimesNet [60], and i-Transformer [42]. These models also serve as baselines for evaluation. Their base implementations are consistent with the official versions provided in the Time-Series-Library [1], and we use the same hyper-parameter settings to ensure fair comparisons. For each base model, we implement a corresponding CATF variant within our framework. Users can specify the base models to use—either homogeneous or mixed—along with the number of workers of each type, through a simple configuration file.

Training Mechanism

We introduce an iterative training algorithm to jointly train the manager and workers, shown as Figure 2 and Algorithm 1. The manager learns to assign each input to the most suitable worker, and the workers are trained based on the data routed from the manager, specializing in certain context conditions.

Iterative training of CATF, illustrated for one sample

Figure 2. Iterative training of CATF, illustrated for one sample. (a) All workers first produce forecasts and losses (steps 1–2). (b) Their losses and training volumes define a pseudo target (step 3) that supervises the manager update (step 4). (c) The updated manager then selects one worker (step 5), and only that worker is trained on the sample (step 6).

Main Training Process

4.2.1 Main Training Process. Each training iteration consists of three phases (Figure 2). (a) Every worker WiW_i forecasts the target, Y^i=Wi(X,C)\hat{Y}_i = W_i(X,C) (step ①; line 4 in Algorithm 1), and we compute its loss LiWL_i^W (step ②). This forward pass only evaluates the workers and does not update them. (b) The worker losses, together with the training volumes of the workers, define a pseudo ground truth PP for the manager output (step ③; line 5), which supervises the update of the manager M\mathcal{M} (step ④; line 6). (c) The updated manager predicts the routing probabilities P^=M(X,C)\hat{P} = \mathcal{M}(X,C) and selects the worker Wk∗W_{k^*} with k∗=arg max⁡iP^ik^* = \operatorname*{arg\,max}_i \hat{P}_i (step ⑤; lines 7–8). Only this worker is trained on the sample (step ⑥; lines 9–13), while the other workers are not updated.

This selective training strategy ensures that each worker is exposed to and learns from samples within specific contextual regimes. Over time, this encourages the emergence of functional specialization—each worker becomes proficient in forecasting under particular conditions. § 6 analyzes this specialization empirically. This approach is inspired by the principle of economic specialization [29], where agents maximize collective productivity by focusing on tasks they are best suited to. Similarly, CATF enables each worker to “do what it does best,” thereby improving overall forecasting accuracy and robustness in heterogeneous environments.

4.2.2 Training Details. The following details describe key components and design choices of the training process described above.

Detail #1: Training Order. We train the manager model first and then use it to select the appropriate worker for training. In the initial iteration, untrained workers make predictions on a set of samples, and their losses are used to generate a pseudo ground truth distribution for the manager.

This allows the manager to learn how to assign tasks based on relative worker performance from the outset. Once trained, the manager routes future samples to the most suitable worker.

This process can be thought of as talent scouting before assigning roles: the manager first observes each worker’s raw potential under various contexts—without prior bias—and learns who is naturally inclined to handle which kind of data. In contrast, if we train the workers first, the untrained manager must randomly assign tasks, akin to blindly assigning roles before knowing who’s good at what. The randomly selected worker would then receive more training and, as a result, dominate in performance—not because of superior aptitude, but because of an early, unearned advantage. This skews the pseudo ground truth, leading the manager to reinforce this imbalance and reducing overall diversity and specialization. Alternatively, training all workers on every sample from the beginning contradicts the core design of specialization, where workers are meant to focus on distinct contextual regimes.

By training the manager first—using the raw, untrained losses as an initial signal—we provide it with a fair and unbiased starting point for assessing each worker’s relative strengths. While this is only the beginning of an iterative co-training process, it lays the foundation for a more principled and effective division of labor. This approach encourages the emergence of specialized expertise across workers, without introducing early random bias that could skew the learning dynamics.

Detail #2: Pseudo Ground Truth Calculation. A core challenge in training the manager is the absence of a ground-truth probability distribution PP that indicates which worker should handle each sample. To address this, we adopt the intuitive principle that a worker with lower prediction loss should be more likely to be selected. Concretely, each worker first makes a prediction for the given input (step ① in Figure 2), and we compute its prediction loss LiWL_i^W (e.g., MSEiMSE_i) (step ②). These losses are then used to construct a soft target distribution over workers. The simplest form of this pseudo ground truth is defined as:

MaxL=max⁡1≤i≤KLiW,P=Softmax(MaxLLW),(2)\begin{aligned} MaxL &= \max_{1 \le i \le K} L_i^W, \\ P &= Softmax\left(\frac{MaxL}{L^W}\right), \tag*{(2)} \end{aligned}

Algorithm 1 Iterative Training Process of CATF

Require: Training data D={(Xi,Ci,Yi)}\mathcal{D} = \{(X_i, C_i, Y_i)\}, Manager M\mathcal{M}, Workers {W1,…,WK}\{\mathcal{W}_1, \ldots, \mathcal{W}_K\}, epochs EE, worker update steps α\alpha

  1. Initialize M\mathcal{M} and {Wi}i=1K\{\mathcal{W}_i\}_{i=1}^{K}

  2. for epoch =1= 1 to EE do

  3.     for each mini-batch (X,C,Y)∈D(X, C, Y) \in\mathcal{D} do

  4.     Compute all worker losses LiW=L(Wi(X,C),Y)L_i^{W} = \mathcal{L}(\mathcal{W}_i(X,C),Y)

  5.     Compute target weights PP

  6.     Train manager M\mathcal{M}

  7.     P^=M(X,C)\hat{P} = \mathcal{M}(X,C) # predict routing probabilities

  8.     Select worker index k∗=arg⁡max⁡P^k^* = \arg\max\hat{P} for each sample

  9.     for step =1= 1 to α\alpha do

  10.         for i=1i = 1 to KK do

  11.         Select sub-batch {(xj,yj)}\{(x_j,y_j)\} where kj∗=ik_j^* = i

  12.         if selection not empty then

  13.         Train Worker Wi\mathcal{W}_i on selected sub-batch

  14.     Validate and save best checkpoint if improved

where lower losses result in higher scores. This distribution PP serves as a stand-in for the missing ground truth, guiding the training of the manager to produce probability outputs that align with worker performance (step ④ in Figure 2).

Detail #3: Training Regularization. A critical challenge in training CATF is maintaining a balanced learning process across all workers. Without proper regulation, a competitive imbalance may emerge: if one worker Wi\mathcal{W}_i happens to perform better than others—even if not inherently more capable—the manager will increasingly assign it more samples in subsequent iterations. This feedback loop can result in Wi\mathcal{W}_i becoming overly dominant, while other workers are starved of data and fail to specialize. Ultimately, this degrades model diversity and undermines the utility of contextual information. This phenomenon resembles the classic exploration–exploitation dilemma in Monte-Carlo Tree Search (MCTS) [11], where the challenge lies in choosing between high-performing nodes and less-explored ones. Inspired by MCTS, we introduce a regularization term (step ③ in Figure 2, line 5 in Algorithm 1, Equation (3)) that considers the training volume ViV_i—the number of data samples allocated to each worker Wi\mathcal{W}_i (line 13):

MaxV=max⁡1≤i≤KVi,MaxV = \max_{1 \leq i \leq K} V_i,
P=Softmax(e−LWMaxL+β⋅MaxV−VMaxV),(3)P = Softmax\left(e^{-\frac{L^W}{MaxL}} + \beta\cdot\frac{MaxV - V}{MaxV}\right), \tag*{(3)}

where e−LW/MaxLe^{-L^W/MaxL} represents the new loss-based term (TNewLoss), and (MaxV−V)/MaxV(MaxV - V)/MaxV is the regularization term (TReg). This formulation differs from the original loss-based probability in Equation (2), where MaxL/LWMaxL/L^W (TOriginLoss) may produce a much wider range and overshadow the contribution of the regularization term.

We design TReg to be large during early training—encouraging the manager to explore underutilized workers—and to diminish over time as training volumes equalize. This dynamic is supported by the fact that MaxVMaxV generally grows faster than MaxV−VMaxV - V, naturally reducing TReg’s effect. The hyperparameter β\beta controls the strength of the regularization.

TNewLoss is preferred over TOriginLoss because its output range (1/e1/e to 11) aligns better with TReg (which ranges from 0 to 1). This ensures that both terms meaningfully influence the resulting probability distribution P^\hat{P} and that the manager balances performance with exploration throughout training.

Detail #4: Batch Training. For clarity, Figure 2 depicts the training process on a single sample. However, our implementation is designed to support efficient batch-wise training. Specifically, in each training iteration (Algorithm 1, lines 3–13), we first evaluate all workers and update the manager on the current mini-batch (lines 4–6), and then compute the updated manager’s output probabilities for all samples (line 7). Each sample is then assigned to the worker with the highest predicted probability via arg max selection (line 8). Next, we partition the batch into KK sub-batches, one for each worker, based on the manager’s assignments. Each worker WiW_i is then trained only on its corresponding sub-batch—i.e., the samples for which it was selected—allowing it to focus on the specific types of inputs it is most suited for.

To improve training stability and accelerate convergence, we repeat the worker update step α\alpha times for each batch (lines 9–13 in Algorithm 1).

Detail #5: Loss Function Selection. For the workers, we adopt a standard loss metric for time-series prediction: the Mean Squared Error (MSE). This loss quantifies the average squared difference between the predicted target sequence Y^\hat{Y} and the ground truth YY, and is defined as:

MSE⁡(Y,Y^)=1LY∑i=1LY∥y^t+iΔt−yt+iΔt∥22(4)\operatorname{MSE}(Y,\hat{Y}) = \frac{1}{L_Y}\sum_{i=1}^{L_Y}\left\lVert\hat{y}_{t+i\Delta t} - y_{t+i\Delta t}\right\rVert_2^2 \tag*{(4)}

We denote the MSE loss of worker WiW_i as LiWL_i^W, and use it as the primary feedback signal during worker training.

For the manager, we use a hybrid objective that combines the Wasserstein distance [6] and the Kullback–Leibler (KL) divergence to measure the discrepancy between the manager’s predicted probability distribution P^\hat{P} and the pseudo ground truth PP.

The Wasserstein distance is more continuous and geometry-aware than KL or Jensen–Shannon divergence [7], offering smoother gradients and greater stability during optimization. It is defined as:

W(P^,P)=sup⁡∥f∥L≤1Ex∼P^[f(x)]−Ex∼P[f(x)],(5)W(\hat{P},P)=\sup_{\lVert f\rVert_{L}\leq1}\mathbb{E}_{x\sim\hat{P}}[f(x)]-\mathbb{E}_{x\sim P}[f(x)], \tag*{(5)}

where f(x)f(x) is a 1-Lipschitz function satisfying ∣f(x1)−f(x2)∣≤∣x1−x2∣\lvert f(x_1)-f(x_2)\rvert\leq\lvert x_1-x_2\rvert. This constraint ensures smooth alignment between probability distributions.

While Wasserstein distance enables fine-grained distribution matching, using it alone often leads to over-concentration of samples on a single dominant worker, which undermines diversity. To address this, we incorporate the KL divergence:

LKL(P∥P^)=∑i=1KP(i)log⁡(P(i)P^(i))(6)\mathcal{L}_{\mathrm{KL}}(P\mathbin{\|}\hat{P})=\sum_{i=1}^{K}P(i)\log\left(\frac{P(i)}{\hat{P}(i)}\right) \tag*{(6)}

KL divergence penalizes mismatches where high-probability targets receive low attention, helping the manager distribute samples more evenly—particularly important during the early stages of training when PP is relatively uniform.

By combining both terms, we enable the manager to balance diversity and precision throughout training. The KL term encourages broad worker participation, while the Wasserstein term refines the accuracy of the assignment. The resulting hybrid loss for the manager is as Equation (7):

Lmanager=λwass⋅Wasserstein⁡(P^,P)+λKL⋅KL⁡(P∥P^)+λreg⋅∑j∥θj∥2(7)\mathcal{L}_{\mathrm{manager}}=\lambda_{\mathrm{wass}}\cdot\operatorname{Wasserstein}(\hat{P},P)+\lambda_{\mathrm{KL}}\cdot\operatorname{KL}(P\mathbin{\|}\hat{P}) +\lambda_{\mathrm{reg}}\cdot\sum_j\lVert\theta_j\rVert_2 \tag*{(7)}

, where θj\theta_j denotes the jj-th parameter tensor (the weight matrix or bias vector of a layer) of the manager model. The KL divergence is much larger in magnitude than the Wasserstein distance. We therefore set λwass=10\lambda_{\mathrm{wass}} = 10 and λKL=0.01\lambda_{\mathrm{KL}} = 0.01, which bring the two terms to a comparable scale so that neither dominates the manager update, and λreg=1×10−8\lambda_{\mathrm{reg}} = 1 \times10^{-8}. The last term is a group-lasso penalty [64] on the manager’s parameters, where θj\theta_j denotes the jj-th parameter tensor and λreg=10−8\lambda_{\mathrm{reg}} = 10^{-8}. In our ablation, removing this term has no significant effect (§ 5.3).

Experiments

We implemented CATF and evaluated its performance through both comparative experiments and ablation studies. All models were trained using PyTorch [47] with CUDA acceleration on a server equipped with an Nvidia RTX 6000 Ada GPU (48 GB). To ensure fair comparison, each experiment was repeated across 5 independent runs per model, dataset, forecasting horizon, and normalization mode. The code is available at https://github.com/via-cs/catf.

Setup and Baselines

We compare CATF with five widely used multivariate time-series (MTS) forecasting models and a pretrained time-series foundation model on five real-world datasets, each evaluated at four forecasting horizons and under two normalization schemes. The experimental setup and baseline details are outlined below.

Datasets

We evaluate on five datasets in which a single target variable is driven by contextual variables of a different nature, such as weather and calendar variables for bike demand. We do not use standard multivariate benchmarks such as ETT or Electricity: they are designed for joint forecasting of variables of the same kind (e.g., the loads of different clients) and contain no such contextual variables. For each dataset, we chronologically partition the samples into 80% for training, 10% for validation, and 10% for testing. The input length (lookback window) is fixed to L=96L = 96, and the output length is Ly∈{96,192,336,720}L_y \in\{96, 192, 336, 720\}, following the long-term forecasting protocol of prior work [42, 60, 61]. Dataset statistics are listed in Appendix Table 4.

  • Weather [59] (21 variables): Meteorological measurements recorded every 10 minutes during 2020 at a weather station in Germany, including pressure, temperature, humidity, wind, and radiation. Following our code, the last column, CO2_2 concentration (ppm), is used as the target and the other 20 variables as context. As in the original data, the target contains 50 missing-value codes (−9999) in the training period, which we keep unchanged.

  • PM2.5-LA and PM2.5-RV [28, 55] (15 variables each): Hourly PM2.5 concentrations from 2022 to 2025 at two air-quality monitoring sites in Southern California (Los Angeles and Riverside). The context consists of on-site meteorology (wind speed, temperature, relative humidity, solar and UV radiation, barometric pressure), ERA5 reanalysis variables (surface pressure, skin temperature, boundary-layer height, total precipitation), and co-pollutants (CO, SO2_2, NO2_2, O3_3).

  • Bike Share [20] (12 variables): Hourly counts of rented bikes in the Capital Bikeshare system (Washington, D.C.) in 2011–2012. The context consists of calendar indicators (season, year, month, holiday, weekday, working day) and weather conditions (weather situation, temperature, feels-like temperature, humidity, wind speed).

  • Appliances [12] (26 variables): Energy use of appliances in a low-energy house, recorded every 10 minutes from January to May 2016. The context consists of lighting energy, temperature and humidity in nine rooms, and outdoor weather from a nearby station.

Baselines

We evaluate CATF against a diverse set of baseline models, including both widely adopted MTS forecasting models and a recent time-series foundation model. This allows us to assess CATF’s effectiveness across a broad range of model designs and forecasting settings.

Worker Models and Their CATF-Enhanced Variants. CATF is a flexible framework that allows users to freely select the architecture of each worker model. In our experiments, we incorporate five established forecasting models as workers: four Transformer-based models—Informer [67], Autoformer [61], FedFormer [68], and i-Transformer [42]—and one CNN-based model, TimesNet [60]. These models are chosen for their strong empirical performance and computational efficiency across a wide range of multivariate time-series forecasting tasks.

Each of these baseline models can be easily integrated as a worker within the CATF framework with minimum efforts. CATF supports both homogeneous (identical) and heterogeneous (mixed) worker configurations. In our main experiments, we instantiate CATF with three identical baseline models as workers (i.e., number of workers = 3). These variants are denoted as CATF-<Baseline> (such as, CATF-TimesNet, CATF-iTransformer).

Time-Series Foundation Model. We additionally compare against Time-MoE [54], a large-scale time-series foundation model based on a sparse Mixture-of-Experts (MoE) architecture that routes each token to a subset of experts through a learned gating network. Time-MoE is a natural reference point for CATF, as both rely on routing inputs to specialized sub-models, but Time-MoE uses soft token-level routing inside a single pretrained network whereas CATF uses hard sample-level routing across independently trained workers. We run the publicly released Time-MoE checkpoint (Time-MoE-50M) in a zero-shot setting on exactly the same test windows, horizons, and normalization schemes as all other models, so that its results are directly comparable.

5.1.3 Hyperparameters. All baselines use the default hyperparameters of their official implementations in the Time-Series Library [1] (Appendix Table 5). Each worker in CATF uses exactly the same configuration as the corresponding baseline, so that differences in accuracy reflect the framework rather than model tuning.

Training. We train all models with Adam and a batch size of 32. Following the standard TSLib settings, baselines are trained for up to 10 epochs with a learning rate of 10−410^{-4} and early stopping on the validation MSE (patience 3). In CATF, the workers use the same learning rate as their baselines, and the manager uses 10−510^{-5} (10−310^{-3} for CATF-FEDformer), both with a weight decay of 10−510^{-5}. Because each sample trains only one of the K=3K = 3 workers per epoch, a worker sees about one third of the training data in each epoch. We therefore train CATF for up to 30 epochs with early stopping (patience 5), three times the epoch budget of the baselines. All settings are listed in Appendix Table 8.

Normalization and evaluation. Because the scale of the input variables differs by orders of magnitude across datasets (e.g., bike counts vs. PM2.5 concentration), we evaluate every model under two common normalization schemes: (i) global normalization, where each variable is standardized with the mean and standard deviation of the training split, and (ii) sample normalization, where each input window is standardized with its own per-variable mean and standard deviation and the target window is scaled with the statistics of the target variable in the input window. For both schemes, predictions are mapped back to the original scale before computing the error, so all reported MSE values are in the original units of the target variable and are comparable across models within a dataset, but not across datasets.

Number of workers. We use K=3K = 3 workers for all datasets and models. The suitable number of workers is dataset dependent (§ 5.3): on PM2.5-RV, K=6K = 6 slightly reduces the MSE (−1.4%-1.4\%) and K=9K = 9 increases it (+2.6%+2.6\%), and on Bike Share, neither improves the MSE (Appendix Table 17); none of these differences are statistically significant except for K=9K = 9 on Bike Share. Since each additional worker adds a forward pass to every training iteration, we fix K=3K = 3 as a trade-off between accuracy and training cost.

Evaluation Results

Table 1 reports the MSE of each baseline and its CATF-enhanced version for every dataset and horizon under both normalization schemes, averaged over 5 independent runs. Lower MSE values indicate better predictive accuracy. The full results, i.e., the mean and standard deviation (SD) over 5 runs for every setting, are given in Appendix Tables 9 and 10 (global normalization) and 10 (sample normalization), and the per-setting MSE reduction of each CATF-enhanced model over its baseline in Appendix Table 11. Table 1 also reports the mean MSE reduction of each CATF-enhanced model over its baseline. Because the error of a collapsed baseline run can be several orders of magnitude larger than that of a stable one (e.g., FEDformer and Autoformer on Weather), this mean is dominated by a few settings; we therefore focus on win counts.

DatasetLyL_yiTransformer (2024a) Global Base+CATFiTransformer (2024a) Sample Base+CATFTimesNet (2023a) Global Base+CATFTimesNet (2023a) Sample Base+CATFFEDformer (2022) Global Base+CATFFEDformer (2022) Sample Base+CATFAutoformer (2021) Global Base+CATFAutoformer (2021) Sample Base+CATFInformer (2021) Global Base+CATFInformer (2021) Sample Base+CATF
Weather96204.7194.9447.0178.3245.6215.9418.6158.528,741351.31,208,418181.739,860419.51,933,907210.11,733442.74,402155.7
Weather192249.3226.7637.6231.6271.1234.8410.6226.128,712548.910,628,690236.8230,293380.4151,937285.46,645426.57,309220.8
Weather336254.6232.3749.2254.8264.8243.3456.7241.850,859559.7380,781267.370,468279.8157,994270.177,472460.23,729240.1
Weather720270.1235.9748.3330.0269.1241.7963.3291.841,001640.8798,364268.3209,899259.729,367296.14,335527.53,637290.7
PM2.5-LA9637.0537.0236.0835.2037.3244.4240.1835.4357.7542.2960.9142.1186.2571.1857.6058.8945.3445.0441.3037.90
PM2.5-LA19240.6441.1740.9340.8140.1642.5242.6239.2565.6345.2564.0743.7766.4364.9461.3765.6246.8042.6642.0639.62
PM2.5-LA33648.7149.3548.8949.8245.9148.5446.4244.6767.4953.9674.3452.0070.5569.2770.7970.8148.2244.7952.8448.27
PM2.5-LA72062.5564.1763.6263.8859.7661.1159.2358.7375.7966.3480.3464.62106.772.36142.772.2352.8151.3762.8863.56
PM2.5-RV9683.3181.0778.8378.4380.6076.5678.8473.83105.687.11105.087.67140.4132.5125.5130.182.4783.0286.2781.69
PM2.5-RV19292.2090.2390.6789.7387.7883.4499.0584.37131.598.74146.296.72142.6133.5158.9163.994.8097.51101.891.40
PM2.5-RV33695.8596.2794.4995.0893.3191.9498.1492.40128.1103.8129.9109.9136.3136.9166.5137.6100.1100.6102.6102.7
PM2.5-RV72087.5887.8987.2886.7087.8687.7385.8186.12115.294.93104.595.63128.4110.8122.7112.592.7988.9894.5794.62
Bike Share9615,88914,81515,13414,25816,96716,45015,51114,288117.5159.7254.2148.6241.1215.6251.9241.6158.1158.9158.0153.8
Bike Share19221,64020,86421,14020,35622,65422,03520,50020,50825,28319,93037,10621,57032,38429,64533,96634,20422,75823,48022,52422,916
Bike Share33627,93927,02527,47726,90728,26727,66127,70227,67228,72123,49843,63227,52839,92937,73548,48941,07428,81832,01829,07533,134
Bike Share72037,41137,45136,71437,84536,83838,76035,96838,22834,86432,85853,51139,90244,13939,98251,27747,75034,91735,41637,20136,790
Appliances968,0958,08417,08810,2679,8648,35016,59311,35610,0919,25317,44516,58416,9359,94176,71712,5998,9217,95038,93611,884
Appliances1928,1238,12912,00011,15010,1218,46822,15212,9099,4639,02026,19112,53536,46010,65097,07213,5589,2177,93952,66112,043
Appliances3367,8477,76114,40810,3629,8438,04422,15210,6249,1478,55946,91212,29411,73910,19880,91312,2618,3297,68147,69215,531
Appliances7208,0468,04816,87711,4788,8618,28018,18611,30810,0639,08042,26412,63713,5749,70653,32911,3988,2617,87031,36512,709
CATF Win12/2016/2015/2017/2020/2020/2019/2014/2014/2015/20
Impr. (%)+2.4+18.4+4.1+21.9+32.6+47.8+30.9+40.8+20.0+34.1

Table 1. Forecasting results (MSE on the original scale, mean over 5 runs) of each baseline (Base) and its CATF-enhanced version (+CATF) under global and sample normalization; look-back length L=96L = 96. The better of each baseline and its CATF-enhanced version is in bold; the best result in each row is marked with a dark orange background and the second best with a light orange background. CATF Win: number of the 20 settings (5 datasets × 4 horizons) in which CATF-<baseline> has a lower mean MSE than <baseline>. Impr.: relative MSE reduction of CATF-<baseline> over <baseline>, averaged over the 20 settings. The very large MSE of some baselines on Weather is caused by missing-value codes in the training target (Appendix § 10.§ 6). Mean ± SD for every setting is listed in Appendix Tables 9 and 10.

Baseline vs CATF-Enhanced

Table 1 presents the performance of each baseline model and its corresponding CATF-enhanced variant side by side for direct comparison.

CATF-<baseline> consistently improves over the baseline models. Across the 100 baseline–variant pairs per normalization scheme (5 baselines × 5 datasets × 4 horizons), CATF-<baseline> achieves a lower MSE than its baseline in 80 pairs under global normalization and 82 pairs under sample normalization. The gains are consistent across horizons: CATF wins in 23, 20, 19, and 18 of the 25 pairs at Ly=96,192,336,720L_y = 96, 192, 336, 720 under global normalization (23, 20, 20, and 19 under sample normalization), so the benefit only slightly decreases as the horizon grows. Moreover, when each model uses its better normalization scheme, the best CATF-enhanced model outperforms the best standalone baseline in 19 of the 20 settings (Table 2).

DatasetLyL_yBest baselineBest CATF-enhancedTime-MoE (2025)
ModelMSEModelMSEMSE
Weather96iTransformer204.7G204.7^{\mathrm{G}}CATF-Informer155.7S155.7^{\mathrm{S}}164.9S164.9^{\mathrm{S}}
192iTransformer249.3G249.3^{\mathrm{G}}CATF-Informer220.8S220.8^{\mathrm{S}}215.0S215.0^{\mathrm{S}}
336iTransformer254.6G254.6^{\mathrm{G}}CATF-iTransformer232.3G232.3^{\mathrm{G}}225.6S225.6^{\mathrm{S}}
720TimesNet269.1G269.1^{\mathrm{G}}CATF-iTransformer235.9G235.9^{\mathrm{G}}233.5S233.5^{\mathrm{S}}
PM2.5-LA96iTransformer36.08S36.08^{\mathrm{S}}CATF-iTransformer35.20S35.20^{\mathrm{S}}39.66S39.66^{\mathrm{S}}
192TimesNet40.16G40.16^{\mathrm{G}}CATF-TimesNet39.25S39.25^{\mathrm{S}}43.16S43.16^{\mathrm{S}}
336TimesNet45.91G45.91^{\mathrm{G}}CATF-TimesNet44.67S44.67^{\mathrm{S}}51.37G51.37^{\mathrm{G}}
720Informer52.81G52.81^{\mathrm{G}}CATF-Informer51.37G51.37^{\mathrm{G}}60.59G60.59^{\mathrm{G}}
PM2.5-RV96iTransformer78.83S78.83^{\mathrm{S}}CATF-TimesNet73.83S73.83^{\mathrm{S}}78.68G78.68^{\mathrm{G}}
192TimesNet87.78G87.78^{\mathrm{G}}CATF-TimesNet83.44G83.44^{\mathrm{G}}87.28G87.28^{\mathrm{G}}
336TimesNet93.31G93.31^{\mathrm{G}}CATF-TimesNet91.94G91.94^{\mathrm{G}}91.45G91.45^{\mathrm{G}}
720TimesNet85.81S85.81^{\mathrm{S}}CATF-TimesNet86.12S86.12^{\mathrm{S}}87.41G87.41^{\mathrm{G}}
Bike Share96iTransformer15,134S15{,}134^{\mathrm{S}}CATF-iTransformer14,258S14{,}258^{\mathrm{S}}15,802S15{,}802^{\mathrm{S}}
192TimesNet20,500S20{,}500^{\mathrm{S}}CATF-FEDformer19,930G19{,}930^{\mathrm{G}}20,044G20{,}044^{\mathrm{G}}
336iTransformer27,477S27{,}477^{\mathrm{S}}CATF-FEDformer23,498G23{,}498^{\mathrm{G}}23,512G23{,}512^{\mathrm{G}}
720FEDformer34,864G34{,}864^{\mathrm{G}}CATF-FEDformer32,858G32{,}858^{\mathrm{G}}30,793G30{,}793^{\mathrm{G}}
Appliances96iTransformer8,095G8{,}095^{\mathrm{G}}CATF-Informer7,950G7{,}950^{\mathrm{G}}8,954G8{,}954^{\mathrm{G}}
192iTransformer8,123G8{,}123^{\mathrm{G}}CATF-Informer7,739G7{,}739^{\mathrm{G}}8,596G8{,}596^{\mathrm{G}}
336iTransformer7,847G7{,}847^{\mathrm{G}}CATF-Informer7,681G7{,}681^{\mathrm{G}}8,145G8{,}145^{\mathrm{G}}
720iTransformer8,046G8{,}046^{\mathrm{G}}CATF-Informer7,870G7{,}870^{\mathrm{G}}8,511G8{,}511^{\mathrm{G}}
CATF Win19/20–15/20
Impr. (%)+5.9–+4.9

Table 2. Best standalone baseline vs. best CATF-enhanced model vs. zero-shot Time-MoE [54]. For each setting, the best baseline (best CATF-enhanced model) is the lowest mean MSE over the five baselines (CATF-enhanced models) and the two normalization schemes; for Time-MoE (single deterministic run), the better of the two normalization schemes is used. The superscript gives the normalization (G: global, S: sample). The best result in each row is in bold with a light orange background. CATF Win: number of the 20 settings in which the best CATF-enhanced model has a lower MSE than the best baseline (Time-MoE); Impr.: relative MSE reduction of the best CATF-enhanced model over the best baseline (Time-MoE), averaged over the 20 settings.

CATF improves every worker type, with the largest gains for the less stable baselines. Of the 20 settings (5 datasets × 4 horizons), CATF-iTransformer achieves a lower MSE than iTransformer in 12 under global and 16 under sample normalization, and CATF-TimesNet than TimesNet in 15 and 17; for these strong and recent workers, the improvements are smaller but still consistent. The gains are largest for the older and less stable workers: CATF-FEDformer outperforms FEDformer in all 20 settings under both schemes, CATF-Autoformer outperforms Autoformer in 19 and 14, and CATF-Informer outperforms Informer in 14 and 15.

CATF stabilizes training. A striking effect of CATF is the reduction of run-to-run variance. Several standalone baselines occasionally diverge on the original-scale targets, most visibly FEDformer, Autoformer, and Informer on Weather, whose MSE rises to 10310^{3}–10510^{5} under global and up to 10710^{7} under sample normalization, with an SD of the same order. This instability can be traced to the missing-value codes in the training target of Weather (Appendix § 10.§ 6). Their CATF-enhanced counterparts remain within the range of the strong baselines (e.g., FEDformer on Weather at Ly=96L_y = 96: 28,741 ± 16,160 vs. 351.3 ± 97.8 with CATF). Because each worker only needs to fit the subset of contexts routed to it, the manager–worker decomposition makes the optimization of each worker considerably easier.

The best CATF-enhanced model depends on the dataset. Across both normalization schemes, a CATF-enhanced model obtains the best result in 19 of the 20 settings of Table 1; the only exception is PM2.5-RV at Ly=720L_y = 720, where the standalone TimesNet is best. The best worker type depends on the dataset: CATF-Informer on Appliances, the short horizons of Weather, and PM2.5-LA at Ly=720L_y = 720; CATF-iTransformer on the long horizons of Weather and at Ly=96L_y = 96 on PM2.5-LA and Bike Share; CATF-FEDformer on Bike Share at Ly≥192L_y \ge192; and CATF-TimesNet on PM2.5-RV and PM2.5-LA at Ly∈{192,336}L_y \in\{192, 336\}. Within each normalization scheme, a CATF-enhanced model is best in 18 of the 20 settings, both under global and under sample normalization (Appendix Tables 9 and 10).

5.2.2 CATF vs. Time-MoE. Table 2 compares, for each setting, the best standalone baseline, the best CATF-enhanced model, and zero-shot Time-MoE, each under its better normalization scheme. Time-MoE is evaluated zero-shot and is deterministic, so it is reported from a single run. The best CATF-enhanced model achieves a lower MSE than the best baseline in 19 of the 20 settings and than Time-MoE in 15 of the 20 settings (mean MSE reduction 4.9%). Time-MoE is better in the five settings, mostly at longer horizons (Weather for Ly≥192L_y \ge192, PM2.5-RV for Ly=336L_y = 336, and Bike Share for Ly=720L_y = 720). Overall, CATF allows comparatively small task-specific models to match or exceed a large pretrained foundation model on most context-rich forecasting tasks, while using a single worker per input at inference time.

Ablation Study

We conduct the ablation study with CATF-iTransformer on PM2.5-RV under global normalization and L=Ly=96L = L_y = 96. The default configuration is identical to that of the main experiments: three homogeneous workers, a two-layer Transformer manager (dmodel=512d_{model} = 512, dff=2048d_{ff} = 2048, 8 heads, dropout 0.05), and the combined KL and Wasserstein manager loss with group-lasso regularization. In each ablation, we change exactly one component and keep the others fixed. Each setting is repeated over 5 runs without fixed random seeds, and we test the difference from the default with Welch’s tt-test. The default reaches an MSE of 80.52, consistent with Table 1 (81.07). Table 3 summarizes the results; Appendix § 11 reports the same ablation on Bike Share.

SettingMSEΔ (%)pp
Default80.52 ± 1.02––
LossKL only81.87 ± 2.75+1.70.347
Wasserstein only81.56 ± 1.10+1.30.157
Reg.No reg.80.94 ± 1.19+0.50.559
ManagerSmall (dmodel=128d_{model}=128)81.23 ± 0.78+0.90.252
Large (dmodel=768d_{model}=768)81.05 ± 0.81+0.70.386
WorkersK=6K=679.37 ± 1.14−1.40.132
K=9K=982.61 ± 2.99+2.60.200
MixTop-3 models1 (K=3K=3)81.63 ± 2.13+1.40.334
Top-2 modelsa^{a} ×2 (K=4K=4)80.04 ± 2.70−0.60.728

Table 3. Ablation study of CATF-iTransformer on PM2.5-RV (global normalization, L=Ly=96L = L_y = 96). MSE is mean ± SD over 5 runs without fixed random seeds; the default setting is an independent re-run of the configuration in Table 1 (MSE 81.07 ± 1.18 there). Δ is the relative change in mean MSE w.r.t. the default (positive is worse); pp is from Welch’s tt-test against the default (bold: p<0.05p < 0.05). The results on Bike Share are reported in Appendix Table 17.

Overall, removing or changing any component of the manager increases the MSE by 0.5–1.7%. Changing the number or mix of workers changes the MSE by −1.4% to +2.6%; K=6K=6 and the mixture of the top-2 models are slightly better than the default. None of these differences is statistically significant (p≥0.13p \ge0.13), so CATF is robust to these design choices. On Bike Share, the results are similar, except that nine workers and mixing workers with different architectures significantly degrade the MSE (Appendix Table 17).

5.3.1 Manager Model Loss Function. The manager loss (Equation (7)) consists of a divergence term, which combines the KL divergence and the Wasserstein distance, and a group-lasso regularization term on the manager’s parameters.

Divergence Term. Removing either divergence term increases the error. With the KL divergence alone, the MSE increases by 1.7% (p=0.35p = 0.35), and its run-to-run SD is almost three times that of the default (2.75 vs. 1.02). With the Wasserstein distance alone, the MSE increases by 1.3% (p=0.16p = 0.16). On Bike Share, the Wasserstein distance alone also over-concentrates the routing: the most used worker receives 73% of the test samples on average, compared with 49% for the default. The combined loss therefore achieves the lowest mean error, although the differences are not statistically significant, and we use it as the default.

Regularization. Removing the regularization term slightly increases the MSE (+0.5%, p=0.56p = 0.56). We keep it in the default configuration.

5.3.2 Manager Model Architecture. We test a smaller manager (dmodel=128d_{model} = 128, dff=512d_{ff} = 512, 4 heads) and a larger one (dmodel=768d_{model} = 768, dff=3076d_{ff} = 3076, 12 heads). Both slightly degrade the MSE, by 0.9% and 0.7%, although the differences are not statistically significant (p≥0.25p \ge0.25). The larger manager doubles the total number of parameters of CATF-iTransformer (15.5M vs. 7.3M) without improving the accuracy, whereas the smaller one reduces it to 1.1M at a small cost in accuracy. The default

manager capacity therefore gives the best accuracy among the tested sizes, and CATF is not highly sensitive.

Number of Workers

Increasing the number of workers from K=3K = 3 to K=6K = 6 reduces the MSE by 1.4% (p=0.13p = 0.13), whereas K=9K = 9 increases it by 2.6% (p=0.20p = 0.20) and leads to the largest run-to-run variation (SD 2.99). PM2.5-RV has 14 context variables from on-site meteorology, reanalysis data, and co-pollutants, which may benefit from a moderately larger number of workers. On Bike Share, whose context consists of a small number of calendar and weather variables, neither K=6K = 6 nor K=9K = 9 improves the MSE. The suitable KK is therefore dataset dependent, and we use K=3K = 3 in the main experiments as a trade-off between accuracy and cost. A promising direction for future work is to determine the number of workers adaptively, e.g., by estimating the number of latent context regimes in the data.

Mixture of Workers

We also explore heterogeneous worker configurations by combining the top-performing models on PM2.5-RV, i.e., 1×TimesNet + 1×iTransformer + 1×Informer or 2×TimesNet + 2×iTransformer. Both mixtures perform on par with the default (+1.4% and −0.6%, p≥0.33p \ge0.33), with a larger run-to-run variation (SD 2.13 and 2.70). On Bike Share, the corresponding 3-model mixture significantly degrades the MSE by 13.1% (p<0.001p < 0.001). Thus, heterogeneous mixtures do not consistently improve forecasting accuracy, and we use homogeneous workers in the main experiments. A promising direction for future work is to explore targeted regularization or adaptive routing strategies to better leverage the complementary strengths of diverse worker models.

Case Study: Interpreting the Routing

Because each prediction of CATF is produced by a single Worker, which Worker handles which input can be observed directly, without the approximations of post-hoc explanation methods such as attention weights [39] or feature attributions [16, 49]. We examine whether these routing decisions reflect the context on Bike Share, where the effect of the context is well known: bike demand has two commuting peaks on working days and a single midday peak on weekends. We analyze

CATF-iTransformer (L=Ly=96L = L_y = 96, global normalization, K=3K = 3, five runs) with three questions: (i) does the learned routing improve the forecasts, (ii) which input variables drive the routing, and (iii) what has each Worker learned. As a sanity check [2], we repeat each analysis with an untrained Manager of the same architecture; a pattern that also appears for the untrained Manager reflects the input data rather than what the Manager has learned. On synthetic data with known regimes, the same analysis recovers the true regimes, the variable that determines them, and the specialization of the Workers (Appendix § 12.§ 2). Workers are labeled by test usage (W1W_1 is the most used); details of the analysis are given in Appendix § 12.§ 1.

Does the learned routing improve the forecasts? During inference, we keep the trained Workers unchanged and replace only the Manager’s routing with alternative assignments, so that any change in accuracy is due to the routing alone. The learned routing (MSE 15,000) outperforms random routing with the same Worker shares (16,175) and the untrained Manager (15,876) in all five runs, and the best single Worker for all samples (15,376) in three of five runs (Figure 3a). The gain comes from the specialization of the Workers. For the samples that the Manager routes to a given Worker, Figure 3c compares the MSE of all three Workers: the selected Worker is the most accurate, and the other two Workers have a 9–23% higher MSE. Each Worker is thus better than the others on its own samples, so the routing must send each sample to the right Worker; random routing, which ignores the context, loses this advantage.

Three-panel bar chart and heatmap showing routing performance, permutation importance, and relative MSE

Figure 3. Routing of CATF-iTransformer on Bike Share (mean over 5 runs). (a) Test MSE of the same trained workers under the learned routing, the best single worker for all samples, an untrained manager, and random routing with the same worker shares. (b) Share of routing decisions that change when one variable is shuffled across test samples in the manager input only (top 8 of 12 inputs; “All context” shuffles all context variables at once), for the trained and an untrained manager. (c) MSE of each worker on the samples routed to each worker, divided by the lowest MSE in the row and averaged over runs.

Which input variables drive the routing? We shuffle one input variable at a time across the test samples in the Manager input only and record the share of routing decisions that change (permutation importance [10]). The day of the week is by far the most important variable (37% of the decisions change, vs. 10% for the untrained Manager), followed by the target history (22% vs. 9%) and the working-day indicator (20% vs. 6%), whereas each weather variable changes only 8–10% (Figure 3b). A counterfactual analysis shows that these calendar variables, i.e., the day of the week and the working-day indicator, cause the routing: when the day of the week of the input window is shifted by d∈{1,…,6}d \in\{1,\ldots,6\} days, 55% of the decisions change, and 80% of the new decisions match the typical Worker of the shifted day; when instead the target history is replaced with that of dd days later and the calendar is kept, only 11% change (Appendix Figure 7).

What has each Worker learned? As shown above, the routing is driven by the calendar variables, i.e., the day of the week and the working-day indicator, which together determine how many working days and weekend days the forecast window contains. We therefore first examine how the Workers divide the week. The Manager splits the week by the days in the 96-hour forecast window (Figure 4a): forecasts made on Sunday to Tuesday, whose window consists mostly of working days, go to W1W_1; forecasts made on Wednesday to Friday, whose window reaches into the weekend, mostly to W2W_2; and forecasts made on Friday and Saturday, whose window starts with the weekend, mostly to W3W_3. Each Worker therefore forecasts a different demand trajectory (Figure 4b): demand recovering from the weekend, demand declining toward the weekend, and the weekend itself. The other context variables are only weakly related to the routing: the NMI between the selected Worker and the day of the week is 0.44, compared with at most 0.05 for the holiday indicator, the month, each weather variable, and the recent demand (Appendix Figure 10). The context of the samples handled by each Worker shows the same picture (Appendix Figure 9): each Worker has learned the patterns of a different context, and the differences between the Workers are largest for the context variables that drive the routing. Over the input and forecast windows, the Workers differ most in the working-day share, by 1.2 standard deviations between the Worker means, and accordingly in the demand trajectory, so each Worker is trained on and specializes in a different weekly pattern. For the weather variables, the differences are much smaller (0.2–0.4 standard deviations) and largely reflect the days on which the weather occurred; the weather has low importance because the Manager sees only the past weather, which says little about the forecast window. All five runs partition the samples by the day of the week, although the boundaries between the Workers differ between runs (Appendix § 12.§ 3).

Routing share by origin day and demand in the forecast window by selected worker

Figure 4. What each worker of CATF-iTransformer handles on Bike Share (one run). (a) Share of the forecasts made on each day of the week that are routed to each worker. (b) Mean bike rentals in the 96-hour forecast window for the forecasts made at midnight, grouped by the selected worker. W1W_1 handles the forecasts made on Sunday to Tuesday, whose window consists mostly of working days (29 forecasts, on average 3.4 working days in the window); W2W_2 handles the forecasts made on Wednesday to Friday, whose window reaches into the weekend (29 forecasts, 2.3 working days); W3W_3 handles the forecasts made on Friday and Saturday, whose window starts with the weekend (11 forecasts, 1.9 working days).

In summary, the routing of CATF on Bike Share is consistent with domain knowledge: the Manager infers the upcoming working-day/weekend pattern from the calendar, and each phase of the week is handled by a Worker that specializes in it.

Discussion

When does CATF help? The routing is most useful when the forecasting regime is determined by the context. On Bike Share, the calendar determines whether the forecast window contains working days or the weekend, and the learned routing clearly outperforms random routing (§ 6); on synthetic data with context-driven regimes, the Manager recovers the regimes almost perfectly (Appendix § 12.§ 2). On PM2.5-RV, where the concentration varies with continuously changing meteorological conditions, the Workers barely specialize and the learned routing is on par with the best single Worker (Appendix § 12.§ 4). The routing analysis therefore also indicates whether a dataset contains context-driven regimes. Independently of the routing, splitting the data among several Workers stabilizes the training of baselines that diverge on Weather, whose training target contains missing-value codes (§ 5.2).

Interpretability. The routing decisions are an exact description of which Worker produced a forecast, and they can be related to the context with simple tools such as permutation importance and counterfactuals. They explain, however, only which Worker is used, not how this Worker arrives at its forecast. Moreover, the partition learned by the Manager can differ between runs, e.g., in where the boundaries between the Workers lie or in whether holidays are treated as weekends (Appendix § 12.§ 3); interpretations should therefore be checked across several runs.

Limitations and future work. CATF trains the Manager and all Workers jointly and therefore needs considerably more training time and memory than a single model (Appendix Table 16); at inference time, only the Manager and the selected Worker are executed. The suitable number of Workers is dataset dependent and is currently set by hand (§ 5.3), and mixtures of different worker architectures did not consistently improve the accuracy. Promising directions are to determine the number of Workers adaptively, e.g., by estimating the number of latent context regimes, to better exploit heterogeneous Workers, and to apply the Manager–Worker design to other context-dependent prediction tasks, such as trajectory forecasting or human behavior modeling.

Conclusion

We introduced CATF, a context-aware forecasting framework in which a Transformer-based Manager routes each input to one of several Worker models, trained jointly so that the Workers specialize without manual data partitioning. Experiments on five context-rich datasets, four forecasting horizons, and two normalization schemes show that CATF consistently improves its standalone counterparts, reduces their run-to-run variance, and is competitive with a pretrained foundation model, and a case study on bike-sharing data shows that its routing decisions follow the context in an interpretable way.

Experiment Details

Dataset

We conducted our comparative experiments on 5 datasets: Weather, PM2.5-LA, PM2.5-RV, Bike Share, and Appliances. For every dataset, the timestamp column is dropped, the last column is used as the forecasting target, and all remaining columns are used as context. The details of the datasets are presented in Table 4.

Dataset#VariablesTargetInput Length (LL)Output Length (LyL_y)FrequencyDataset SizeDomain
Weather21CO2_2 (ppm)96{96, 192, 336, 720}10 minutes52,696Meteorology
PM2.5-LA15PM2.5 (μ\mug/m3^3)96{96, 192, 336, 720}1 hour35,063Air quality
PM2.5-RV15PM2.5 (μ\mug/m3^3)96{96, 192, 336, 720}1 hour35,063Air quality
Bike Share12Rental count96{96, 192, 336, 720}1 hour17,379Transportation
Appliances26Energy use (Wh)96{96, 192, 336, 720}10 minutes19,735Energy

Table 4. Statistics of the datasets used in the forecasting tasks. #Variables counts all numeric columns, including the target. Dataset Size is the number of time steps.

Hyper-parameters

To ensure a much fairer comparison, we adopted baseline hyperparameters from scripts in Time-Series Library [1], which are the same as worker models, presented in Table 5. For the manager, we used the same default setting of hyperparameters (Table 6), except for fine-tuning the manager model learning rates for some experiments (Table 7).

Model#Layers#Model Dimension#Feedforward Dimension#Attention Heads#Dropout#Attention Factor#Learning Rate
i-Transformer212812880.130.0001
TimesNet2323280.130.0001
FEDformer2512204880.130.0001
Autoformer2512204880.130.0001
Informer2512204880.130.0001

Table 5. Summary of worker models and baselines’ hyperparameters used in our CATF framework.

Model Type#Layers#Model Dimension#Feedforward Dimension#Attention Heads#Dropout
Transformer2512204880.05

Table 6. Default setting of the manager model hyperparameter that is used in our CATF framework.

ModelManager LRWorker LR
CATF-iTransformer0.000010.0001
CATF-TimesNet0.000010.0001
CATF-FEDformer0.0010.0001
CATF-Autoformer0.000010.0001
CATF-Informer0.000010.0001

Table 7. Learning rates of the manager and worker models in CATF-enhanced models (identical for all datasets). Both are optimized with Adam and a weight decay of 10−510^{-5}.

Worker Models

Worker Models. We adopted the same worker model hyperparameter as the baseline. All models have the same hyperparameter settings across all datasets, as follows.

Manager Models

Manager Models. For all the training of CATF-<baseline> models in comparative experiments, we use the same hyperparameters of the manager model architecture, except we fine-tuned some manager models’ learning rates for some datasets.

Here are the default settings of the hyperparameters for the manager model architecture in Table 6.

Table 7 summarizes the learning rates and optimizer settings used for the manager and the workers. The same values are used for all datasets, horizons, and normalization schemes.

Training

In Table 8, we present the shared and CATF-specific training settings, including split sizes, epochs, etc.

HyperparameterBaselineCATF Models
Shared Settings
Batch Size3232
Training Size0.80.8
Validation Size0.10.1
Test Size0.10.1
Epochs1030
Early Stopping Patience35
OptimizerAdamAdam (weight decay 10−510^{-5})
Runs per setting55
CATF-Specific Settings
Number of Workers-3
Gradient Clipping Value-1
Worker Update Steps-2

Table 8. Training hyperparameters for CATF and Baseline models.

Complete Results of Forecasting Tasks

Full Results

Table 9 and Table 10 report the MSE of every baseline and its CATF-enhanced version for each dataset and horizon under global and sample normalization (mean ±\pm SD over 5 runs). They complement Table 1, which reports the mean MSE only.

DatasetLyL_yiTransformer (2024a)CATF-iTransformerTimesNet (2023a)CATF-TimesNetFEDformer (2022)CATF-FEDformerAutoformer (2021)CATF-AutoformerInformer (2021)CATF-Informer
Weather96204.7 ± 2.29194.9 ± 5.19245.6 ± 10.69215.9 ± 21.5328,741 ± 16,160351.3 ± 97.7839,860 ± 35,693419.5 ± 104.11,733 ± 830.7442.7 ± 35.52
192249.3 ± 3.11226.7 ± 8.12271.1 ± 13.23234.8 ± 8.9128,712 ± 19,726548.9 ± 19.67230,293 ± 340,357380.4 ± 53.866,645 ± 10,171426.5 ± 44.44
336254.6 ± 2.15232.3 ± 3.39264.8 ± 3.40243.3 ± 6.2050,859 ± 39,591559.7 ± 79.0070,468 ± 97,935279.8 ± 13.2477,472 ± 170,210460.2 ± 41.99
720270.1 ± 2.85235.9 ± 6.54269.1 ± 5.97241.7 ± 4.2341,001 ± 22,172640.8 ± 66.33209,899 ± 267,336259.7 ± 12.004,335 ± 4,652527.5 ± 59.48
PM2.5-LA9637.05 ± 0.3937.02 ± 0.2837.32 ± 1.6844.42 ± 3.6457.75 ± 4.3142.29 ± 1.2986.25 ± 24.2671.18 ± 6.1345.34 ± 4.3745.04 ± 6.22
19240.64 ± 0.3041.17 ± 0.2440.16 ± 1.9442.52 ± 2.3665.63 ± 1.7345.25 ± 0.8666.43 ± 8.0364.94 ± 4.6546.80 ± 3.0842.66 ± 0.25
33648.71 ± 0.1449.35 ± 0.7645.91 ± 2.0148.54 ± 1.9767.49 ± 2.7553.96 ± 2.7870.55 ± 5.0969.27 ± 2.7848.22 ± 2.5544.79 ± 0.57
72062.55 ± 0.3764.17 ± 0.4259.76 ± 1.0661.11 ± 2.9375.79 ± 5.6266.34 ± 1.85106.7 ± 42.7172.36 ± 3.8052.81 ± 0.8051.37 ± 0.79
PM2.5-RV9683.31 ± 0.6381.07 ± 1.1880.60 ± 4.7376.56 ± 1.93105.6 ± 5.0287.11 ± 2.39140.4 ± 27.32132.5 ± 9.8882.47 ± 6.0383.02 ± 0.82
19292.20 ± 0.7190.23 ± 0.5887.78 ± 4.0683.44 ± 1.35131.5 ± 8.3098.74 ± 9.20142.6 ± 26.11133.5 ± 14.5194.80 ± 5.0197.51 ± 1.59
33695.85 ± 1.5796.27 ± 1.1593.31 ± 2.4991.94 ± 1.95128.1 ± 6.07103.8 ± 6.66136.3 ± 11.15136.9 ± 9.93100.1 ± 3.35100.6 ± 0.74
72087.58 ± 0.6687.89 ± 0.2387.86 ± 1.2887.73 ± 1.56115.2 ± 16.0294.83 ± 1.54128.4 ± 45.85110.8 ± 4.5592.70 ± 3.4189.88 ± 0.59
Bike Share9615,889 ± 189.814,815 ± 78.4616,967 ± 583.816,450 ± 1,16618,171 ± 6,19215,597 ± 1,34424,641 ± 3,57921,516 ± 2,91818,653 ± 1,79818,214 ± 515.1
19221,640 ± 188.720,364 ± 19.9422,654 ± 455.722,035 ± 731.125,238 ± 1,52419,930 ± 655.732,384 ± 1,68929,645 ± 1,02327,528 ± 1,58523,480 ± 732.0
33627,939 ± 175.927,025 ± 15.1528,267 ± 425.427,661 ± 424.528,725 ± 2,80223,498 ± 770.539,925 ± 3,91237,735 ± 4,62328,818 ± 6,70032,018 ± 1,878
72037,411 ± 193.737,451 ± 257.136,838 ± 960.638,760 ± 373.434,864 ± 2,45432,858 ± 2,24544,139 ± 1,90239,982 ± 2,29634,947 ± 51.0635,416 ± 3,309
Appliances968,095 ± 194.78,084 ± 96.989,864 ± 703.88,350 ± 152.610,091 ± 737.99,235 ± 152.416,935 ± 1,4639,941 ± 287.88,921 ± 830.97,950 ± 321.7
1928,123 ± 95.148,129 ± 38.7110,121 ± 918.28,468 ± 187.69,436 ± 176.29,027 ± 178.213,646 ± 2,75610,650 ± 449.09,172 ± 488.47,739 ± 332.7
3367,847 ± 36.027,761 ± 36.029,843 ± 1,3388,044 ± 155.79,147 ± 520.28,559 ± 930.011,739 ± 3,49410,198 ± 434.58,329 ± 365.67,681 ± 207.4
7208,046 ± 38.008,048 ± 63.828,861 ± 654.18,280 ± 87.4610,063 ± 779.39,030 ± 118.113,574 ± 3,1839,706 ± 124.98,261 ± 225.27,870 ± 175.5
CATF Win1215201914
Impr. (%) (mean)+2.4+4.1+32.6+30.9+20.0

Table 9. Long-term forecasting results under Global normalization. MSE is computed on the original (de-normalized) scale and reported as MEAN ± SD over 5 runs. The look-back length is 96 for all settings. The better of each baseline and its CATF-enhanced version is in bold; the best result in each row is marked with a dark orange background and the second best with a light orange background. CATF Win: number of the 20 settings (5 datasets × 4 horizons) in which CATF-<baseline> has a lower mean MSE than <baseline>. Impr.: relative MSE reduction of CATF-<baseline> over <baseline>, averaged over the 20 settings.

DatasetLyL_yiTransformer (2024a)CATF-iTransformerTimesNet (2023a)CATF-TimesNetFEDformer (2022)CATF-FEDformerAutoformer (2021)CATF-AutoformerInformer (2021)CATF-Informer
Weather96447.0 ± 47.3178.3 ± 9.8416.0 ± 153.0152.5 ± 10.521,208,418 ± 1,398,675181.1 ± 2.31,933,907 ± 1,800,987181.1 ± 24.664,402 ± 3,262155.7 ± 6.54
192637.6 ± 71.19231.6 ± 4.39410.6 ± 120.8226.1 ± 6.4910,628,690 ± 15,360,229236.8 ± 9.04151,937 ± 325,720285.4 ± 31.477,309 ± 2,449220.8 ± 15.75
336749.2 ± 64.09245.8 ± 8.98456.7 ± 167.3241.8 ± 6.77380,781 ± 420,438276.3 ± 16.56157,994 ± 251,704270.1 ± 12.013,729 ± 1,141240.1 ± 5.54
720748.3 ± 46.15335.0 ± 35.88963.3 ± 360.3291.8 ± 17.00798,364 ± 652,673268.3 ± 18.8729,367 ± 28,419296.1 ± 33.973,637 ± 1,223290.7 ± 16.44
PM2.5-LA9636.08 ± 0.9635.20 ± 0.9640.18 ± 4.2035.45 ± 3.1060.91 ± 9.8842.11 ± 2.0257.60 ± 6.9158.89 ± 3.5241.30 ± 2.2437.90 ± 1.28
19240.93 ± 0.4840.81 ± 0.4642.62 ± 3.6739.25 ± 1.7364.07 ± 2.9443.77 ± 1.8165.62 ± 8.9665.82 ± 8.9642.06 ± 1.1039.62 ± 0.90
33648.89 ± 0.3849.82 ± 0.6946.42 ± 0.9646.47 ± 2.0574.34 ± 9.0152.00 ± 2.8770.79 ± 23.1170.81 ± 3.6552.84 ± 2.2648.27 ± 3.12
72063.62 ± 1.4563.88 ± 1.1559.23 ± 0.7558.73 ± 1.9480.34 ± 13.9864.62 ± 1.35142.7 ± 82.9272.23 ± 2.7262.88 ± 2.0463.56 ± 2.81
PM2.5-RV9678.83 ± 0.7073.48 ± 0.4278.84 ± 4.1673.83 ± 1.74105.0 ± 10.3587.67 ± 2.04125.5 ± 11.71130.1 ± 13.8086.27 ± 6.2381.69 ± 3.16
19290.67 ± 1.4789.73 ± 0.5299.05 ± 6.7284.37 ± 4.47146.2 ± 3.4496.72 ± 4.31158.9 ± 35.83163.9 ± 38.35101.8 ± 5.4191.40 ± 1.67
33694.49 ± 1.7195.08 ± 1.8598.14 ± 3.7194.20 ± 1.92129.9 ± 10.81109.9 ± 3.75166.5 ± 39.61137.6 ± 10.42102.6 ± 14.28102.7 ± 2.36
72087.28 ± 0.8086.70 ± 0.8485.51 ± 1.5786.12 ± 1.11104.5 ± 9.9295.63 ± 2.94122.7 ± 15.69112.5 ± 1.0194.57 ± 5.9894.62 ± 4.06
Bike Share9615,134 ± 148.114,258 ± 35335,418 ± 861.614,586 ± 1,19227,592 ± 2,13019,444 ± 675.725,573 ± 3,91525,739 ± 4,50316,080 ± 4,46515,038 ± 871.0
19221,140 ± 109.620,356 ± 179.029,500 ± 527.820,508 ± 713.837,106 ± 3,51921,570 ± 226.833,966 ± 2,00934,204 ± 3,55522,524 ± 578.722,916 ± 969.5
33627,477 ± 214.326,907 ± 469.929,702 ± 622.427,672 ± 273.743,632 ± 3,06827,528 ± 715.948,489 ± 3,28841,474 ± 1,97529,075 ± 676.533,134 ± 1.69
72036,714 ± 28837,845 ± 447.935,968 ± 824.938,228 ± 1,15053,511 ± 2,41239,902 ± 934.951,277 ± 4,94247,750 ± 2,46537,201 ± 1,04436,790 ± 2,374
Appliances9617,088 ± 2,51810,267 ± 727.916,593 ± 1,27311,356 ± 1,93817,445 ± 2,98513,584 ± 2,19776,717 ± 96,32912,599 ± 1,49438,936 ± 15,59411,884 ± 2,970
19212,600 ± 906.810,150 ± 1,70815,221 ± 5,40112,079 ± 883.926,191 ± 9,76115,355 ± 2,33597,072 ± 27,51113,580 ± 1,08152,661 ± 22,98112,043 ± 3,531
33614,408 ± 1,90510,362 ± 1,07622,152 ± 7,00510,624 ± 1,11346,912 ± 43,30212,294 ± 1,32280,913 ± 63,97112,261 ± 1,00547,692 ± 24,05115,531 ± 10,359
72016,877 ± 2,27611,478 ± 1,60318,836 ± 4,41811,308 ± 393.442,264 ± 20,69912,637 ± 2,45453,329 ± 58,72713,998 ± 1,10431,365 ± 7,20512,709 ± 2,409
CATF Win1617201415
Impr. (%) (mean)+18.4+21.9+47.8+40.8+34.1

Table 10. Long-term forecasting results under Sample normalization. MSE is computed on the original (de-normalized) scale and reported as MEAN ± SD over 5 runs. The look-back length is 96 for all settings. The better of each baseline and its CATF-enhanced version is in bold; the best result in each row is marked with a dark orange background and the second best with a light orange background. CATF Win: number of the 20 settings (5 datasets × 4 horizons) in which CATF-<baseline> has a lower mean MSE than <baseline>. Impr.: relative MSE reduction of CATF-<baseline> over <baseline>, averaged over the 20 settings.

Reduction Percentage

Table 11 presents the percentage reduction in the MSE mean achieved by the CATF-<baseline> compared to the <baseline>. A lower MSE indicates better performance. To assess whether the improvements are statistically significant, we apply a two-sided Welch’s tt-test to the 5 runs of each CATF-enhanced model and its standalone counterpart in every setting. Of the 200 comparisons, CATF is significantly better in 91 (p<0.05p < 0.05) and significantly worse in 9, and the difference is not significant in the remaining 100. The share of significant improvements is highest for CATF-FEDformer (29 of 40) and lowest for CATF-Autoformer (6 of 40), whose baseline has a very large run-to-run variance, so that even large mean improvements are often not significant with 5 runs.

DatasetLyL_yiTransformer GiTransformer STimesNet GTimesNet SFEDformer GFEDformer SAutoformer GAutoformer SInformer GInformer S
Weather96+4.8+60.1+12.1+62.1+98.8+100.0+98.9+100.0+74.5+96.5
192+9.1+63.7+13.4+44.9+98.1+100.0+99.8+99.8+93.6+97.0
336+8.7+66.0+8.1+47.1+98.9+99.9+99.6+99.8+99.4+93.6
720+12.7+55.9+10.2+69.7+98.4+100.0+99.9+99.0+87.8+92.0
PM2.5-LA96+0.1+2.4<u>-19.0</u>+11.8+26.8+30.9+17.5-2.3+0.7+8.2
192<u>-1.3</u>+0.3-5.9+7.9+31.0+31.7+2.2-6.9+8.8+5.8
336-1.3<u>-1.9</u>-5.7+3.8+20.0+30.1+1.8-0.0+7.1+8.6
720<u>-2.6</u>-0.4-2.3+0.8+12.5+19.6+32.2+49.4+2.7-1.1
PM2.5-RV96+2.7+0.5+5.0+6.4+17.5+16.5+5.6-3.6-0.7+5.3
192+2.1+1.0+4.9+14.8+24.9+33.8+6.4-3.1-2.9+10.2
336-0.4-0.6+1.5+5.8+19.0+15.4-0.5+17.4-0.4-0.0
720-0.4+0.7+0.1-0.4+17.7+8.5+13.7+8.4+3.0-0.1
Bike Share96+6.8+5.8+3.0+3.5+14.2+45.8+12.7+3.0+2.4+6.5
192+3.6+3.7+2.7-0.0+21.2+41.9+8.5-0.7-3.2-1.7
336+3.3+2.1+2.1+0.1+18.2+36.9+5.5+15.3-11.1-14.0
720-0.1<u>-3.1</u><u>-5.2</u><u>-6.3</u>+5.8+25.4+9.4+6.9<u>-1.3</u>+1.1
Appliances96+0.1+39.9+15.3+31.6+8.3+22.1+41.3+83.6+10.9+69.5
192-0.1+11.5+16.3+45.5+4.3+52.8+22.0+86.0+15.6+77.1
336+1.1+28.1+18.3+52.0+6.4+73.8+13.1+84.8+7.8+67.4
720-0.0+32.0+6.6+37.8+9.8+70.1+28.5+78.6+4.7+59.5
#Wins12/2016/2015/2017/2020/2020/2019/2014/2014/2015/20
#Sig. better9/2010/208/2010/2017/2012/204/202/207/2012/20
#Sig. worse2/202/202/201/200/200/200/200/201/201/20

Table 11. MSE reduction (%) of CATF-<baseline> over <baseline>, computed on the mean MSE over 5 runs as (baseline − CATF)/baseline. Positive values mean CATF is better. G = global normalization, S = sample normalization. Significance is tested with a two-sided Welch’s tt-test over the 5 runs of each model: bold = CATF is significantly better (p<0.05p < 0.05), <u>underlined</u> = CATF is significantly worse (p<0.05p < 0.05).

MAE Results

Tables 12 and 13 report the MAE of all models under global and sample normalization, in the same format as Tables 9 and 10. The MAE results are consistent with the MSE results: CATF-enhanced models have a lower mean MAE than their standalone counterparts in 162 of the 200 comparisons (84 under global and 78 under sample normalization).

Global vs. Sample Normalization

Table 14 compares the two normalization schemes for every model. The standalone baselines are clearly sensitive to this choice: global normalization is better in 11–17 of the 20 settings, and sample normalization is drastically worse on Weather and Appliances for most baselines (e.g., +2,976% for FEDformer on Weather). With CATF, this gap shrinks considerably: the median difference over all settings lies between −1.6% and +5.5% for the CATF-enhanced models, compared with +0.5% to +52% for the baselines. Appliances is the only dataset on which global normalization is better for all models, including CATF. Time-MoE, which was pretrained with per-window normalization, is the only model that is much better with sample normalization on Weather (−76%).

Table 14. Global vs. sample normalization. For each model and dataset, the cell is the median over the four horizons of the relative difference in mean MSE, (sample − global)/global (%); positive values mean that global normalization is better. The last two columns give the number of the 20 settings (5 datasets × 4 horizons) in which global normalization is better, and the median relative difference over all 20 settings.

ModelWeatherPM2.5-LAPM2.5-RVBike ShareAppliances#Global betterMedian (all)
iTransformer+166+0.5−1.5−2.1+9711/20+0.5
TimesNet+71+3.6+1.5−5.7+11213/20+6.9
FEDformer+2,976+5.7+0.4+52+24917/20+52
Autoformer+45−3.6+3.5+11+47114/20+14
Informer−3.1+0.3+3.5−0.1+40514/20+5.5
CATF-iTransformer+5.9−0.7−1.3−1.4+359/20−0.4
CATF-TimesNet−2.1−7.8−0.7−4.2+368/20−1.6
CATF-FEDformer−55−2.9+0.7+13+4110/20+0.1
CATF-Autoformer−14+0.4+1.0+15+2314/20+5.5
CATF-Informer−48+0.3+0.2+0.5+5910/20+0.2
Time-MoE (zero-shot)−76+1.4+13+12+1213/20+10

Table 14.

Best Normalization per Model

Since the better normalization scheme differs across models and datasets, Table 15 compares each baseline and its CATF-enhanced version under their respective best normalization, i.e., the lower mean MSE of global and sample normalization. Under this comparison, CATF improves over its standalone counterpart in 82 of the 100 comparisons (iTransformer 13/20, TimesNet 17/20, FEDformer 20/20, Autoformer 16/20, Informer 16/20).

DatasetLyL_yiTransformer BaseiTransformer CATFTimesNet BaseTimesNet CATFFEDformer BaseFEDformer CATFAutoformer BaseAutoformer CATFInformer BaseInformer CATF
Weather96204.7G^{\mathrm{G}}178.3S^{\mathrm{S}}245.6G^{\mathrm{G}}158.5S^{\mathrm{S}}28,741G^{\mathrm{G}}181.7S^{\mathrm{S}}39,860G^{\mathrm{G}}210.1S^{\mathrm{S}}1,733G^{\mathrm{G}}155.7S^{\mathrm{S}}
192249.3G^{\mathrm{G}}226.7G^{\mathrm{G}}271.1G^{\mathrm{G}}226.1S^{\mathrm{S}}28,712G^{\mathrm{G}}236.8S^{\mathrm{S}}151,937S^{\mathrm{S}}285.4S^{\mathrm{S}}6,645G^{\mathrm{G}}220.8S^{\mathrm{S}}
336254.6G^{\mathrm{G}}232.3G^{\mathrm{G}}264.8G^{\mathrm{G}}241.8S^{\mathrm{S}}50,859G^{\mathrm{G}}267.3S^{\mathrm{S}}70,468G^{\mathrm{G}}270.1S^{\mathrm{S}}3,729S^{\mathrm{S}}240.1S^{\mathrm{S}}
720270.1G^{\mathrm{G}}235.9G^{\mathrm{G}}269.1G^{\mathrm{G}}241.7G^{\mathrm{G}}41,001G^{\mathrm{G}}268.3S^{\mathrm{S}}29,367S^{\mathrm{S}}259.7G^{\mathrm{G}}3,637S^{\mathrm{S}}290.7S^{\mathrm{S}}
PM2.5-LA9636.08S^{\mathrm{S}}35.20S^{\mathrm{S}}37.32G^{\mathrm{G}}35.43S^{\mathrm{S}}57.75G^{\mathrm{G}}42.11S^{\mathrm{S}}57.60S^{\mathrm{S}}58.89S^{\mathrm{S}}41.30S^{\mathrm{S}}37.90S^{\mathrm{S}}
19240.64G^{\mathrm{G}}40.81S^{\mathrm{S}}40.16G^{\mathrm{G}}39.25S^{\mathrm{S}}64.07S^{\mathrm{S}}43.77S^{\mathrm{S}}61.37G^{\mathrm{G}}64.94G^{\mathrm{G}}42.06S^{\mathrm{S}}39.62S^{\mathrm{S}}
33648.71G^{\mathrm{G}}49.35G^{\mathrm{G}}45.91G^{\mathrm{G}}44.67S^{\mathrm{S}}67.49G^{\mathrm{G}}52.00S^{\mathrm{S}}70.55G^{\mathrm{G}}69.27G^{\mathrm{G}}48.22G^{\mathrm{G}}44.79G^{\mathrm{G}}
72062.55G^{\mathrm{G}}63.88S^{\mathrm{S}}59.23S^{\mathrm{S}}58.73S^{\mathrm{S}}75.79G^{\mathrm{G}}64.62S^{\mathrm{S}}106.7G^{\mathrm{G}}72.23S^{\mathrm{S}}52.81G^{\mathrm{G}}51.37G^{\mathrm{G}}
PM2.5-RV9678.83S^{\mathrm{S}}78.43S^{\mathrm{S}}78.84S^{\mathrm{S}}73.83S^{\mathrm{S}}105.0S^{\mathrm{S}}87.11G^{\mathrm{G}}125.5S^{\mathrm{S}}130.1S^{\mathrm{S}}82.47G^{\mathrm{G}}81.69S^{\mathrm{S}}
19290.67S^{\mathrm{S}}89.73S^{\mathrm{S}}87.78G^{\mathrm{G}}83.44G^{\mathrm{G}}131.5G^{\mathrm{G}}96.72S^{\mathrm{S}}142.6G^{\mathrm{G}}133.5G^{\mathrm{G}}94.80G^{\mathrm{G}}91.40S^{\mathrm{S}}
33694.49S^{\mathrm{S}}95.08S^{\mathrm{S}}93.31G^{\mathrm{G}}91.94G^{\mathrm{G}}128.1G^{\mathrm{G}}103.8G^{\mathrm{G}}136.3G^{\mathrm{G}}136.9G^{\mathrm{G}}100.1G^{\mathrm{G}}100.6G^{\mathrm{G}}
72087.28S^{\mathrm{S}}86.70S^{\mathrm{S}}85.81S^{\mathrm{S}}86.12S^{\mathrm{S}}104.5S^{\mathrm{S}}94.83G^{\mathrm{G}}122.7S^{\mathrm{S}}110.8G^{\mathrm{G}}92.70G^{\mathrm{G}}89.88G^{\mathrm{G}}
Bike Share9615,134S^{\mathrm{S}}14,258S^{\mathrm{S}}15,418S^{\mathrm{S}}14,886S^{\mathrm{S}}18,171G^{\mathrm{G}}14,944S^{\mathrm{S}}24,641G^{\mathrm{G}}21,516G^{\mathrm{G}}16,080S^{\mathrm{S}}15,038S^{\mathrm{S}}
19221,140S^{\mathrm{S}}20,356S^{\mathrm{S}}20,500S^{\mathrm{S}}20,508S^{\mathrm{S}}25,283G^{\mathrm{G}}19,930G^{\mathrm{G}}32,384G^{\mathrm{G}}29,645G^{\mathrm{G}}22,524S^{\mathrm{S}}22,916S^{\mathrm{S}}
33627,477S^{\mathrm{S}}26,907S^{\mathrm{S}}27,702S^{\mathrm{S}}27,661G^{\mathrm{G}}28,721G^{\mathrm{G}}23,498G^{\mathrm{G}}39,925G^{\mathrm{G}}37,735G^{\mathrm{G}}28,818G^{\mathrm{G}}32,018G^{\mathrm{G}}
72036,714S^{\mathrm{S}}37,451G^{\mathrm{G}}35,968S^{\mathrm{S}}38,228S^{\mathrm{S}}34,864G^{\mathrm{G}}32,858G^{\mathrm{G}}44,139G^{\mathrm{G}}39,982G^{\mathrm{G}}34,947G^{\mathrm{G}}35,416G^{\mathrm{G}}
Appliances968,095G^{\mathrm{G}}8,084G^{\mathrm{G}}9,864G^{\mathrm{G}}8,350G^{\mathrm{G}}10,091G^{\mathrm{G}}9,253G^{\mathrm{G}}16,935G^{\mathrm{G}}9,941G^{\mathrm{G}}8,921G^{\mathrm{G}}7,950G^{\mathrm{G}}
1928,123G^{\mathrm{G}}8,129G^{\mathrm{G}}10,121G^{\mathrm{G}}8,468G^{\mathrm{G}}9,436G^{\mathrm{G}}9,027G^{\mathrm{G}}13,646G^{\mathrm{G}}10,650G^{\mathrm{G}}9,172G^{\mathrm{G}}7,739G^{\mathrm{G}}
3367,847G^{\mathrm{G}}7,761G^{\mathrm{G}}9,843G^{\mathrm{G}}8,044G^{\mathrm{G}}9,147G^{\mathrm{G}}8,559G^{\mathrm{G}}11,739G^{\mathrm{G}}10,198G^{\mathrm{G}}8,329G^{\mathrm{G}}7,681G^{\mathrm{G}}
7208,046G^{\mathrm{G}}8,048G^{\mathrm{G}}8,861G^{\mathrm{G}}8,280G^{\mathrm{G}}10,063G^{\mathrm{G}}9,080G^{\mathrm{G}}13,574G^{\mathrm{G}}9,706G^{\mathrm{G}}8,261G^{\mathrm{G}}7,870G^{\mathrm{G}}
CATF Win13/2017/2020/2016/2016/20
Impr. (%)+2.7+7.4+32.9+28.8+21.8

Table 15. Best normalization per model. For each model, we take the lower mean MSE of global (G) and sample (S) normalization (Table 9 and Table 10), separately for the standalone baseline (Base) and its CATF-enhanced version; the superscript gives the selected normalization. Bold marks the better of each baseline and its CATF-enhanced version. CATF Win: number of the 20 settings in which CATF improves over its baseline; Impr.: relative MSE reduction (%), averaged over the 20 settings.

DatasetLyL_y[42] iTransformerCATF-iTransformer[60] TimesNetCATF-TimesNet[68] FEDformerCATF-FEDformer[61] AutoformerCATF-Autoformer[67] InformerCATF-InformerTimeMoE (zero-shot)
Weather9610.31 ± 0.0710.05 ± 0.1611.41 ± 0.2510.23 ± 0.49133.1 ± 42.1614.26 ± 1.53154.9 ± 88.3615.97 ± 2.1532.48 ± 8.3116.52 ± 0.8321.61
19211.64 ± 0.0711.04 ± 0.1712.16 ± 0.2711.30 ± 0.17133.1 ± 64.8218.50 ± 0.29241.3 ± 233.314.93 ± 1.0632.27 ± 12.8815.93 ± 1.1224.60
33612.03 ± 0.0511.43 ± 0.1112.25 ± 0.0811.72 ± 0.10195.6 ± 75.9718.37 ± 1.31150.0 ± 121.012.79 ± 0.3446.55 ± 63.0116.70 ± 0.9726.44
72012.71 ± 0.0811.74 ± 0.2012.64 ± 0.1711.92 ± 0.11174.9 ± 58.4820.08 ± 1.08274.6 ± 233.712.26 ± 0.2634.14 ± 6.1918.16 ± 1.2028.63
PM2.5-LA963.91 ± 0.013.93 ± 0.003.91 ± 0.064.13 ± 0.195.77 ± 0.244.72 ± 0.076.80 ± 1.006.27 ± 0.265.07 ± 0.264.97 ± 0.224.41
1924.20 ± 0.024.24 ± 0.024.18 ± 0.094.24 ± 0.096.19 ± 0.094.88 ± 0.056.02 ± 0.395.99 ± 0.225.21 ± 0.144.96 ± 0.054.92
3364.71 ± 0.014.74 ± 0.044.55 ± 0.114.66 ± 0.096.18 ± 0.165.34 ± 0.176.22 ± 0.286.20 ± 0.105.29 ± 0.125.12 ± 0.065.42
7205.76 ± 0.025.87 ± 0.035.58 ± 0.035.66 ± 0.146.54 ± 0.266.04 ± 0.108.03 ± 1.816.42 ± 0.185.66 ± 0.065.62 ± 0.075.93
PM2.5-RV966.25 ± 0.046.16 ± 0.066.08 ± 0.176.00 ± 0.037.53 ± 0.236.62 ± 0.058.36 ± 0.748.13 ± 0.246.10 ± 0.196.01 ± 0.075.97
1926.51 ± 0.056.44 ± 0.036.28 ± 0.146.20 ± 0.068.48 ± 0.287.11 ± 0.278.31 ± 0.578.29 ± 0.386.47 ± 0.166.48 ± 0.026.26
3366.61 ± 0.056.63 ± 0.026.57 ± 0.046.42 ± 0.068.33 ± 0.347.22 ± 0.328.41 ± 0.118.35 ± 0.246.62 ± 0.076.55 ± 0.046.40
7206.49 ± 0.046.50 ± 0.036.43 ± 0.036.47 ± 0.097.80 ± 0.506.99 ± 0.148.32 ± 1.727.78 ± 0.226.54 ± 0.266.29 ± 0.046.36
Bike Share9683.38 ± 0.6078.50 ± 0.3081.95 ± 1.4780.21 ± 3.9093.44 ± 2.2684.74 ± 2.74116.0 ± 11.46105.4 ± 9.4091.06 ± 5.2088.51 ± 1.5278.52
19297.71 ± 0.5993.95 ± 0.3996.91 ± 1.9794.42 ± 2.02107.0 ± 3.2595.92 ± 1.13135.1 ± 5.61127.2 ± 2.66100.9 ± 3.61102.9 ± 2.5487.81
336112.8 ± 0.36108.7 ± 0.22108.6 ± 1.48106.6 ± 1.29114.1 ± 4.96106.1 ± 3.09154.9 ± 7.83146.9 ± 14.25119.0 ± 2.82138.5 ± 10.4397.52
720134.9 ± 0.39133.1 ± 0.65126.8 ± 2.72129.9 ± 1.29129.1 ± 4.01127.0 ± 3.49167.4 ± 3.80156.7 ± 5.79138.1 ± 1.73150.3 ± 0.64118.8
Appliances9647.50 ± 1.3446.53 ± 1.0255.55 ± 2.7547.56 ± 1.2864.61 ± 4.5060.66 ± 1.4792.33 ± 5.1061.17 ± 2.7353.78 ± 3.1348.72 ± 3.8251.78
19247.72 ± 0.8846.13 ± 0.7656.96 ± 3.2948.88 ± 2.9158.98 ± 0.9256.28 ± 1.6779.03 ± 11.0161.86 ± 2.1555.81 ± 3.2247.32 ± 1.6751.50
33646.35 ± 0.6645.16 ± 0.6056.96 ± 4.0548.48 ± 2.1160.44 ± 4.1054.25 ± 0.9169.15 ± 4.9263.83 ± 5.3352.47 ± 1.4948.81 ± 2.0552.54
72046.41 ± 0.4245.68 ± 0.2853.16 ± 3.0047.81 ± 1.6062.84 ± 6.1456.70 ± 0.7485.42 ± 23.3061.40 ± 3.4653.19 ± 1.3049.15 ± 1.7355.05
CATF Win1414202016—
Impr. % (mean)+2.1+3.9+26.3+26.4+12.1

Table 12. Long-term forecasting results under Global normalization. MAE is computed on the original (de-normalized) scale and reported as MEAN ± SD over 5 runs (TimeMoE: single zero-shot run). The look-back length is 96 for all settings. The better of each baseline and its CATF-enhanced version is in bold; the best result in each row is marked with a dark orange background and the second best with a light orange background. CATF Win: number of the 20 settings (5 datasets × 4 horizons) in which CATF-<baseline> has a lower mean MAE than <baseline>. Impr.: relative MAE reduction of CATF-<baseline> over <baseline>, averaged over the 20 settings.

Instability of the Baselines on Weather

The target of Weather, the CO2_2 concentration, contains 50 missing-value codes (−9999 ppm), which we keep as in the original data. All of them lie in the training split (February to August 2020), while the validation and test splits contain none. The regular measurements have a mean of 425 ppm and a standard deviation of 18.5 ppm in the training split; with the missing-value codes, the standard deviation of the training target increases to 359 ppm. Under global normalization, the regular measurements therefore occupy a very narrow range of the normalized space, and a small error in this space becomes a large error in ppm: an error of 0.5 in the normalized space corresponds to about 180 ppm, i.e., an MSE of about 3×1043 \times10^{4}, the order of magnitude observed for FEDformer and Autoformer Table 9. Under sample normalization, the input windows that contain such a value are dominated by it. A model that is pulled toward these extreme training targets therefore produces large errors on the clean test data, which explains the very large MSE and SD of FEDformer, Autoformer, and Informer on Weather. Their CATF-enhanced counterparts are trained on the same data but remain within the range of the strong baselines (§ 5.2).

Computational Cost

Table 16 reports the training time per epoch, the peak GPU memory, and the number of trained epochs of the baselines and the CATF-enhanced models. In each training iteration, CATF runs a forward pass of all KK workers to compute the pseudo ground truth, trains the manager, and updates the selected workers α=2\alpha= 2 times; in addition, the parameters and optimizer states of all KK workers and the manager are kept in memory. As a result, a CATF-enhanced model requires a median of 5.8× the training time per epoch and 3.8× the peak memory of its standalone counterpart across all models and horizons, and it is trained for about 27 epochs instead of about 7. The relative overhead is largest for the lightweight iTransformer and smallest for the heavier FEDformer, Autoformer, and Informer. At inference time, only the manager and the selected worker are executed for each input.

ModelLy=96L_y=96 Time (s/ep.)Ly=96L_y=96 Mem. (GB)Ly=192L_y=192 Time (s/ep.)Ly=192L_y=192 Mem. (GB)Ly=336L_y=336 Time (s/ep.)Ly=336L_y=336 Mem. (GB)Ly=720L_y=720 Time (s/ep.)Ly=720L_y=720 Mem. (GB)Epochs
iTransformer170.04190.04330.09230.057.1
CATF-iTransformer2830.462390.463980.482500.4826.7
TimesNet760.13950.157280.202050.297.0
CATF-TimesNet7250.575590.652,2270.799221.0026.1
FEDformer3011.623291.781,4432.074992.686.7
CATF-FEDformer1,6885.961,8886.572,2267.431,4609.7826.5
Autoformer1722.451933.831,9125.6348511.076.9
CATF-Autoformer1,5719.321,85914.732,99821.691,35843.1726.9
Informer1000.781670.941,2341.233001.857.1
CATF-Informer8842.601,4133.222,2404.071,1496.3627.1
Time-MoE (zero-shot)994†^{\dagger}0.231,165†^{\dagger}0.23767†^{\dagger}0.241,241†^{\dagger}0.26—

Table 16. Computational cost of the baselines and CATF-enhanced models (3 workers): training time per epoch (s), peak GPU memory during training (GB), and the average number of trained epochs, for each forecasting horizon LyL_y. Values are averaged over the 5 datasets, 2 normalization schemes, and 5 runs. Several runs shared one GPU, so the times are indicative. For the zero-shot Time-MoE (50M), we report the total inference time on the test split and the peak memory.

Table 13. Long-term forecasting results under Sample normalization. MAE is computed on the original (de-normalized) scale and reported as MEAN ± SD over 5 runs (TimeMoE: single zero-shot run). The look-back length is 96 for all settings. The better of each baseline and its CATF-enhanced version is in bold; the best result in each row is marked with a dark orange background and the second best with a light orange background. CATF Win: number of the 20 settings (5 datasets × 4 horizons) in which CATF-<baseline> has a lower mean MAE than <baseline>. Impr.: relative MAE reduction of CATF-<baseline> over <baseline>, averaged over the 20 settings.

DatasetLyL_yiTransformer [42]CATF-iTransformerTimesNet [60]CATF-TimesNetFEDformer [68]CATF-FEDformerAutoformer [61]CATF-AutoformerInformer [67]CATF-InformerTimeMoE (zero-shot)
Weather9614.13 ± 0.679.28 ± 0.2011.84 ± 0.578.61 ± 0.25725.8 ± 476.19.45 ± 0.19983.5 ± 593.310.04 ± 0.4328.87 ± 8.798.53 ± 0.209.05
19217.43 ± 1.0910.89 ± 0.1212.80 ± 0.8310.71 ± 0.101,691 ± 2,00811.22 ± 0.19185.3 ± 305.812.06 ± 0.4632.24 ± 6.1610.65 ± 0.2510.63
33619.16 ± 0.7311.76 ± 0.1713.89 ± 1.7611.44 ± 0.19380.7 ± 239.912.32 ± 0.37194.7 ± 123.212.12 ± 0.2229.58 ± 7.5411.47 ± 0.1011.14
72019.89 ± 0.5413.34 ± 0.5717.53 ± 2.1712.36 ± 0.35588.6 ± 274.412.52 ± 0.49118.6 ± 83.3413.18 ± 0.8928.66 ± 4.3012.62 ± 0.3511.55
PM2.5-LA963.93 ± 0.063.87 ± 0.074.02 ± 0.123.85 ± 0.065.21 ± 0.464.24 ± 0.124.89 ± 0.245.07 ± 0.204.33 ± 0.184.12 ± 0.104.10
1924.25 ± 0.044.26 ± 0.034.26 ± 0.154.14 ± 0.065.45 ± 0.104.39 ± 0.125.13 ± 0.485.37 ± 0.314.40 ± 0.074.26 ± 0.074.41
3364.77 ± 0.034.83 ± 0.044.52 ± 0.034.49 ± 0.106.00 ± 0.434.94 ± 0.185.79 ± 1.055.85 ± 0.155.09 ± 0.114.82 ± 0.194.98
7205.78 ± 0.085.80 ± 0.065.59 ± 0.085.62 ± 0.136.55 ± 0.655.84 ± 0.088.94 ± 3.096.34 ± 0.155.85 ± 0.115.86 ± 0.156.08
PM2.5-RV966.08 ± 0.056.14 ± 0.056.04 ± 0.096.05 ± 0.097.26 ± 0.336.57 ± 0.127.90 ± 0.297.98 ± 0.546.25 ± 0.116.11 ± 0.136.60
1926.47 ± 0.036.50 ± 0.066.59 ± 0.226.26 ± 0.158.65 ± 0.116.83 ± 0.188.57 ± 0.588.67 ± 0.656.72 ± 0.096.52 ± 0.126.85
3366.69 ± 0.086.64 ± 0.066.77 ± 0.116.52 ± 0.108.14 ± 0.457.33 ± 0.178.65 ± 0.518.28 ± 0.387.07 ± 0.207.05 ± 0.247.03
7206.53 ± 0.046.53 ± 0.066.44 ± 0.046.46 ± 0.087.20 ± 0.426.94 ± 0.198.16 ± 0.857.64 ± 0.106.90 ± 0.086.98 ± 0.286.97
Bike Share9683.57 ± 0.4779.44 ± 0.1681.15 ± 2.7578.20 ± 4.61116.5 ± 7.3981.16 ± 2.43116.8 ± 9.46112.2 ± 9.0783.96 ± 1.6980.78 ± 2.9178.94
192100.0 ± 0.5695.97 ± 0.8395.55 ± 1.8193.79 ± 1.01135.9 ± 6.8297.54 ± 1.40132.4 ± 5.62134.8 ± 7.27103.3 ± 2.98103.5 ± 2.6091.42
336115.4 ± 0.40112.0 ± 0.80112.3 ± 1.14112.0 ± 1.42139.2 ± 4.26113.6 ± 1.89161.7 ± 9.95143.1 ± 4.66122.0 ± 2.51143.6 ± 8.16106.2
720136.4 ± 0.59137.1 ± 0.79131.2 ± 3.55132.6 ± 1.95157.4 ± 5.82137.4 ± 1.74177.8 ± 8.56170.8 ± 3.69153.9 ± 2.76156.8 ± 1.93133.1
Appliances9674.04 ± 5.1460.15 ± 2.1870.47 ± 3.8862.76 ± 6.3680.90 ± 4.7472.17 ± 6.41159.6 ± 116.569.60 ± 5.0894.24 ± 14.7663.80 ± 4.2754.71
192167.30 ± 3.8162.45 ± 4.4171.11 ± 3.6065.18 ± 1.9693.68 ± 8.1268.63 ± 9.13160.5 ± 34.0076.08 ± 5.1795.50 ± 12.2463.60 ± 5.9254.24
33672.78 ± 5.1062.01 ± 2.7072.69 ± 6.5759.66 ± 5.79117.1 ± 49.3367.62 ± 5.90151.8 ± 65.4472.94 ± 4.6291.48 ± 15.2464.74 ± 8.3454.76
72074.95 ± 2.2062.68 ± 4.6268.41 ± 6.0964.19 ± 2.82118.9 ± 29.0668.76 ± 9.08148.9 ± 102.567.81 ± 7.9895.17 ± 7.0566.78 ± 3.8757.15
CATF Win132061415—
Impr. % (mean)+10.6+7.7+35.7+31.8+19.0—

Table 13.

Ablation Study

Table 17 reports the full results of the ablation study in § 5.3 on PM2.5-RV, together with the same ablation on Bike Share and the number of parameters. On Bike Share, the default setting is again an independent re-run of the configuration in Table 1. For the mixture of workers, we combine the top-performing CATF-enhanced models of each dataset.

SettingBike Share MSEBike Share MAEBike Share Δ\Delta (%)Bike Share ppPM2.5-RV MSEPM2.5-RV MAEPM2.5-RV Δ\Delta (%)PM2.5-RV pp#Params (M)
Default (KL + Wass., reg., dmodel=512d_{\mathrm{model}}=512, K=3K=3)15,097 ± 24178.56 ± 0.67––80.52 ± 1.026.18 ± 0.03––7.3
Manager loss
KL only15,452 ± 28279.36 ± 0.71+2.40.06581.87 ± 2.756.15 ± 0.03+1.70.3477.3
Wasserstein only15,407 ± 37280.48 ± 0.83+2.10.16381.56 ± 1.106.21 ± 0.04+1.30.1577.3
Regularization
No reg.15,169 ± 18479.01 ± 0.40+0.50.60980.94 ± 1.196.14 ± 0.03+0.50.5597.3
Manager arch.
Small (dmodel=128d_{\mathrm{model}}=128, dff=512d_{ff}=512, 4 heads)15,155 ± 29879.32 ± 0.77+0.40.74381.23 ± 0.786.19 ± 0.04+0.90.2521.1
Large (dmodel=768d_{\mathrm{model}}=768, dff=3076d_{ff}=3076, 12 heads)15,042 ± 16778.21 ± 0.60−0.40.69181.05 ± 0.816.17 ± 0.05+0.70.38615.5
Worker number
K=6K=615,321 ± 30279.26 ± 1.09+1.50.23279.37 ± 1.146.08 ± 0.10−1.40.1327.9
K=9K=915,467 ± 17279.93 ± 0.75+2.50.02682.61 ± 2.996.11 ± 0.07+2.60.2008.6
Worker mix
Top-3 models1 (K=3K=3)17,067 ± 57982.88 ± 1.15+13.1<0.00181.63 ± 2.136.13 ± 0.04+1.40.33424.9
Top-2 models1 ×2 (K=4K=4)14,728 ± 83779.98 ± 1.52−2.40.39080.04 ± 2.706.07 ± 0.06−0.60.72840.8

Table 17. Full ablation results of CATF-iTransformer on Bike Share and PM2.5-RV (global normalization, L=Ly=96L=L_y=96). MSE and MAE are on the original scale, mean ± SD over 5 runs without fixed random seeds. Δ\Delta is the relative change in mean MSE w.r.t. the default setting of the same dataset (positive is worse); pp is from Welch’s tt-test against the default (bold: p<0.05p < 0.05). #Params counts the manager and all workers on Bike Share.

Details of the Case Study

This section describes the analysis methods (Appendix § 12.§ 1), validates them on synthetic data with known regimes (Appendix § 12.§ 2), gives further results of the Bike Share case study in § 6 (Appendix § 12.§ 3), and repeats the analysis on PM2.5-RV (Appendix § 12.§ 4).

Analysis Methods

All analyses use CATF-iTransformer (L=Ly=96L=L_y=96, global normalization, K=3K=3). The figures show a single trained model; quantitative results are averaged over all runs (3 on the synthetic data, 5 on Bike Share).

Routing by context. We compare the Worker selected for each sample with a property of its context, e.g., the true regime or the day of the week, and quantify the agreement with the normalized mutual information (NMI) between the two labelings, NMI⁡(A,B)=2I(A;B)/(H(A)+H(B))\operatorname{NMI}(A,B)=2I(A;B)/(H(A)+H(B)), where II is the mutual information and HH the entropy. The NMI is 1 if the two labelings match one-to-one and 0 if the routing is independent of the property.

Permutation importance [10]. For one variable at a time, we replace its input window in each test sample with that of a randomly chosen other test sample, while all other variables stay unchanged. This is done in the Manager input only; the Workers still receive the original input. We record the share of test samples whose selected Worker changes, averaged over three random shuffles. “All context” shuffles all context variables at once.

Sanity check. Following the model-randomization test of Adebayo et al. [2], we repeat the analyses with an untrained Manager of the same architecture. A pattern that also appears for the untrained Manager reflects the input data rather than what the Manager has learned.

Intervention. This analysis is performed during inference. We keep the trained Workers unchanged (they are not retrained) and, when forecasting the test set, replace only the learned routing with (a) a random assignment with the same Worker shares, (b) the best single Worker for all samples, and (c) the untrained Manager. If the routing is meaningful, each replacement should increase the MSE. We also record how often the Manager selects the Worker with the lowest error on a sample, and, for the samples routed to each Worker, the MSE of every Worker relative to the lowest one, which shows whether the Workers specialize.

Counterfactual (Bike Share). We change selected context variables in the Manager input and keep all other inputs fixed. The calendar variables (the day of the week and the working-day indicator) are changed in their original units and then normalized as in training. When the day of the week of the input window is shifted by d∈{1,…,6}d \in\{1,\ldots,6\} days, the working-day indicator is recomputed accordingly. The typical Worker of a day is the majority Worker of the real forecasts made on that day at the same hour. Unlike the two previous analyses, this tests whether a variable causes the routing decision rather than whether it is associated with it.

Synthetic Data: Recovering Known Regimes

On real data, the correct assignment of samples to Workers is unknown, so an interpretation can only be checked indirectly, e.g., against domain knowledge. We therefore construct a synthetic dataset in which the regime of the target is determined by the context, so that the interpretation can be compared with the ground truth: if CATF is context-aware, the routing should follow the regimes, the Manager should rely on the variable that announces the regime, and each Worker should handle one regime.

Data. The dataset contains T=20,000T = 20{,}000 hourly steps t=0,…,T−1t = 0,\ldots,T - 1 and is generated in three steps.

(1) Regime sequence. We first draw a regime rt∈{1,2,3}r_t \in\{1,2,3\} for every step: the time axis is split into consecutive segments whose lengths are drawn uniformly from 72 to 240 hours (3 to 10 days), and each segment is assigned a regime drawn uniformly from the two regimes that differ from the previous segment. The regime sequence is random and does not depend on any variable; each regime covers about one third of the steps.

(2) Target. The target is generated from the regime of the current step:

yt=μt+ϵt,ϵt∼N(0,1),μt={20+10sin⁡(2πt/24)if rt=1 (daily cycle),20+10sin⁡(2πt/12+π/3)if rt=2 (half-day cycle),20+atif rt=3 (drift),y_t = \mu_t + \epsilon_t,\qquad\epsilon_t \sim\mathcal{N}(0,1),\qquad \mu_t = \begin{cases} 20 + 10\sin(2\pi t/24) & \text{if } r_t = 1\ \text{(daily cycle)},\\ 20 + 10\sin(2\pi t/12 + \pi/3) & \text{if } r_t = 2\ \text{(half-day cycle)},\\ 20 + a_t & \text{if } r_t = 3\ \text{(drift)}, \end{cases}

where at=0.97at−1+ηta_t = 0.97a_{t-1} + \eta_t, ηt∼N(0,22)\eta_t \sim\mathcal{N}(0,2^2), a0=0a_0 = 0, is a first-order autoregressive (AR(1)) process, which drifts slowly around zero without any periodicity. The three regimes thus have clearly different dynamics: one peak per day, two peaks per day, and no cycle.

(3) Context. There are six context variables. Only one of them, the regime signal, carries information about the regime: it equals the regime 48 hours ahead plus small Gaussian noise,

st=rt+48+νt,νt∼N(0,0.12),s_t = r_{t+48} + \nu_t,\qquad\nu_t \sim\mathcal{N}(0,0.1^2),

similar to a forecast of an upcoming condition. It does not enter the generation of the target; the target and the regime signal are only linked through the regime sequence, the target through the current regime rtr_t and the regime signal through the regime 48 hours ahead. The other five context variables are uninformative about the regime: four independent random walks zt(k)=zt−1(k)+ζt(k)z_t^{(k)} = z_{t-1}^{(k)} + \zeta_t^{(k)}, ζt(k)∼N(0,1)\zeta_t^{(k)} \sim\mathcal{N}(0,1), k=1,…,4k = 1,\ldots,4, and the hour of the day encoded as ht=sin⁡(2π(t mod 24)/24)h_t = \sin(2\pi(t \bmod24)/24). The hour of the day can help to predict the values of the two periodic regimes, but it does not indicate which regime is active.

Task and ground truth. As in the main experiments, the model receives the past L=96L = 96 hours of the target and the six context variables and forecasts the next Ly=96L_y = 96 hours of the target. The true regime of a sample is the regime that covers most of its forecast window. The target history reveals the current regime, but not an upcoming switch; the regime signal announces a switch 48 hours in advance. A context-aware Manager should therefore route the samples by regime and rely on the regime signal. We use the same splits (80/10/10), global normalization, and hyperparameters as for CATF-iTransformer in the main experiments, and run each model 3 times.

Does the routing recover the regimes? Figure 5 shows the test series together with the true regime and the selected Worker: the selected Worker switches whenever the regime switches, and the routing agrees with the regime for 99.4% of the test samples. Over all runs, 99%, 94%, and 94% of the samples of the three regimes are sent to one Worker each (Figure 6a), and the NMI between routing and regime is 0.85. An untrained Manager with the same input reaches an NMI of only 0.04 (Figure 6b).

Routing on synthetic data over the first 600 test steps

Figure 5. Routing on synthetic data over the first 600 test steps (one run). Top: target series. Middle: true regime of the forecast window. Bottom: worker selected by the manager. The selected worker follows the regime switches; the agreement is 99.4% over the whole test set.

Routing heatmaps and permutation importance

Figure 6. Routing on synthetic data, averaged over 3 runs. (a) Share of the samples of each true regime that the trained manager routes to each worker. (b) The same for an untrained manager with the same architecture and the same trained workers. (c) MSE of each worker on each regime. (d) Permutation importance: share of routing decisions that change when one input variable is shuffled across test samples in the manager input only (workers receive the original input), for the trained and the untrained manager. Workers are relabeled in each run so that WkW_k is the worker that receives regime kk most often.

Does the Manager use the right variable? Shuffling the regime signal in the Manager input changes 65% of the routing decisions, while shuffling any other variable, including the target history, changes at most 5.3% on average (Figure 6d). For the untrained Manager, the regime signal is no more important than the distractors. Inspecting the Manager alone therefore reveals which context variable drives the regimes, without access to the data-generating process.

What has each Worker learned? W1W_1 and W2W_2 each specialize in one of the two periodic regimes, and W3W_3 absorbs the drift regime: on the daily cycle, the MSE of W1W_1 is 17.9 while that of the other Workers is 58–61; on the half-day cycle, the MSE of W2W_2 is 14.4 while that of the other Workers is 58–62 (Figure 6c). The drifting regime is not predictable 96 hours ahead, and all Workers have a high MSE on it (64–75); routing it to a separate Worker keeps it out of the training data of W1W_1 and W2W_2.

Does the learned routing improve the forecasts? With the same trained Workers, the learned routing (MSE 33.4) is much better than random routing (50.7), the best single Worker (43.8), and an untrained Manager (58.1), and CATF-iTransformer reduces the MSE of the standalone iTransformer by 7.2% (33.4 vs. 36.0; Table 18, which also gives the standard deviations over the 3 runs).

Model / routingMSENMI
iTransformer (baseline)35.98 ± 0.34–
CATF-iTransformer33.39 ± 0.510.85 ± 0.15
Same trained workers, different routing
Random routing (same worker shares)50.69 ± 4.18–
Best single worker for all samples43.77 ± 1.76–
Untrained manager58.13 ± 6.060.04 ± 0.04

Table 18. Synthetic data (L=Ly=96L = L_y = 96, global normalization, 3 runs, mean ± SD). The routing variants reuse the trained workers and change only the routing. NMI: between the routing and the true regime.

In summary, when the regime depends on the context, the routing analysis recovers the true structure of the data: which samples belong together (the regimes), which variable determines them (the regime signal), and what each Worker has learned (one periodic regime each for W1W_1 and W2W_2, the drift regime for W3W_3).

Bike Share: Additional Results

Routing accuracy. The Manager selects the most accurate Worker for 54% of the test samples, compared with 36% for the untrained Manager and 33% by chance. On the samples routed to a Worker, that Worker has the lowest MSE in 80% of the cases.

Counterfactual analysis. Figure 7 shows the counterfactual analysis of § 6 for each shift dd. Shifting the calendar changes 35% of the routing decisions for d=1d = 1 or 6 and about 70% for d=3d = 3 or 4: a shift by one day often stays within the days handled by the same Worker, whereas a shift by half a week moves most forecasts to the days of another Worker. For every dd, 78–82% of the decisions after the shift match the typical Worker of the new day, compared with 23–60% for the original routing. Replacing the target history instead changes only 8–13% of the decisions, and the routing does not follow the day from which the history is taken: its match with the typical Worker of that day is the same as for the original routing. The Manager therefore routes by the calendar rather than by the shape of the recent demand.

Counterfactual analysis plots of routing decisions

Figure 7. Counterfactual analysis of the routing of CATF-iTransformer on Bike Share (mean over 5 runs). For each shift dd, either the calendar of the input window (day of the week and working-day indicator) is shifted by dd days (blue) or the target history is replaced with that of the forecast made dd days later (orange), with all other inputs unchanged. (a) Percentage of test forecasts whose selected worker differs from the one selected for the original input. (b) Percentage of test forecasts whose selected worker is the typical worker of the new day, i.e., the majority worker of the real forecasts made dd days later at the same hour; the dashed line is this percentage for the original input before any change.

Consistency across runs. All five runs partition the samples by the day of the week (NMI between the selected Worker and the day of the week 0.13–0.48, vs. at most 0.10 for the hour of the day), although the boundaries between the Workers differ between runs. In the counterfactual analysis, the share of new decisions that match the typical Worker of the shifted day is 64–87% across runs (40% before the shift), and replacing the target history changes 5–23% of the decisions; both results hold in all five runs.

Routing over time and holidays. Figure 8 shows the routing of one run over four weeks of the test period. The routing follows the weekly cycle and does not depend on the hour of the day (NMI 0.00). Thanksgiving (Thursday, November 22, 2012), on which demand drops to a weekend level, is routed entirely to W3W_3, the Worker for Saturdays, whereas 86% of the forecasts on regular Thursdays are routed to W2W_2. The counterfactual analysis confirms that this decision is caused by the holiday indicators: setting the holiday and working-day indicators of Thanksgiving to those of a regular Thursday moves 79% of its forecasts to W2W_2, and marking regular Thursdays as holidays moves 64% of their forecasts to W3W_3 (from 8%). This behavior, however, is specific to this run: in three of the other four runs, Thanksgiving is routed mostly like a regular Thursday. With only a handful of holidays in the training data, the Manager does not consistently learn a holiday regime, in contrast to the weekly cycle.

Routing of CATF-iTransformer on Bike Share over four weeks of the test period

Figure 8. Routing of CATF-iTransformer on Bike Share over four weeks of the test period (one run). Top: hourly bike rentals, with weekends in gray and holidays in red. Bottom: the worker selected for the forecast that starts at each hour. The routing follows the weekly cycle: W1W_1 for forecasts made on Sunday to Tuesday, W2W_2 for Wednesday to Friday, and W3W_3 for Friday and Saturday. Thanksgiving (Thursday, Nov 22) is routed to W3W_3, like a Saturday.

Context of the Workers. Figure 9 shows the context of the samples routed to each Worker around the forecast origin. To compare the variables on a common scale, we compute, at each hour, the range of the three Worker means divided by the standard deviation of the variable over the test windows, and average it over the 192 hours. The Workers differ most in the variable that drives the routing, the working-day share (1.2 standard deviations), and accordingly face different demand trajectories (0.4). For the weather variables, which have low importance, the differences are much smaller than for the working-day share (temperature 0.4, humidity 0.4, wind speed 0.3, mist/rain 0.2; mean temperature within 2 °C, humidity within 10%). Figure 10 relates the routing to every input variable at the forecast origin. Only the day of the week (NMI 0.44) and the working-day indicator (0.15) are strongly related to the routing; for all other variables, the NMI is at most 0.05. Some weather bins deviate from the overall Worker shares, e.g., 67% of the forecasts made during rain or snow go to W1W_1 (42% overall), but these bins are small and fall mostly on particular days: in the test period, most rainy hours occur on Sunday to Tuesday, the days of W1W_1. Together with the counterfactual analysis, this indicates that such deviations reflect the calendar rather than the weather itself.

Context conditions of the Bike Share test samples routed to each worker

Figure 9. Context conditions of the Bike Share test samples routed to each worker (one run; the same run as Figure 8). Each line is the mean over the samples routed to a worker at each hour relative to the forecast origin (dashed: all samples); the gray area is the forecast window, which the manager does not see. Rentals are shown as a trailing 24-hour mean. The workers correspond to different phases of the week (working-day share) and therefore to different demand trajectories, whereas the weather conditions are similar for all workers.

Routing of the Bike Share test forecasts by each input variable

Figure 10. Routing of the Bike Share test forecasts by each input variable (one run; the same run as Figure 9). The variables are taken at the forecast origin; continuous variables are split into tertiles over the test period, and the number of forecasts in each bin is given in parentheses. Each row gives the percentage of the forecasts in the bin that are routed to each worker (rows sum to 100%; first row: all forecasts). Left: day of the week, working day, holiday, and month; right: weather and recent demand. The column “Variable (NMI)” gives the variable of each group of rows and, in parentheses, the normalized mutual information (NMI) between its bin and the selected worker (0: unrelated; 1: the bin determines the worker). The routing depends strongly on the day of the week and the working-day indicator, and only weakly on the other variables.

Example forecasts. Figure 11 compares typical forecasts of the three Workers with those of the standalone iTransformer. All three Workers capture the double commuting peak on working days and the single midday peak on weekends. The largest difference occurs for the forecast starting on Saturday: the standalone model underestimates the midday weekend peak, whereas W3W_3 captures it and reduces the MSE from 12,035 to 7,797.

Example forecasts on Bike Share for typical forecast origins of each worker

Figure 11. Example forecasts on Bike Share for typical forecast origins of each worker (one run; the same run as Figure 8), together with the standalone iTransformer. For each case, the forecast with the median CATF error among all forecasts starting at midnight on that day of the week (without holidays in the forecast window) is shown. The gray area is the forecast window. The largest difference occurs for the forecast starting on Saturday, for which W3W_3 captures the midday weekend peak that the standalone iTransformer underestimates.

PM2.5-RV

We repeat the analysis of § 6 for the five runs of CATF-iTransformer on PM2.5-RV (global normalization, L=Ly=96L = L_y = 96). Here, the routing has little effect. With the same trained Workers, the learned routing (MSE 80.5 ± 1.0) is only slightly better than random routing with the same Worker shares (81.1 ± 0.7; better in four of five runs) and an untrained Manager (81.6 ± 1.2), and it is on par with the best single Worker (80.4 ± 1.0). The Manager selects the most accurate Worker for 36% of the test samples (untrained Manager: 34%), and on the samples routed to a Worker, the other Workers are at most 5% less accurate, i.e., the Workers barely specialize. Shuffling all context variables in the Manager input changes 47% of the routing decisions, compared with 41% for the untrained Manager, and no single variable stands out (19–27% vs. 13–21%). Unlike bike demand, which follows distinct patterns on working days and weekends, PM2.5 concentration varies with continuously changing meteorological conditions, so there may be no discrete context-driven regimes for the Workers to specialize in. The routing analysis therefore also indicates whether a dataset contains such regimes.

References

  1. [1][n. d.]. Time-Series-Library (TSLib): A Library for Deep Time Series Models. https://github.com/thuml/Time-Series-Library. Access on 2025-07-27, MIT License.
  2. [2]Julius Adebayo, Justin Gilmer, Michael Muelly, Ian Goodfellow, Moritz Hardt, and Been Kim. 2018. Sanity Checks for Saliency Maps. In Advances in Neural Information Processing Systems (NeurIPS), Vol. 31.arxiv.org/abs/1810.03292
  3. [3]Sarah Alnegheimish, Dongyu Liu, Carles Sala, Laure Bertí-Équille, and Kalyan Veeramachaneni. 2022. Sintel: A Machine Learning Framework to Extract Insights from Signals. In SIGMOD 2022. ACM, 1855–1865. doi:10.1145/3514221.3517910
  4. [4]Abdul Fatir Ansari, Lorenzo Stella, Ali Caner Türkmen, Xiyuan Zhang, Pedro Mercado, Huibin Shen, Oleksii Shchur, Syama Sundar Rangapuram, Sebastian Pineda-Arango, Shubham Kapoor, Jasper Zschiegner, Danielle C. Maddix, Hao Wang, Michael W. Mahoney, Kari Torkkola, Andrew Gordon Wilson, Michael Bohlke-Schneider, and Bernie Wang. 2024. Chronos: Learning the Language of Time Series. Trans. Mach. Learn. Res. 2024 (2024). https://openreview.net/forum?id=gerNCVqqtRarxiv.org/abs/2403.07815
  5. [5]Adebiyi A. Ariyo, Adewumi O. Adewumi, and Charles K. Ayo. 2014. Stock Price Prediction Using the ARIMA Model. In UKSim-AMSS 16th International Conference on Computer Modelling and Simulation. 106–112. doi:10.1109/UKSim.2014.67DOI
  6. [6]Martin Arjovsky, Soumith Chintala, and Léon Bottou. 2017. Wasserstein Generative Adversarial Networks. In Proceedings of the 34th International Conference on Machine Learning, Vol. 70. PMLR, 214–223. https://proceedings.mlr.press/v70/arjovsky17a.html
  7. [7]Ehsan Azari. 2025. The Divergence Principle: How KL Divergence Shapes Modern AI/ML Paradigms. (2025).DOI
  8. [8]Shaojie Bai, J. Zico Kolter, and Vladlen Koltun. 2018. An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling. ArXiv abs/1803.01271 (2018).arxiv.org/abs/1803.01271
  9. [9]Abdelhakim Benechehab, Vasilii Feofanov, Giuseppe Paolo, Albert Thomas, Maurizio Filippone, and Balázs Kégl. 2025. AdaPTS: Adapting Univariate Foundation Models to Probabilistic Multivariate Time Series Forecasting. arXiv preprint arXiv:2502.10235 (2025).arxiv.org/abs/2502.10235
  10. [10]Leo Breiman. 2001. Random Forests. Machine Learning 45, 1 (2001), 5–32.
  11. [11]Cameron B. Browne, Edward Powley, Daniel Whitehouse, Simon M. Lucas, Peter I. Cowling, Philipp Rohlfshagen, Stephen Taverner, Diego Perez, Spyridon Samothrakis, and Simon Colton. 2012. A Survey of Monte Carlo Tree Search Methods. IEEE Transactions on Computational Intelligence and AI in Games 4, 1 (2012), 1–43. doi:10.1109/TCIAIG.2012.2186810DOI
  12. [12]Luis M. Candanedo, Véronique Feldheim, and Dominique Deramaix. 2017. Data driven prediction models of energy use of appliances in a low-energy house. Energy and Buildings 140 (2017), 81–97.DOI
  13. [13]H. D. Chacon, E. Kesici, and P. Najafırad. 2020. Improving Financial Time Series Prediction Accuracy Using Ensemble Empirical Mode Decomposition and Recurrent Neural Networks. IEEE Access 8 (2020), 117133–117145. doi:10.1109/ACCESS.2020.2996981DOI
  14. [14]Chun-Fu Richard Chen, Quanfу Fan, and Rameswar Panda. 2021. CrossViT: Cross-Attention Multi-Scale Vision Transformer for Image Classification. In IEEE/CVF International Conference on Computer Vision (ICCV). 347–356. doi:10.1109/ICCV48922.2021.00041DOI
  15. [15]Peng Chen, Yingying Zhang, Yunyao Cheng, Yang Shu, Yihang Wang, Qingsong Wen, Bin Yang, and Chenjuan Guo. 2024. Pathformer: Multi-scale transformers with adaptive pathways for time series forecasting. arXiv preprint arXiv:2402.05956 (2024).arxiv.org/abs/2402.05956
  16. [16]Jonathan Crabbé and Mihaela van der Schaar. 2021. Explaining Time Series Predictions with Dynamic Masks. In Proceedings of the 38th International Conference on Machine Learning (ICML) (Proceedings of Machine Learning Research, Vol. 139).arxiv.org/abs/2106.05303
  17. [17]Abhimanyu Das, Matthew Faw, Rajat Sen, and Yichen Zhou. 2024. In-Context Fine-Tuning for Time-Series Foundation Models. arXiv preprint arXiv:2410.24087 (2024).arxiv.org/abs/2410.24087
  18. [18]Abhimanyu Das, Weihao Kong, Rajat Sen, and Yichen Zhou. 2024. A decoder-only foundation model for time-series forecasting. In ICML 2024. https://openreview.net/forum?id=jn2iTJaS6harxiv.org/abs/2310.10688
  19. [19]Angus Dempster, Francois Petitjean, and Geoffrey I. Webb. 2019. ROCKET: exceptionally fast and accurate time series classification using random convolutional kernels. Data Mining and Knowledge Discovery 34 (2019), 1454 – 1495.DOI
  20. [20]Hadi Fanaee-T and João Gama. 2014. Event labeling combining ensemble detectors and background knowledge. Progress in Artificial Intelligence 2 (2014), 113–127.DOI
  21. [21]Arda Fazla, Mustafa Enes Aydın, Orhun Tamyigit, and Süleyman Serdar Kozat. 2022. Context-Aware Ensemble Learning for Time Series. arXiv (2022). doi:10.48550/arXiv.2211.16884DOI
  22. [22]Y. Fu, D. Wu, and B. Boulet. 2022. Context-Aware Ensemble Learning for Time Series Forecasting. In AAAI 2022, Vol. 36. 6639–6647. doi:10.1609/aaai.v36i6.20618
  23. [23]Antonio Galicia, R Talavera-Llames, A Troncoso, Irena Kropinska, and Francisco Martínez-Álvarez. 2019. Multi-step forecasting for big data time series based on ensemble learning. Knowledge-Based Systems 163 (2019), 830–841.DOI
  24. [24]Shanghua Gao, Teddy Koker, Owen Queen, Tom Hartvigsen, Theodoros Tsiligkaridis, and Marinka Zitnik. 2024. UniTS: A Unified Multi-Task Time Series Model. In NeurIPS 2024.arxiv.org/abs/2403.00131
  25. [25]Mononito Goswami, Konrad Safar, Arjun Chaudhry, Yifu Cai, Shuo Li, and Artur Dubrawski. 2024. MOMENT: A Family of Open Time-series Foundation Models. In ICML 2024. https://openreview.net/forum?id=FVvf69a5rx
  26. [26]Kaijian He, Qian Yang, Lei Ji, Jingcheng Pan, and Yingchao Zou. 2023. Financial Time Series Forecasting with the Deep Learning Ensemble Model. Mathematics (2023).DOI
  27. [27]Dan Hendrycks and Kevin Gimpel. 2016. Gaussian error linear units (gelus). arXiv preprint arXiv:1606.08415 (2016).
  28. [28]Hans Hersbach et al. 2020. The ERA5 global reanalysis. Quarterly Journal of the Royal Meteorological Society 146, 730 (2020), 1999–2049.
  29. [29]César A. Hidalgo. 2021. Economic complexity theory and applications. Nature Reviews Physics 3 (2021), 92 – 113.DOI
  30. [30]QiHe Huang, Lei Shen, Ruixin Zhang, Shouhong Ding, Binwu Wang, Zhengyang Zhou, and Yang Wang. 2023. CrossGNN: Confronting Noisy Multivariate Time Series Via Cross Interaction Refinement. In NeurIPS 2023.DOI
  31. [31]Robert A Jacobs, Michael I Jordan, Steven J Nowlan, and Geoffrey E Hinton. 1991. Adaptive mixtures of local experts. Neural computation 3, 1 (1991), 79–87.DOI
  32. [32]Ming Jin, Shiyu Wang, Lintao Ma, Zhixuan Chu, James Y. Zhang, Xiaoming Shi, Pin-Yu Chen, Yuxuan Liang, Yuan-Fang Li, Shirui Pan, and Qingsong Wen. 2024. Time-LLM: Time Series Forecasting by Reprogramming Large Language Models. In ICLR 2024. https://openreview.net/forum?id=Unb5CVPtae
  33. [33]M. I. Jordan and R. A. Jacobs. 1996. Time Series Prediction Using Mixtures of Experts. In NeurIPS 1996.
  34. [34]Jitendra Kumar, Ashutosh Kumar Singh, Anand Mohan, and Rajkumar Buyya. 2019. Ensemble Learning. In Encyclopedia of Biometrics.
  35. [35]Dmitry Lepikhin, HyoukJoong Lee, Yuanzhong Xu, Dehao Chen, Orhan Firat, Yanping Huang, Maxim Krikun, Noam Shazeer, and Zhifeng Chen. 2021. GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding. In ICLR 2021. https://openreview.net/forum?id=qrwe7XHTmYb
  36. [36]Z. Li et al. 2024. Mixture-of-Linear-Experts for Long-term Time Series Forecasting (MoLE). In AISTATS.arxiv.org/abs/2312.06786
  37. [37]Zhe Li, Shiyi Qi, Yiduo Li, and Zenglin Xu. 2023. Revisiting Long-term Time Series Forecasting: An Investigation on Linear Mapping. ArXiv abs/2305.10721 (2023).DOI
  38. [38]Yuxuan Liang, Haoming Wen, Yingqi Nie, Yuhan Jiang, Ming Jin, Dongjin Song, Shirui Pan, and Qingsong Wen. 2024. Foundation models for time series analysis: A tutorial and survey. In Proceedings of the 30th ACM SIGKDD conference on knowledge discovery and data mining. 6555–6565. doi:10.1145/3637528.3671451DOI
  39. [39]Bryan Lim, Sercan Ö. Arik, Nicolas Loeff, and Tomas Pfister. 2021. Temporal Fusion Transformers for interpretable multi-horizon time series forecasting. International Journal of Forecasting 37, 4 (2021), 1748–1764.arxiv.org/abs/1912.09363
  40. [40]Jingwei Liu, Ling Yang, Hongyan Li, and Shenda Hong. 2024. Retrieval-Augmented Diffusion Models for Time Series Forecasting. In NeurIPS 2024.arxiv.org/abs/2410.18712
  41. [41]Minhao Liu, Ailing Zeng, Mu-Hwa Chen, Zhijian Xu, Qiuxia Lai, Lingna Ma, and Qiang Xu. 2022. SCINet: Time Series Modeling and Forecasting with Sample Convolution and Interaction. In NeurIPS 2022.arxiv.org/abs/2106.09305
  42. [42]Yong Liu, Tengge Hu, Haoran Zhang, Haixu Wu, Shiyu Wang, Lintao Ma, and Mingsheng Long. 2024. iTransformer: Inverted Transformers Are Effective for Time Series Forecasting. In ICLR 2024. https://openreview.net/forum?id=JePfAI8fah
  43. [43]Yong Liu, Haoran Zhang, Chenyu Li, Xiangdong Huang, Jianmin Wang, and Mingsheng Long. 2024. Timer: Generative Pre-trained Transformers Are Large Time Series Models. In ICML 2024. https://openreview.net/forum?id=bYRYb7dMNoarxiv.org/abs/2402.02368
  44. [44]Yisheng Lv, Yanjie Duan, Wenwen Kang, Zhengxi Li, and Fei-Yue Wang. 2014. Traffic Flow Prediction with Big Data: A Deep Learning Approach. IEEE Transactions on Intelligent Transportation Systems 16, 2 (2014), 865–873. doi:10.1109/TITS.2014.2453663DOI
  45. [45]Yuqi Nie, Nam H. Nguyen, Phanwadee Sinthong, and Jayant Kalagnanam. 2023. A Time Series is Worth 64 Words: Long-term Forecasting with Transformers. In ICLR 2023. https://openreview.net/forum?id=Jbdc0vTOcolarxiv.org/abs/2211.14730
  46. [46]Boris N Oreshkin, Dmitri Carpov, Nicolas Chapados, and Yoshua Bengio. 2021. Meta-learning framework with applications to zero-shot time-series forecasting. In AAAI 2021, Vol. 35. 9242–9250. doi:10.1609/AAAI.V35I10.17115
  47. [47]Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In NeurIPS 2019. 8024–8035.arxiv.org/abs/1912.01703
  48. [48]Zhongzheng Qiao, Chenghao Liu, Yiming Zhang, Ming Jin, Quang Pham, Qingsong Wen, Ponnuthurai Nagaratnam Suganthan, Xudong Jiang, and Savitha Ramasamy. 2025. Multi-Scale Finetuning for Encoder-based Time Series Foundation Models. ArXiv abs/2506.14087 (2025).arxiv.org/abs/2506.14087
  49. [49]Owen Queen, Thomas Hartvigsen, Teddy Koker, Huan He, Theodoros Tsiligkaridis, and Marinka Zitnik. 2023. Encoding Time-Series Explanations through Self-Supervised Model Behavior Consistency. In Advances in Neural Information Processing Systems (NeurIPS), Vol. 36.
  50. [50]Syama Sundar Rangapuram, Matthias W. Seeger, Jan Gasthaus, Lorenzo Stella, Yuyang Wang, and Tim Januschowski. 2018. Deep State Space Models for Time Series Forecasting. In NeurIPS 2018. 7796–7805.
  51. [51]Carlos Riquelme, Joan Puigcerver, Basil Mustafa, Maxim Neumann, Rodolphe Jenatton, André Susano Pinto, Daniel Keysers, and Neil Houlsby. 2021. Scaling vision with sparse mixture of experts. Advances in Neural Information Processing Systems 34 (2021), 8583–8595.arxiv.org/abs/2106.05974
  52. [52]Koushik Roy and Prasanjit Pratim Banik. 2023. Ensemble Deep Learning Techniques for Time Series Analysis: A Comprehensive Review. Artificial Intelligence Review 56 (2023), 3715–3757. doi:10.1007/s10462-023-10479-7
  53. [53]David Salinas, Valentin Flunkert, Jan Gasthaus, and Tim Januschowski. 2020. DeepAR: Probabilistic forecasting with autoregressive recurrent networks. International journal of forecasting 36, 3 (2020), 1181–1191.arxiv.org/abs/1704.04110
  54. [54]Xiaoming Shi, Shiyu Wang, Yuqi Nie, Dianqi Li, Zhou Ye, Qingsong Wen, and Ming Jin. 2025. Time-MoE: Billion-Scale Time Series Foundation Models with Mixture of Experts. In ICLR 2025. https://openreview.net/forum?id=elwDDfmIVu
  55. [55]U.S. Environmental Protection Agency. 2025. Air Quality System (AQS). https://www.epa.gov/aqs.
  56. [56]Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Lion Jones, Aidan N. Gomez, Lukasz Kaiser, and Illia Polosukhin. 2017. Attention Is All You Need. In NeurIPS 2017.arxiv.org/abs/1706.03762
  57. [57]Shiyu Wang, Haixu Wu, Xiaoming Shi, Tengge Hu, Huakun Luo, Lintao Ma, James Y. Zhang, and Jun Zhou. 2024. TimeMixer: Decomposable Multiscale Mixing for Time Series Forecasting. In ICLR 2024. https://openreview.net/forum?id=7oLshfEIC2arxiv.org/abs/2405.14616
  58. [58]Rafal Weron. 2014. Electricity price forecasting: A review of the state-of-the-art with a look into the future. International journal of forecasting 30, 4 (2014), 1030–1081. doi:10.1016/j.ijforecast.2014.08.008DOI
  59. [59]Wetterstation, Max Planck Institute for Chemistry. [n. d.]. Weather Station Dataset from Jena, Germany. https://www.bgc-jena.mpg.de/wetter/. Climate observations recorded at the Beutenberg weather station in Jena, Germany, freely available under CC-BY-4.0.
  60. [60]Haixu Wu, Tengge Hu, Yong Liu, Hang Zhou, Jianmin Wang, and cd Mingsheng Long. 2023. TimesNet: Temporal 2D-Variation Modeling for General Time Series Analysis. In ICLR 2023. https://openreview.net/forum?id=ju_Uqwv3840qarxiv.org/abs/2210.02186
  61. [61]Haixu Wu, Juehui Xu, Jianmin Wang, and Mingsheng Long. 2021. Autoformer: Decomposition Transformers with Auto-Correlation for Long-Term Series Forecasting. In NeurIPS 2021. 22419–22430.arxiv.org/abs/2106.13008
  62. [62]Haixu Wu, Hang Zhou, Mingsheng Long, and Jianmin Wang. 2023. Interpretable Weather Forecasting for Worldwide Stations with a Unified Deep Model. Nature Machine Intelligence 5, 6 (2023), 602–611. doi:10.1038/s42256-023-00667-9DOI
  63. [63]Zonghan Wu, Shirui Pan, Guodong Long, Jing Jiang, Xiaojun Chang, and Chengqi Zhang. 2020. Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2020).arxiv.org/abs/2005.11650
  64. [64]Ming Yuan and Yi Lin. 2006. Model Selection and Estimation in Regression with Grouped Variables. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 68, 1 (2006), 49–67. doi:10.1111/j.1467-9868.2005.00532.xDOI
  65. [65]Hao Zhang, Shanbin Hao, and Chong-Wah Ngo. 2021. Token Shift Transformer for Video Classification. In Proceedings of the 29th ACM International Conference on Multimedia. Association for Computing Machinery, 917–925. doi:10.1145/3474085.3475272DOI
  66. [66]Zheng Zhang, Weihai Chen, Xingming Wu, Peter CY Chen, and Jingmeng Liu. 2017. LSTM network: a deep learning approach for short-term traffic forecast. IET intelligent transport systems 11, 2 (2017), 68–75.DOI
  67. [67]Haoyi Zhou, Shanghang Zhang, Jieqi Peng, Shuai Zhang, Jianian Li, Xiaoming Xiong, and Wancai Zhang. 2021. Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting. In AAAI 2021, Vol. 35. 11106–11115.arxiv.org/abs/2012.07436
  68. [68]Tian Zhou, Ziqing Ma, Qingsong Wen, Xue Wang, Liang Sun, and Rong Jin. 2022. FEDformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecasting. In ICML 2022, Vol. 162. PMLR, 27268–27286. https://proceedings.mlr.press/v162/zhou22g.htmlarxiv.org/abs/2201.12740

Paper details

vlnc:W_jxt3r4nw
v1 · latestHistory (1)

published · Fresh — added to the Hub within the last 30 days

added ·

Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

CC BY 4.0

Original source

  • Computer Science

Not recorded for this paper · View statement →

Looking for related papers…
Contents