ConceptioArchivearXiv CS
arXiv CSopen access

Adaptive Oscillatory-State Alignment for Time Series Forecasting

Unknown · 2026 · arxiv_cs
arXiv CS · Papers · License: Open Access · 2026
Open Source ↗Direct PDF ↓
databasesdatamanagementsqlstorage
databases, sql, data management, storage

Adaptive Oscillatory-State Alignment for Time Series Forecasting Zhangyao Song1 , Ziqiong Li2 , Xiangfei Qiu3 , Chao Zha4 , Yinfei Xu5 , Tao Guo1B 1

School of Cyber Science and Engineering, Southeast University, Nanjing, China School of Mathematics and Statistics, Central South University, Changsha, China 3 School of Data Science and Engineering, East China Normal University, Shanghai, China 4 State Key Laboratory of BlockChain and Data Security, Zhejiang University, Hangzhou, China 5 School of Information Science and Engineering, Southeast University, Nanjing, China

arXiv:2606.06010v1 [cs.LG] 4 Jun 2026

2

Abstract—Long-term time series forecasting benefits from inductive biases that expose recurring temporal structure. Existing periodic forecasting methods typically model recurrence through predefined periods, global spectral components, or fixed learnable templates. However, real-world temporal dynamics are rarely rigidly periodic: oscillatory behavior often evolves through amplitude modulation, phase drift, and local frequency variation. Under these conditions, fixed-template periodic modeling can become fundamentally mismatched to the underlying temporal states. We propose AOSN ET, a Hilbert-guided forecasting framework that reformulates periodic forecasting from fixed template matching to adaptive oscillatory-state alignment. AOSN ET extracts analytic-signal descriptors from both the observed sequence and a learnable global oscillatory prior, then adaptively aligns local states through a descriptor-conditioned gate that selectively preserves reliable observations while softly correcting mismatched regions. The learned prior serves not as a rigid repeated template but as a flexible oscillatory reference interpreted through local state dynamics. Experiments on eight benchmarks demonstrate state-of-the-art or highly competitive accuracy with fast inference speed. Controlled synthetic studies isolating amplitude modulation, phase drift, and local frequency variation confirm that the advantage of oscillatory-state alignment consistently increases as non-stationarity intensifies. Index Terms—Time series forecasting, periodicity, Hilbert transform, analytic signal, non-stationary time series.

I. I NTRODUCTION Time series forecasting is a fundamental problem in machine learning with broad applications in energy systems, transportation, finance, and climate science [1]–[8]. In longterm forecasting, predictive performance depends not only on modeling short-term dependencies but also on capturing recurring temporal structure over extended horizons [9]–[11]. Consequently, recent research increasingly relies on explicit temporal inductive biases, including decomposition methods, spectral representations, and learnable periodic priors [12]– [14]. Despite their architectural differences, most existing periodic forecasting methods share a common underlying assumption: recurrence can be represented as a fixed repeated template. Some approaches explicitly estimate a dominant period and align observations according to cycle indices [15],

[16]; others model periodicity through global frequency components [12], [17]–[19] or learnable periodic embeddings. Decomposition methods separate seasonal and trend components under similar stationarity assumptions [6], [20]–[22]. These methods have demonstrated strong empirical performance, suggesting that explicit periodic structure is indeed a useful forecasting prior. The difficulty, however, is not merely that the correct period may be unknown. Many real-world series contain oscillatory behavior whose state changes within a single sequence. Electricity demand may retain a daily rhythm while its intensity varies with weather and human activity; traffic flows may exhibit delayed or advanced peaks under holidays; and environmental signals may contain oscillations whose local pace drifts over time. In these cases, recurring patterns are affected by three coupled factors: amplitude modulation, phase drift, and local frequency variation, which we formally define below. Definition I.1 (Amplitude Modulation). A signal exhibits amplitude modulation if its instantaneous envelope A(t) is not constant over time, i.e., dA/dt ̸= 0 for some t. In a periodic signal with nominal period P , this means that the peak-totrough magnitude varies across cycles: the waveform shape repeats but its intensity changes. Definition I.2 (Phase Drift). A signal exhibits phase drift if its instantaneous phase deviates from that of a reference oscillation with constant angular frequency ω0 = 2π/P0 . Formally, defining the phase residual δ(t) = ϕ(t) − ω0 t − ϕ0 , phase drift occurs when δ(t) is non-constant: dδ/dt ̸= 0 for some t. This corresponds to peaks and troughs arriving earlier or later than predicted by the nominal period. Definition I.3 (Local Frequency Variation). A signal exhibits local frequency variation if its instantaneous frequency ω(t) = dϕ/dt is not constant over time: dω/dt ̸= 0 for some t. Equivalently, the local period P (t) = 2π/ω(t) changes, so consecutive cycles have different durations. This subsumes phase drift as a special case but additionally implies that the rate of phase change itself varies. These three phenomena are coupled in practice—for instance, a time-varying local period necessarily induces phase drift—but they describe distinct aspects of non-stationarity.

Existing Periodic Methods

AOSN ET (Ours)

(Fixed Periodic Templates)

(Adaptive Oscillatory States)

fixed period T

vary over time

Hilbert descriptors Learn / select fixed template(s)

...

a Non-stationary

c, s

fixed → adaptive Global and static periodic patterns Local oscillatory states

Limitation

Advantage

• Requires pre-defined period • Sensitive to phase shift • Hard to handle freq. change • Struggles with non-stationarity

• No need for predefined period • Adapt to phase drift • Handle frequency variation • Robust to non-stationarity

Fig. 1. Motivation of AOSN ET. Existing periodic methods typically learn or select fixed periodic templates, which can be sensitive to period misspecification, phase drift, and frequency variation. AOSN ET instead represents temporal structure as adaptive local oscillatory states derived from amplitude, phase, and instantaneous-frequency descriptors.

Amplitude modulation changes the signal strength without altering timing; phase drift shifts cycle positions without changing instantaneous speed; and local frequency variation changes the instantaneous oscillation rate. Fixed-template or fixed-period methods assume all three quantities are constant, which motivates the adaptive oscillatory-state alignment of AOSN ET. This observation motivates a different view of periodic forecasting. Rather than treating periodicity as repeated template retrieval, we argue that forecasting should operate in an oscillatory-state space, where recurrence is represented by evolving local dynamical states. The key object is not a globally repeated cycle, but a local oscillatory state describing how strongly the signal oscillates, where it currently lies within the oscillation, and how rapidly the oscillation evolves. These quantities naturally correspond to the amplitude envelope, instantaneous phase, and instantaneous frequency in analytic signal analysis [23], [24]. The Hilbert transform provides differentiable descriptors of these states directly from real-valued sequences, without requiring period selection through prior knowledge, autocorrelation search, or frequency truncation. Fig. 1 illustrates this motivation. Based on this perspective, we propose AOSN ET, a Hilbertguided forecasting framework for adaptive oscillatory-state alignment. Instead of constructing a cycle table indexed by a predefined period, AOSN ET learns a channel-wise global oscillatory prior shared across samples and constructs local oscillatory-state descriptors from both the observed sequence and the prior. A descriptor-conditioned adaptive gate then performs local state alignment by selectively preserving reli-

able observations while softly correcting mismatched regions toward the learned reference. The learned prior does not represent a rigid repeated template; rather, it serves as a flexible oscillatory reference that is adaptively interpreted through local state descriptors. Concretely, AOSN ET derives log-amplitude, phase (sine and cosine), and instantaneous frequency from both the input and the global prior. A lightweight convolutional gate consumes these descriptors and produces a time- and channeldependent fusion coefficient. After this Hilbert-guided correction, a compact dual-path backbone combines an attention path for cross-variate refinement with a base path for stable temporal projection. The architecture is lightweight, fully differentiable, and requires no manually specified periods. Our contributions are summarized as follows. • We reformulate periodic forecasting from fixed template matching to adaptive oscillatory-state alignment, identifying amplitude modulation, phase drift, and local frequency variation as key mismatch sources that fixedtemplate methods cannot accommodate. • We propose AOSN ET , which compares observations with a learnable global oscillatory prior through Hilbertdomain envelope, phase, and instantaneous-frequency descriptors, then adaptively aligns local states via a descriptor-conditioned gate. • We demonstrate state-of-the-art or highly competitive accuracy on eight benchmarks with fast inference speed. Controlled synthetic experiments isolating each nonstationary factor confirm that AOSN ET consistently outperforms fixed-template baselines, with growing advantage as non-stationarity intensifies. II. R ELATED W ORK 1) Periodic and Decomposition-Based Forecasting: Longterm forecasting has increasingly relied on explicit temporalstructure modeling. Attention- and convolution-based architectures enlarge the receptive field for long-range dependencies [5], [9], [10], [25], [26], while lightweight decomposition methods prove highly competitive [6], [20], [21], [27]. More recently, learnable periodic priors have emerged as strong forecasting inductive biases: CycleNet learns recurrent cycle templates [15], TQNet injects periodically shifted learnable vectors as temporal queries [16], and MoFo models periodic patterns for long-term prediction [28]. These methods share a common assumption—recurrence is represented as a fixed repeated template indexed by a predefined or estimated period. When the underlying oscillatory dynamics evolve through amplitude modulation, phase drift, or frequency variation, this fixed-template assumption becomes a fundamental limitation. AOSN ET departs from this paradigm by performing adaptive oscillatory-state alignment through Hilbert-domain descriptors, preserving the benefit of explicit temporal priors without requiring globally stable periods. 2) Frequency-Domain and Signal-Processing Methods: Frequency-domain approaches exploit the spectral separability of periodic structure. FEDformer and FILM model

long-range dependencies via frequency representations [17], [25]; FITS performs lightweight frequency interpolation [29]; FAN addresses non-stationarity through frequency-adaptive normalization [12]; FreDF learns directly in the frequency domain [18]; and Amplifier recovers neglected low-energy components [19]. While effective, these methods operate on global or window-level spectral components and thus implicitly assume locally stationary frequency content. AOSN ET instead derives time-local analytic-signal descriptors— envelope, instantaneous phase, and instantaneous frequency— via the Hilbert transform [23], [24]. This enables modeling of amplitude modulation and frequency drift at each time step, providing finer-grained oscillatory-state information than global spectral decomposition. 3) Multivariate Dependency Modeling: Cross-variate dependency modeling complements temporal modeling in multivariate forecasting. Early Transformer variants mix temporal and channel dimensions through attention [5], [9], [30], [31]; PatchTST advocates channel independence for robustness [10]; and subsequent work revisits the independenceversus-interaction trade-off [32]. Inverted or channel-token architectures—iTransformer [11], Crossformer [33], HDMixer [34], SAMformer [35]—further advance multivariate interaction learning. These methods focus on how variables interact after representation, yet the temporal signal fed into cross-variate modules may still carry non-stationary oscillatory distortions. AOSN ET addresses this by first performing per-channel oscillatory-state alignment, so that downstream channel-token attention operates on structurally refined signals rather than raw observations. III. M ETHODOLOGY This section presents AOSN ET, a Hilbert-guided forecasting framework that reformulates periodic modeling from fixed template matching to adaptive oscillatory-state alignment. We first define the forecasting problem, then introduce the analytic-signal descriptors, and finally describe the adaptive oscillatory-state (AOS) module and forecasting backbone. A. Problem Formulation Given a multivariate historical window X ∈ RC×L with C variables and look-back length L, the goal of point forecasting is to predict the future horizon Y ∈ RC×H : b t+1:t+H , fθ : Xt−L+1:t 7→ Y

(1)

where H is the forecasting length. For notation clarity, we omit the time index and write the input as X and the preb AOSN ET follows the channel-token convention diction as Y. commonly used in multivariate forecasting: each variate is first represented as an individual temporal token, and cross-variate dependencies are refined after oscillatory-state alignment. B. Analytic-Signal Descriptors The core idea of AOSN ET is to represent temporal dynamics in an oscillatory-state space rather than through a fixed

global period. For a real-valued sequence x ∈ RL , its analytic signal is defined as z = x + i H(x),

(2)

where H(·) denotes the Hilbert transform [23], [24]. In practice, we compute it with an FFT-based differentiable implementation [36]. Let F and F −1 denote the discrete Fourier transform and its inverse. The analytic signal can be obtained by suppressing negative frequencies and doubling positive frequencies: z = F −1 (m ⊙ F (x)) ,

(3)

where m ∈ RL is the standard analytic-signal frequency mask. For even L, m0 = mL/2 = 1, mk = 2 for 1 ≤ k < L/2, and the remaining entries are zero; the odd-length case is defined analogously. From z, we extract three local descriptors: a = log (|z| + ϵ) , c = cos(∠z), ωℓ = ∠

∗ zℓ zℓ−1



,

(4) s = sin(∠z),

(5)

ℓ = 2, . . . , L.

(6)

Here a is the log-amplitude envelope, (c, s) provides a continuous phase representation, and ω estimates instantaneous frequency through phase increments. The first frequency value is padded by replication. The phase-increment form avoids explicit phase unwrapping and yields a bounded local descriptor of instantaneous frequency. These descriptors are used as structural cues; they do not require the signal to have a single stable cycle. C. Adaptive Oscillatory-State Alignment AOSN ET performs adaptive oscillatory-state alignment through descriptor-conditioned interpolation between the observed sequence and a learnable oscillatory reference. 1) Global Oscillatory Prior: AOSN ET introduces a learnable channel-wise prior P ∈ RC×L , shared across all samples. Unlike fixed periodic templates indexed by a predefined period, P is not constrained to repeat with any cycle length. It serves as a flexible oscillatory reference that is adaptively interpreted through local state descriptors, with its influence modulated by the gate at each time step. 2) Descriptor-conditioned gate: For each input X, we compute analytic-signal descriptors for both the observed sequence and the global temporal prior: D(X) = {ax , cx , sx , ω x },

D(P) = {ap , cp , sp , ω p }. (7) For each channel, we concatenate these descriptors along the feature dimension: uc = Concat[axc , apc , cxc , sxc , cpc , spc , ωcx , ωcp ] ∈ R8×L .

(8)

A lightweight one-dimensional convolutional gate then produces a local fusion coefficient: gc = σ(Conv2 (ϕ(Conv1 (uc )))) ,

gc ∈ [0, 1]L ,

(9)

where ϕ(·) is the GELU (Gaussian Error Linear Unit) activation [37] and σ(·) is the sigmoid function.

Residual Path embedding + MHA

Base Path temporal projection

Prediction Fusion b = λY b res + (1 − λ)Y b base Y λ = σ(η)

Corrected State e = (1 − G) ⊙ X + G ⊙ P X

Global Prior P ∈ RC×L

Adaptive Gate descriptor concat Conv1D → GELU → Conv1D G = σ(·)

Observed Window X ∈ RC×L

Hilbert Descriptors D(X), D(P) a, cos ϕ, sin ϕ, ω log-amplitude, phase, inst. frequency

Adaptive Oscillatory State

Fig. 2. Overall architecture of AOSN ET. The observed sequence and a learnable global oscillatory prior are mapped to analytic-signal descriptors, from which a descriptor-conditioned gate performs adaptive oscillatory-state alignment. The aligned representation is processed by two complementary forecasting paths: an attention path with channel-token attention, and a base path with direct temporal projection, fused by a learnable coefficient.

3) State Alignment: The gate performs local oscillatorystate alignment by adaptively interpolating between the observation and the global oscillatory prior: e = (1 − G) ⊙ X + G ⊙ P, X (10) where G ∈ [0, 1]C×L stacks all channel gates. When the observed oscillatory state is locally consistent with the learned prior, the gate preserves the raw sequence; when amplitude, phase, or frequency descriptors indicate a mismatch, the model softly corrects the input toward P. This mechanism provides an explicit temporal inductive bias through gated residual alignment rather than fixed period indexing or hard template matching. D. Dual-Path Forecasting Head After oscillatory-state alignment, AOSN ET feeds the e ∈ RC×L into two complementary forealigned sequence X casting paths (see Fig. 2). The two paths separate stable perchannel temporal extrapolation from expressive cross-variate refinement, so that the primary temporal inductive bias remains in the AOS module rather than being absorbed into a more complex backbone. 1) Attention Path: This path models cross-variate nonlinear corrections after alignment. A shared temporal embedding first projects each channel from the look-back length L into a hidden dimension d, with dropout regularization [38]:

2) Base Path: This path provides the stable per-channel extrapolation anchor. For each channel, a shared weight matrix directly maps the corrected look-back window to the prediction horizon: bbase,c = Wl x e c + bl , y

Wl ∈ RH×L .

(14)

b base ∈ RC×H . Stacking all channels gives Y 3) Prediction Fusion: The final prediction is a learnable combination of the two paths: b = λY b att + (1 − λ) Y b base , Y

λ = σ(η),

(15)

where η is a scalar learnable parameter. This dual-path design lets the model adaptively allocate prediction mass between stable channel-wise extrapolation in the base path and nonlinear cross-variate correction in the attention path. IV. FFT-BASED A NALYTIC S IGNAL I MPLEMENTATION

(12)

Algorithm 1 summarizes the analytic-signal computation for a single real-valued sequence. The frequency mask preserves the DC component, preserves the Nyquist component for evenlength sequences, doubles positive frequencies, and removes negative frequencies. We provide a self-contained derivation of the Hilbert transform and its connection to the analytic-signal descriptors used in AOSN ET. 1) Continuous-Time Definition: For a real-valued signal x(t) ∈ L2 (R), the Hilbert transform is defined as the Cauchy principal value integral [23]:   Z ∞ x(τ ) 1 1 dτ = ∗ x(t), (16) H{x}(t) = p.v. π t − τ πt −∞

The refined features are passed through a shallow nonlinear projection and output head: b att = Wo ϕ(Wr R + br ) + bo . Y (13)

where ∗ denotes convolution. Intuitively, the Hilbert transform is an all-pass filter that shifts each frequency component of x(t) by −π/2 radians while preserving its amplitude.

ec + be )) , hc = Dropout(ϕ(We x

hc ∈ Rd .

(11)

C×d

Stacking all channels gives H ∈ R . A residual multihead self-attention (MHA) layer [30] then refines cross-variate interactions over these channel tokens: R = MHA(H, H, H) + H.

Algorithm 1 FFT-Based Analytic Signal for One Sequence 1: Input: Real-valued sequence x = (x0 , . . . , xL−1 ) ∈ RL 2: Output: Analytic signal z ∈ CL 3: s ← F(x) (Fourier spectrum) 4: m ← 0 ∈ RL (Frequency mask) 5: if L is even then 6: m0 ← 1, mL/2 ← 1 7: mk ← 2 for k = 1, . . . , L/2 − 1 8: else 9: m0 ← 1 10: mk ← 2 for k = 1, . . . , (L − 1)/2 11: end if 12: z ← F −1 (m ⊙ s) 13: return z

5) Instantaneous Phase: The instantaneous phase is the argument of the analytic signal: ϕ(t) = ∠ z(t) = arctan

so the Fourier transform of the Hilbert-transformed signal is F{H{x}}(f ) = −i sgn(f ) · X(f ).

(18)

This confirms the −π/2 phase shift: multiplying by −i rotates the phasor by −90◦ for positive frequencies and by +90◦ for negative frequencies. 3) Construction of the Analytic Signal: The analytic signal is formed by combining the original signal with its Hilbert transform as the imaginary part: z(t) = x(t) + i H{x}(t).

(19)

(22)

Rather than using ϕ(t) directly (which requires unwrapping to avoid 2π discontinuities), AOSN ET represents phase through its sine and cosine components (cos ϕ, sin ϕ). This provides a continuous, bounded representation on the unit circle that is compatible with gradient-based optimization. 6) Instantaneous Frequency: The instantaneous frequency is the time derivative of the instantaneous phase: ω(t) =

2) Frequency-Domain Interpretation: Let X(f ) = F{x}(f ) denote the Fourier transform of x(t). The transfer function of the Hilbert transform is     −i, f > 0, 1 (17) = −i sgn(f ) = 0, H(f ) = F f = 0,  πt  +i, f < 0,

H{x}(t) . x(t)

dϕ(t) . dt

(23)

For discrete sequences, we approximate this via the phase increment between consecutive samples. Using the property that for two complex numbers zℓ and zℓ−1 , the phase difference equals the argument of their product with conjugate:  ∗ ωℓ = ϕℓ − ϕℓ−1 = ∠ zℓ · zℓ−1 ,

ℓ = 2, . . . , L,

(24)

where z ∗ denotes complex conjugation. This formulation ∗ avoids explicit phase unwrapping because ∠(zℓ zℓ−1 ) is always in (−π, π], yielding a bounded descriptor that directly measures local oscillation speed. 7) Summary: The three descriptors—log-amplitude a, phase (c, s) = (cos ∠z, sin ∠z), and instantaneous frequency ω—together characterize the local oscillatory state of a signal at each time step. They are computed entirely through FFT operations (Algorithm 1) and are fully differentiable, making them suitable as conditioning inputs to the adaptive gate in AOSN ET.

Taking the Fourier transform of both sides: V. E XPERIMENTS Z(f ) = X(f ) + i · [−i sgn(f )] X(f ) = X(f ) [1 + sgn(f )]   2X(f ), f > 0, = X(0), f = 0,   0, f < 0.

(20)

Thus, the analytic signal retains only positive-frequency content (doubled in magnitude) and removes negative frequencies entirely. This one-sided spectrum ensures that the instantaneous amplitude, phase, and frequency are uniquely and meaningfully defined. 4) Instantaneous Amplitude (Envelope): The instantaneous amplitude is the modulus of the analytic signal: p A(t) = |z(t)| = x(t)2 + H{x}(t)2 . (21) This quantity traces the envelope of the oscillation. In AOSN ET, we use the log-amplitude a = log(|z| + ϵ) for numerical stability and to normalize scale differences across channels.

We conduct a comprehensive empirical evaluation of AOSN ET across five complementary axes. First, we benchmark forecasting accuracy against nine recent models on eight standard datasets (Sec. V-B). Second, we construct a controlled setting where fixed-template methods systematically fail under amplitude-phase perturbations, illustrating the motivation behind adaptive oscillatory-state alignment (Sec. V-C). Third, we analyze the learned representations to verify that the global prior functions as an oscillatory reference rather than a rigid template, and that the gate operates meaningfully in the envelope-phase-frequency space (Sec. V-D). Fourth, a case study demonstrates that two time windows with identical phase can nonetheless require distinct oscillatory states (Sec. V-E). Fifth, we evaluate on two workload traces from a cloudservice benchmark to test whether the same alignment story transfers to operational load forecasting (Sec. V-B2). Finally, we ablate each component and examine sensitivity to key hyperparameters (Sec. V-F).

History

TABLE I D ETAILED INFORMATION ABOUT THE DATASETS USED IN THIS STUDY. Channels

Timesteps

Interval

Domain

Common Benchmarks ETTh1 7 ETTh2 7 ETTm1 7 ETTm2 7 Electricity 321 Solar 137 Traffic 862 Weather 21

14,400 14,400 57,600 57,600 26,304 52,560 17,544 52,696

1 hour 1 hour 15 mins 15 mins 1 hour 10 mins 1 hour 10 mins

Electricity Electricity Electricity Electricity Electricity Energy Transportation Weather

Workload Traces IaaS 93 PaaS 426

3,456 7,776

10 mins 10 mins

Cloud workload Cloud workload

Forecast

TQNet

CycleNet

iTransformer

3

Value

2 1 0 1

3 2

Value

Dataset

Ground truth

AOSNet

1 0 1

A. Setup All experiments are implemented in PyTorch [39]. We evaluate forecasting accuracy with Mean Squared Error (MSE) and Mean Absolute Error (MAE), where lower values indicate better performance. Following the standard long-term forecasting protocol, the look-back length is fixed to L = 96 for all benchmark comparisons. 1) Datasets: We evaluate on 8 widely-used multivariate forecasting benchmarks: ETTh1, ETTh2, ETTm1, ETTm2 from the ETT series [5]; Electricity, Solar-Energy, Traffic, and Weather [9]. We further evaluate on two cloud workload traces (IaaS and PaaS) sampled at 10-minute intervals. For all datasets, the prediction horizons are H ∈ {96, 192, 336, 720} with a fixed look-back length of 96. Detailed dataset statistics are summarized in Table I. 2) Baselines: We compare AOSN ET with representative recent forecasting models, including TQNet [16], SRSNet [40], SSformer [41], CycleNet [15], Amplifier [19], iTransformer [11], PatchTST [10], and DLinear [6]. To ensure consistency with the reference benchmark, we use TQNet’s reported results when available and supplement missing baseline entries from SEER; SSformer results are taken from the original paper. When the two sources overlap, TQNet is treated as the primary source. B. Forecasting Performance 1) Common Benchmarks: Table II reports the full results across all horizons. AOSN ET achieves the best or second-best MSE on 7 out of 8 datasets and the best MAE on 7 out of 8 datasets; the only exceptions are Solar-Energy (where the best MSE belongs to TQNet) and Traffic (where the best MAE belongs to TQNet). Compared with the most relevant fixedtemplate periodic-prior baselines (TQNet, CycleNet), AOSN ET consistently improves accuracy, particularly on datasets with complex oscillatory dynamics such as Electricity (−3.0% MSE vs. TQNet) and ETTh2 (−4.8% MSE vs. TQNet). These gains are consistent with our motivation: adaptive oscillatorystate alignment is most beneficial when recurrence persists but local amplitude, phase, or frequency states evolve over time.

0

24

48

72

96 120 144 168 192 0

Time step

24

48

72

96 120 144 168 192

Time step

Fig. 3. Representative IaaS 96→96 forecasting visualization on a single channel. Each panel compares the same history window (gray), ground truth (black), and model forecast (colored) for AOSN ET, TQNet, CycleNet, and iTransformer. AOSN ET tracks the post-history state transition more faithfully, whereas the baselines either over-smooth the change point or drift toward rigid template-like forecasts.

2) Workload Forecasting: We further evaluate on two cloud workload traces (IaaS and PaaS) sampled every 10 minutes. In addition to MSE and MAE, we report Normalized MAE (NMAE). Table III presents the full per-horizon results. AOSN ET ranks first on all metrics for IaaS and on average for PaaS, with the advantage over TQNet growing at longer horizons (MSE gap from 0.000 at H=96 to 0.043 at H=720 on IaaS). This confirms that adaptive oscillatory-state alignment transfers effectively to operational cloud workload forecasting. Fig. 3 shows a representative IaaS 96→96 case. On this sample, AOSN ET follows the post-history regime transition more faithfully, while TQNet and CycleNet remain closer to rigid template-like dynamics and iTransformer underfits the oscillatory pattern. 3) Stability: To assess statistical significance, we report all AOSN ET results as the mean and standard deviation over 5 independent runs with different random seeds. As shown in Table II, the standard deviations are tightly bounded across all datasets and horizons—MSE std is at most 0.003 and MAE std at most 0.003—indicating that AOSN ET’s performance is stable and not sensitive to random initialization. 4) Efficiency: Fig. 4 shows that AOSN ET achieves the best accuracy–efficiency trade-off: lowest MSE/MAE with the fastest inference (9.15 ms/batch)—1.4× faster than TQNet, 7.9× faster than PatchTST, and 17.6× faster than SSformer— while using only 1.45M parameters. C. Failure Modes of Fixed-Template Periodicity The introduction argues that fixed periodic templates become fundamentally mismatched under amplitude modulation, phase drift, and local frequency variation. We now provide

TABLE II F ULL MULTIVARIATE FORECASTING RESULTS FOR ALL PREDICTION HORIZONS . T HE LOOK - BACK LENGTH IS FIXED TO 96. AOSN ET VALUES ARE MEAN ± STD OVER 5 RUNS . Model

Weather

Traffic

Solar-Energy

Electricity

ETTm2

ETTm1

ETTh2

ETTh1

Metric

AOSN ET (Ours) MSE MAE

TQNet (2025) MSE MAE

SRSNet (2025) MSE MAE

SSformer (2026) MSE MAE

CycleNet (2024) MSE MAE

Amplifier (2025) MSE MAE

iTransformer (2024) MSE MAE

PatchTST (2023) MSE MAE

DLinear (2023) MSE MAE

0.393 0.431 0.454 0.495

0.375 0.436 0.496 0.520

0.395 0.428 0.455 0.484

0.376 0.442 0.478 0.501

0.393 0.430 0.446 0.479

0.386 0.441 0.487 0.503

0.405 0.436 0.458 0.491

0.414 0.460 0.501 0.500

0.419 0.445 0.466 0.488

0.386 0.437 0.481 0.519

0.400 0.432 0.459 0.516

96 192 336 720

0.368±0.002 0.421±0.003 0.459±0.002 0.462±0.003

0.392±0.001 0.421±0.002 0.440±0.003 0.461±0.002

0.371 0.428 0.476 0.487

0.393 0.426 0.446 0.470

0.383 0.433 0.476 0.474

0.395 0.422 0.446 0.471

0.373 0.432 0.483 0.519

Avg

0.427±0.003

0.429±0.002

0.441

0.434

0.442

0.433

0.452

0.443

0.457

0.441

0.449

0.437

0.454

0.448

0.469

0.455

0.456

0.452

96 192 336 720

0.280±0.002 0.354±0.003 0.396±0.001 0.410±0.002

0.329±0.002 0.378±0.001 0.414±0.002 0.428±0.003

0.295 0.367 0.417 0.433

0.343 0.393 0.427 0.446

0.296 0.369 0.413 0.425

0.345 0.392 0.425 0.444

0.281 0.367 0.394 0.395

0.332 0.385 0.418 0.420

0.298 0.372 0.431 0.450

0.344 0.396 0.439 0.458

0.298 0.378 0.428 0.452

0.347 0.401 0.437 0.460

0.297 0.380 0.428 0.427

0.349 0.400 0.432 0.445

0.302 0.388 0.426 0.431

0.348 0.400 0.433 0.446

0.333 0.477 0.594 0.831

0.387 0.476 0.541 0.657

Avg

0.360±0.002

0.387±0.002

0.378

0.402

0.376

0.402

0.359

0.389

0.388

0.409

0.389

0.411

0.383

0.407

0.387

0.407

0.559

0.515

96 192 336 720

0.307±0.001 0.356±0.002 0.391±0.003 0.452±0.002

0.345±0.002 0.375±0.001 0.399±0.002 0.437±0.003

0.311 0.356 0.390 0.452

0.353 0.378 0.401 0.440

0.319 0.359 0.391 0.470

0.358 0.381 0.404 0.436

0.318 0.360 0.393 0.449

0.355 0.379 0.402 0.440

0.319 0.360 0.389 0.447

0.360 0.381 0.403 0.441

0.318 0.362 0.393 0.460

0.356 0.381 0.404 0.442

0.334 0.377 0.426 0.491

0.368 0.391 0.420 0.459

0.329 0.367 0.399 0.454

0.367 0.385 0.410 0.439

0.345 0.380 0.413 0.474

0.372 0.389 0.413 0.453

Avg

0.377±0.002

0.389±0.002

0.377

0.393

0.385

0.395

0.380

0.394

0.379

0.396

0.383

0.396

0.407

0.410

0.387

0.400

0.403

0.407

96 192 336 720

0.168±0.001 0.233±0.002 0.289±0.003 0.384±0.002

0.247±0.002 0.291±0.001 0.326±0.002 0.385±0.003

0.173 0.238 0.301 0.397

0.256 0.298 0.340 0.396

0.181 0.243 0.306 0.407

0.267 0.306 0.346 0.399

0.171 0.235 0.307 0.403

0.254 0.302 0.338 0.395

0.163 0.229 0.284 0.389

0.246 0.290 0.327 0.391

0.178 0.243 0.305 0.393

0.261 0.303 0.344 0.397

0.180 0.250 0.311 0.412

0.264 0.309 0.348 0.407

0.175 0.241 0.305 0.402

0.259 0.302 0.343 0.400

0.193 0.284 0.369 0.554

0.292 0.362 0.427 0.522

Avg

0.269±0.002

0.312±0.002

0.277

0.323

0.284

0.329

0.279

0.322

0.266

0.314

0.280

0.326

0.288

0.332

0.281

0.326

0.350

0.401

96 192 336 720

0.132±0.001 0.150±0.002 0.170±0.001 0.184±0.002

0.225±0.001 0.242±0.001 0.264±0.002 0.278±0.001

0.134 0.154 0.169 0.201

0.229 0.247 0.264 0.294

0.161 0.172 0.190 0.231

0.252 0.261 0.279 0.313

0.141 0.157 0.174 0.209

0.238 0.251 0.268 0.303

0.136 0.152 0.170 0.212

0.229 0.244 0.264 0.299

0.149 0.165 0.176 0.204

0.245 0.260 0.271 0.296

0.148 0.162 0.178 0.225

0.240 0.253 0.269 0.317

0.181 0.188 0.204 0.246

0.270 0.274 0.293 0.324

0.197 0.196 0.209 0.245

0.282 0.285 0.301 0.333

Avg

0.159±0.002

0.252±0.001

0.164

0.259

0.189

0.276

0.170

0.265

0.168

0.259

0.174

0.268

0.178

0.270

0.205

0.290

0.212

0.300

96 192 336 720

0.187±0.002 0.221±0.001 0.234±0.002 0.244±0.001

0.215±0.001 0.249±0.002 0.262±0.001 0.271±0.002

0.173 0.199 0.211 0.209

0.233 0.257 0.263 0.270

0.216 0.247 0.268 0.268

0.258 0.280 0.294 0.290

0.197 0.222 0.245 0.247

0.236 0.268 0.271 0.287

0.190 0.210 0.217 0.223

0.247 0.266 0.266 0.266

0.186 0.231 0.234 0.238

0.232 0.264 0.263 0.265

0.203 0.233 0.248 0.249

0.237 0.261 0.273 0.275

0.234 0.267 0.290 0.289

0.286 0.310 0.315 0.317

0.290 0.320 0.353 0.356

0.378 0.398 0.415 0.413

Avg

0.222±0.002

0.249±0.002

0.198

0.256

0.250

0.281

0.228

0.266

0.210

0.261

0.222

0.256

0.233

0.262

0.270

0.307

0.330

0.401

96 192 336 720

0.411±0.002 0.429±0.001 0.459±0.003 0.480±0.002

0.267±0.001 0.276±0.002 0.286±0.001 0.304±0.002

0.413 0.432 0.450 0.486

0.261 0.271 0.277 0.295

0.471 0.480 0.496 0.531

0.295 0.300 0.306 0.328

0.420 0.434 0.468 0.487

0.288 0.298 0.301 0.309

0.458 0.457 0.470 0.502

0.296 0.294 0.299 0.314

0.450 0.489 0.484 0.517

0.295 0.311 0.321 0.333

0.395 0.417 0.433 0.467

0.268 0.276 0.283 0.302

0.462 0.466 0.482 0.514

0.290 0.290 0.300 0.320

0.650 0.598 0.605 0.645

0.396 0.370 0.373 0.394

Avg

0.445±0.002

0.283±0.002

0.445

0.276

0.494

0.307

0.452

0.299

0.472

0.301

0.485

0.315

0.428

0.282

0.481

0.300

0.625

0.383

96 192 336 720

0.148±0.001 0.200±0.002 0.256±0.001 0.336±0.002

0.189±0.001 0.241±0.001 0.284±0.002 0.339±0.001

0.157 0.206 0.262 0.344

0.200 0.245 0.287 0.342

0.167 0.215 0.270 0.346

0.214 0.255 0.294 0.344

0.156 0.203 0.250 0.338

0.204 0.245 0.284 0.337

0.158 0.207 0.262 0.344

0.203 0.247 0.289 0.344

0.165 0.212 0.267 0.344

0.210 0.253 0.293 0.342

0.174 0.221 0.278 0.358

0.214 0.254 0.296 0.349

0.177 0.225 0.278 0.354

0.210 0.250 0.290 0.340

0.196 0.237 0.283 0.345

0.255 0.296 0.335 0.381

Avg

0.235±0.002

0.263±0.001

0.242

0.269

0.250

0.277

0.237

0.268

0.243

0.271

0.247

0.275

0.258

0.278

0.259

0.273

0.265

0.317

Dataset / H

Alias

Variant

Length

Channels

Syn-S Syn-A Syn-P Syn-C

Stationary Amplitude mod. Phase drift Combined

12000 12000 12000 12000

16 16 16 16

AOSN ET (Ours) MSE MAE NMAE

TQNet MSE MAE NMAE

CycleNet MSE MAE NMAE

iTransformer MSE MAE NMAE

IaaS

TABLE IV S YNTHETIC DATASET SPECIFICATIONS . A LL VARIANTS SHARE THE SAME GENERATION FRAMEWORK BUT DIFFER IN WHICH OSCILLATORY- STATE COMPONENT VARIES OVER TIME .

96 192 336 720 Avg

0.754 0.723 0.726 0.805 0.752

0.596 0.583 0.577 0.608 0.591

0.748 0.716 0.701 0.714 0.720

0.754 0.740 0.746 0.848 0.772

0.602 0.588 0.592 0.630 0.603

0.756 0.722 0.719 0.741 0.735

0.756 0.754 0.743 0.906 0.790

0.604 0.591 0.587 0.660 0.610

0.759 0.725 0.714 0.775 0.743

0.905 0.799 0.810 1.025 0.885

0.684 0.621 0.627 0.718 0.662

0.859 0.763 0.762 0.843 0.807

PaaS

TABLE III W ORKLOAD FORECASTING RESULTS FOR ALL PREDICTION HORIZONS WITH FIXED LOOK - BACK L = 96. L OWER IS BETTER . B EST RESULTS ARE IN BOLD , SECOND BEST ARE UNDERLINED .

96 192 336 720 Avg

0.076 0.139 0.136 0.141 0.123

0.144 0.170 0.180 0.221 0.178

0.186 0.181 0.195 0.240 0.201

0.062 0.149 0.148 0.136 0.124

0.138 0.179 0.194 0.223 0.183

0.180 0.192 0.209 0.242 0.206

0.074 0.145 0.136 0.166 0.130

0.142 0.178 0.173 0.255 0.187

0.185 0.191 0.187 0.278 0.210

0.196 0.346 0.351 0.455 0.337

0.272 0.341 0.340 0.420 0.343

0.354 0.365 0.368 0.457 0.386

direct experimental evidence for this claim using controlled synthetic datasets where the oscillatory-state dynamics are

Non-stationary component None (constant A, ϕ, P ) Envelope Ac (t) varies smoothly Phase ∆ϕc (t) drifts + random walk Ac (t), ∆ϕc (t), and Pc (t) all vary

known by construction. 1) Setup: Table IV summarizes the four controlled datasets (base period P0 =24, 16 channels, length 12,000). Syn-S is stationary; Syn-A, Syn-P, and Syn-C isolate amplitude modulation, phase drift, and combined variation, respectively. We

0.19 0.18

0.27

0.16 SSformer

0.15 0.14

2M FLOPs 10M FLOPs 18M FLOPs

0.26

SRSNet

MAE

MSE

0.17

0.28

PatchTST

1M params 5M params 9M params

0.23

0.13 101

PatchTST

0.25 0.24

TQNet AOSNet

SRSNet

SSformer TQNet AOSNet

0.22

102

101

Training Time (s/epoch)

102

Inference Time (ms/batch)

Fig. 4. Efficiency comparison on Electricity (look-back 96, horizon 96, batch size 32). Left: MSE vs. training time per epoch (bubble ∝ parameters). Right: MAE vs. inference time per batch (bubble ∝ FLOPs). AOSN ET achieves the best accuracy with the fastest inference speed (9.15 ms/batch) and moderate model size (1.45M params).

compare AOSN ET with CycleNet and TQNet under period settings P ∈ {12, 24, 36, 48}. The detailed generation procedure is described below. For channel c and time index t, we define a base period P0 = 24 and construct a time-varying amplitude Ac (t), phase perturbation ∆ϕc (t), and local period Pc (t). The instantaneous angular frequency is ωc (t) =

2π , Pc (t)

(25)

and the phase is accumulated as ϕc (t) = ϕc,0 +

t X

ωc (τ ) + ∆ϕc (t),

(26)

τ =1

where ϕc,0 is a channel-specific random phase. The observed value is  xc (t) = sc Ac (t) sin ϕc (t)  + ρc Ac (t) sin(2ϕc (t) + ψc ) + rc (t) + ϵc (t), (27) where sc is a channel scale, ρc controls a second harmonic, rc (t) is a weak trend and shared low-frequency component, and ϵc (t) is Gaussian noise. The synthetic variants differ only in which oscillatory-state component is allowed to vary: • Stationary cycle: Ac (t) = 1, ∆ϕc (t) = 0, and Pc (t) = P0 . • Amplitude modulation: Ac (t) varies smoothly while phase and period remain stable. • Phase drift: ∆ϕc (t) varies smoothly and includes a small random-walk component. • Local-frequency variation: Pc (t) varies smoothly around P0 . • Combined non-stationary oscillation: amplitude, phase, and local period all vary simultaneously. The experiments in Table V use sequences of length 12000 with 16 channels. We train AOSN ET and TQNet using the same look-back length L = 96 and horizon H = 96.

TQNet is evaluated with period choices {12, 24, 36, 48}, while AOSN ET does not use a manually specified period. 2) Results: Table V reveals a clear pattern. On the stationary baseline (Syn-S), AOSN ET already achieves the best MSE, confirming that oscillatory-state alignment does not hurt when templates happen to be sufficient. As non-stationarity increases—from pure amplitude modulation (Syn-A), to phase drift (Syn-P), to the combined setting (Syn-C)—AOSN ET’s advantage over both CycleNet and TQNet grows consistently. Notably, CycleNet’s performance is largely insensitive to the period setting, indicating that its failure stems from the template assumption itself rather than period misspecification alone. TQNet’s attention-based template is more expressive, yet still degrades under phase drift (MSE changes from 0.019 at P =24 to 0.022 at P =36), whereas AOSN ET requires no period specification. 3) Stratified Analysis: To further quantify this trend, we partition the test set into five quantile bins by per-sample non-stationarity score. Fig. 6 shows that CycleNet’s error remains ∼2× that of AOSN ET regardless of severity on SynA, while TQNet’s ratio increases monotonically from Q1 to Q5. This provides direct evidence that adaptive oscillatorystate alignment becomes increasingly advantageous as the local oscillatory state deviates further from a fixed template. D. Oscillatory-State Alignment Analysis We now examine the internal mechanism of AOSN ET to verify that the model genuinely operates through oscillatorystate alignment rather than simply adding signal-processing features. 1) The Prior is Not a Fixed Template: Fig. 7 visualizes representative prior traces from the trained Electricity model. The curves exhibit oscillatory behavior—expected because the prior is optimized to provide meaningful amplitude, phase, and frequency references—but are not rigidly periodic: their amplitudes are uneven and local shapes vary. Fig. 8 further shows multiple spectral peaks, confirming that the prior stores a mixture of oscillatory scales rather than a single repeated cycle. This directly validates our design choice: the global

Combined non-stationary

Phase drift

Amplitude modulation

Stationary cycle

Observed signal

Hilbert envelope

Phase residual

2

2

2

1

1

1

0

0

0

1

1

1

2

2

2

2

2

2

1

1

1

0

0

0

1

1

1

2

2

2

2

2

2

1

1

1

0

0

0

1

1

1

2

2

2

2

2

2

1

1

1

0

0

0

1

1

1

2

2

2

0

50 100 150 200 250 300 350

Time step

0

50 100 150 200 250 300 350

0.4 0.2 0.0 0.6 0.4 0.2 0.0 0.6 0.4 0.2 0.0 0.6 0.4 0.2 0.0 0

Time step

Instantaneous frequency 0.6

50 100 150 200 250 300 350

Time step

0

50 100 150 200 250 300 350

Time step

Fig. 5. Controlled synthetic variants and their Hilbert-domain characterization. Each row shows a representative signal, its envelope, phase residual relative to the base period, and instantaneous frequency. These descriptors directly correspond to the three failure modes: amplitude modulation changes the envelope, phase drift shifts the phase residual, and local-frequency variation alters the instantaneous frequency. TABLE V C ONTROLLED SYNTHETIC RESULTS ( LOOK - BACK 96, HORIZONS 96 AND 192). AOSN ET REQUIRES NO PERIOD SPECIFICATION AND CONSISTENTLY OUTPERFORMS FIXED - TEMPLATE BASELINES , WITH GROWING ADVANTAGE AS NON - STATIONARITY INCREASES FROM S YN -S TO S YN -C. CycleNet P =12

CycleNet P =24

CycleNet P =36

CycleNet P =48

TQNet P =12

TQNet P =24

TQNet P =36

TQNet P =48

Variant

H

MSE

MAE

MSE

MAE

MSE

MAE

MSE

MAE

MSE

MAE

MSE

MAE

MSE

MAE

MSE

MAE

MSE

MAE

Syn-S

96 192

0.013 0.012

0.089±0.001 0.089±0.002

0.021±0.001 0.026±0.001

0.115 0.127

0.021 0.025

0.115 0.126

0.022 0.025

0.116 0.125

0.021 0.026

0.115 0.127

0.014 0.014

0.095 0.094

0.015 0.014

0.098 0.094

0.017 0.014

0.102 0.094

0.015 0.014

0.098 0.093

Syn-A

96 192

0.023 0.024

0.115±0.001 0.116±0.002

0.055±0.001 0.061±0.001

0.178 0.191

0.055 0.056

0.177 0.184

0.057 0.060

0.180 0.189

0.056 0.060

0.179 0.190

0.028 0.025

0.129 0.122

0.028 0.026

0.127 0.125

0.029 0.025

0.129 0.122

0.028 0.028

0.128 0.130

Syn-P

96 192

0.017 0.016

0.104±0.001 0.100±0.002

0.032±0.001 0.036±0.001

0.142 0.154

0.032 0.038

0.142 0.156

0.033 0.036

0.145 0.154

0.032 0.038

0.142 0.156

0.021 0.018

0.114 0.106

0.019 0.020

0.109 0.111

0.022 0.018

0.116 0.106

0.019 0.019

0.110 0.111

Syn-C

96 192

0.661 0.746

0.617±0.001 0.669±0.002

0.737±0.001 0.817±0.001

0.663 0.709

0.736 0.821

0.663 0.711

0.735 0.818

0.662 0.710

0.738 0.823

0.664 0.711

0.671 0.774

0.621 0.682

0.673 0.767

0.621 0.678

0.668 0.771

0.619 0.681

0.666 0.777

0.618 0.682

AOSN ET

oscillatory prior serves as a flexible reference that is adaptively interpreted through local state descriptors, not as a fixed periodic template to be retrieved by period indexing. 2) The Gate Operates in Oscillatory-State Space: Fig. 9 shows that the adaptive gate mainly responds to observed instantaneous frequency, phase, and amplitude descriptors, while prior descriptors provide the reference state. The gate thus performs state comparison in the Hilbert domain rather than simply copying the prior. The learned fusion coefficient is λ=0.100, meaning ∼90% of prediction mass comes from the base projection of the aligned sequence—indicating that oscillatory-state alignment makes the temporal signal itself more predictable, rather than relying on the prior as a direct forecast.

3) Oscillatory States Structure Cross-Variate Attention: Fig. 10 shows that the cross-variate MHA preferentially attends to channels with stronger learned oscillatory priors. Combined with the ASR analysis (Table VI), this demonstrates that per-channel oscillatory-state alignment produces structurally refined representations that enable the downstream attention to discover meaningful cross-variate dependencies. 4) Cross-Variate Dependency Analysis: To quantify how oscillatory-state alignment structures cross-variate representations, we compute the Attention Structure Ratio (ASR):

ASR =

Āintra , Āinter

(28)

Syn-A (Amplitude Modulation)

MSE Ratio (vs. AOSNet)

2.2 2.0

Syn-P (Phase Drift)

1.8

CycleNet TQNet AOSNet (ref.)

1.6

1.8 1.6

1.4

1.4

1.2

1.2

Syn-C (Combined)

CycleNet TQNet AOSNet (ref.)

1.10 1.05 1.00 0.95

1.0

1.0 Q1

Q2

Q3

Q4

Q5

Non-stationarity Quantile (Q1=mild, Q5=severe)

CycleNet TQNet AOSNet (ref.)

Q1

Q2

Q3

Q4

0.90

Q5

Non-stationarity Quantile (Q1=mild, Q5=severe)

Q1

Q2

Q3

Q4

Q5

Non-stationarity Quantile (Q1=mild, Q5=severe)

0.5

low var 262 std=0.10

0.0

mid var 265 std=0.20

−0.5

high var 98 std=0.39

−1.0 −1.5

0.25

Norm. weight

Prior value

Fig. 6. Stratified evaluation by non-stationarity severity. Test samples are binned into five quantiles (Q1=mildest, Q5=most severe). The y-axis shows MSE ratio relative to AOSN ET (dashed line at 1.0). TQNet’s disadvantage grows monotonically with severity on Syn-A (from 1.02× to 1.09×), confirming that the advantage of oscillatory-state alignment is amplified under stronger state changes.

0.20 0.15 0.10 0.05

−2.0

0.00 24

48

72

Time step

95

x

Fig. 7. Learned global oscillatory prior on Electricity. Variables are selected by prior standard deviation (low, median, high oscillation strength). The prior is oscillatory but not rigidly periodic: amplitudes are uneven and local shapes are nonuniform, confirming it functions as a flexible oscillatory reference rather than a fixed repeated template.

T=2.1 T=2.3 T=2.0

Mean power

0.10 0.08 0.06 0.04

am

p p

am

p

s

x

co

x

sin

s

p

co

p

sin

q

x

fre

p

0.015

r = 0.57 ρ = 0.62

0.010 0.005 all top

0.000

0.02

0.10

0.00 0.0

0.1

0.2

0.3

Frequency

0.4

q fre

Fig. 9. Effective descriptor weights in the adaptive gate. The gate primarily responds to observed instantaneous frequency, phase, and amplitude, using the prior descriptors as the reference state for comparison.

Incoming attention

0

0.15

0.20

0.25

0.30

Prior oscillation strength

0.35

0.40

0.5

Fig. 8. Average spectrum of the learned prior. Multiple spectral peaks indicate that the prior captures a mixture of oscillatory scales rather than committing to a single predefined period.

Fig. 10. Relation between prior oscillation strength and incoming channel attention. Variables with stronger oscillatory priors receive more cross-variate attention, suggesting that oscillatory-state alignment creates informative channel representations.

E. Case Study: Same Phase, Different States where Āintra and Āinter denote average attention weights within and between K-Means clusters of channel embeddings. As shown in Table VI, the full model achieves ASR > 1.2 on both datasets, while removing AOS causes ASR to drop below 1.0 on Electricity. This confirms that oscillatory-state alignment is critical for structuring the input so that the MHA can discover cross-variate dependencies.

Fig. 11 provides a case study that crystallizes the conceptual difference between fixed-template periodicity and oscillatorystate alignment. Multiple observed windows in the Syn-C dataset start from the same cycle phase, yet their local oscillatory states—as revealed by envelope, phase residual, and instantaneous frequency—differ substantially. A period-indexed method (CycleNet, TQNet) must assign identical templates to

Same cycle phase, different observed states t=7200 t=7440

One learned template cannot fit all states

3

t=7680 t=7920

2

2

1

1

0

0

-1

-1

-2

-2

TQNet fixed template

Hilbert envelope varies across aligned segments

Phase residual and local frequency drift

3

1.0 3

2

2

Phase residual

Envelope

0.8

0.6

0.4

1

1

0 -1

0

Inst. frequency

Normalized value

3

-2 0.2

-1

-3 0.0

-4 0

20

40

Step in window

60

80

0

20

40

Step in window

60

80

Fig. 11. Failure of fixed-template retrieval on the combined non-stationary dataset. Top-left: windows starting from the same cycle phase exhibit different local shapes. Top-right: TQNet assigns the same template to all phase-aligned windows. Bottom: Hilbert descriptors reveal that envelope, phase residual, and instantaneous frequency all differ across these windows. This demonstrates the fundamental limitation of period-indexed template retrieval: same cycle phase does not imply the same oscillatory state.

TABLE VI ATTENTION S TRUCTURE R ATIO (ASR) WITH AND WITHOUT AOS. ASR > 1 INDICATES STRUCTURED CROSS - VARIATE ATTENTION ; ASR ≤ 1 INDICATES UNIFORM ATTENTION .

TABLE VII A BLATION STUDY ( LOOK - BACK 96, HORIZON 96). ∆% DENOTES RELATIVE MSE DEGRADATION FROM THE FULL MODEL . ETTh1

Electricity (321 ch.)

Weather (21 ch.)

Variant

ASR

Āintra /Āinter

ASR

Āintra /Āinter

AOSN ET (full) w/o AOS

1.208 0.716

0.00342 / 0.00283 0.00257 / 0.00359

1.213 0.971

0.0532 / 0.0439 0.0472 / 0.0486

all phase-aligned windows, because the template is retrieved solely by the period index. In contrast, AOSN ET reads the local oscillatory state of each window and adapts its alignment accordingly. This illustrates the core insight: same cycle phase does not imply same oscillatory state, which is precisely why fixed periodic indexing fails under non-stationary dynamics. Fig. 12 further visualizes representative forecasts. On SynA and Syn-P, the fixed-template baselines produce periodic predictions that diverge when the local state deviates from the training-set average, whereas AOSN ET adapts its forecast to the instantaneous oscillatory state. F. Ablation and Sensitivity 1) Ablation: Table VII validates the contribution of each component. The AOS module is consistently beneficial (+3.3% to +14.2%), with the largest gains on datasets with complex oscillatory dynamics (Weather +14.2%, Electricity +9.8%). The global oscillatory prior shows a similar pattern

Variant

ETTm1

Electricity

Weather

MSE MAE ∆% MSE MAE ∆% MSE MAE ∆%

AOSN ET (full) 0.368 0.392

0.307 0.345

0.132 0.225

MSE MAE ∆% 0.148 0.189

w/o AOS w/o Prior w/o MHA w/o Fusion

0.380 0.398 +3.3 0.319 0.353 +3.9 0.145 0.234 +9.8 0.169 0.206 +14.2 0.375 0.393 +1.9 0.321 0.355 +4.6 0.145 0.234 +9.8 0.171 0.208 +15.5 0.365 0.390 −0.8 0.315 0.350 +2.6 0.150 0.238 +13.6 0.162 0.202 +9.5 0.380 0.389 +3.3 0.327 0.358 +6.5 0.180 0.265 +36.4 0.165 0.208 +11.5

w/o Amp w/o Phase w/o IF

0.370 0.393 +0.5 0.316 0.348 +2.9 0.133 0.227 +1.5 0.153 0.195 +3.4 0.371 0.393 +0.8 0.313 0.348 +2.0 0.135 0.228 +2.3 0.149 0.190 +0.5 0.369 0.390 +0.3 0.315 0.350 +2.6 0.134 0.228 +1.5 0.149 0.192 +0.5

(+15.5% on Weather), confirming that the learned reference provides meaningful oscillatory-state information. Dualpath fusion is critical on high-dimensional data (Electricity +36.4%), while cross-variate MHA is indispensable on multichannel datasets (+13.6% on Electricity) but neutral on the 7-channel ETTh1. Among the three analytic-signal descriptors, all contribute complementarily, with log-amplitude most impactful on Weather (+3.4%). 2) Sensitivity: Fig. 13 shows that AOSN ET is robust to both model dimension and kernel size, with performance remaining nearly flat across the full tested range. Even reducing dmodel to 128 (4× fewer parameters) incurs at most ∼1% MSE increase, making the model suitable for resource-constrained deployment. Fig. 14 further shows that AOSN ET achieves the best MSE at every tested look-back length (96–720) on Electricity. All methods improve with longer windows as

Ground Truth

Stationary

Amplitude Modulation

AOSNet

0

0

1

1

2

2

3

CycleNet

0

0

1

1

2

2

3 1

1

0

0

1

1

2

2 25

50

75

100

Time step

125

150

3

175

Combined 2 1 0 1 2

1.5 1.0 0.5 0.0 0.5 1.0 1.5 2.0

1

1

TQNet

Phase Drift 1.5 1.0 0.5 0.0 0.5 1.0 1.5 2.0

1

1

0

Prediction

0

25

50

75

100

Time step

125

150

175

1.5 1.0 0.5 0.0 0.5 1.0 1.5 2.0

2 1 0 1 2 2 1 0 1 2 0

25

50

75

100

Time step

125

150

175

0

25

50

75

100

Time step

125

150

175

Fig. 12. Prediction visualization on four synthetic datasets (look-back 96, horizon 96). AOSN ET tracks envelope changes (Syn-A), phase shifts (Syn-P), and their combination (Syn-C), while CycleNet and TQNet produce rigidly periodic predictions that fail to adapt to evolving oscillatory states. (a) dmodel Sensitivity

(b) Hidden Kernel Sensitivity ETTh1 ETTh2 ETTm1 ETTm2

MSE

0.35 0.30

0.30

0.25

0.25

0.20

0.20 128

256

384

dmodel

512

ETTh1 ETTh2 ETTm1 ETTm2

0.35

768

3

5

7

Hidden Kernel Size

9

11

Fig. 13. Parameter sensitivity on four ETT datasets (horizon 96). (a) Varying dmodel ∈ {128, 256, 384, 512, 768} with kernel fixed at 5. (b) Varying kernel size ∈ {3, 5, 7, 9, 11} with dmodel =512. Performance remains within ±5% across all settings.

(a) MSE vs. Look-back Length 0.20

0.16

AOSNet TQNet iTransformer PatchTST DLinear

0.28 MAE

0.18 MSE

(b) MAE vs. Look-back Length 0.30

AOSNet TQNet iTransformer PatchTST DLinear

0.26 0.24

0.14

0.22 96

192

336

Look-back Length

512

720

96

192

336

Look-back Length

512

720

Fig. 14. Look-back length sensitivity on Electricity (horizon 96). All methods benefit from longer look-back windows, as expected. AOSN ET achieves the lowest MSE at every tested length and already performs strongly at L=96, whereas PatchTST and DLinear require substantially longer windows to become competitive.

expected; AOSN ET already performs strongly at the shortest setting (L=96), while PatchTST and DLinear require L≥336 to approach comparable accuracy.

VI. C ONCLUSION AND L IMITATIONS We presented AOSN ET, a Hilbert-guided forecasting model that reformulates explicit periodic modeling from fixed template matching to adaptive oscillatory-state alignment. Instead of requiring a predefined period or a globally stable repeated pattern, AOSN ET extracts envelope, phase, and instantaneousfrequency descriptors from both the observed sequence and a learnable global temporal prior. A lightweight adaptive gate then uses these local descriptors to decide where the observation should be preserved and where it should be softly corrected toward the learned reference. Controlled experiments show that this design is especially useful when amplitude, phase, or local frequency changes over time, and model analysis suggests that the learned prior acts as an oscillatory reference rather than a hard periodic template. Limitations and Future Work.: The current study focuses on point forecasting with a compact backbone, so the benefit of adaptive oscillatory states has not yet been fully explored in larger Transformer-style architectures or probabilistic forecasting settings. The Hilbert descriptors are computed along fixed look-back windows, which may be less suitable when useful oscillatory structure appears at multiple resolutions or across irregularly sampled observations. In addition, the global temporal prior is shared across samples; while this provides a simple dataset-level reference, future work could make the prior conditional on covariates, regimes, or clusterlevel temporal states. Finally, the current experiments emphasize standard benchmarks and controlled non-stationary oscillations. A broader evaluation on domain-specific datasets with abrupt regime changes, missing values, and exogenous events would further clarify when adaptive oscillatory-state alignment is most beneficial.

R EFERENCES [1] Q. Wen, T. Zhou, C. Zhang, W. Chen, Z. Ma, J. Yan, and L. Sun, “Transformers in Time Series: A Survey,” arXiv preprint arXiv:2202.07125, 2022. [2] X. Qiu, J. Hu, L. Zhou, X. Wu, J. Du, B. Zhang, C. Guo, A. Zhou, C. S. Jensen, Z. Sheng, and B. Yang, “TFB: Towards Comprehensive and Fair Benchmarking of Time Series Forecasting Methods,” in International Conference on Very Large Data Bases (VLDB), Guangzhou, China, Aug. 26-30, 2024. [3] Z. Shao, F. Wang, Y. Xu, W. Wei, C. Yu, Z. Zhang, D. Yao, T. Sun, G. Jin, X. Cao, G. Cong, C. S. Jensen, and X. Cheng, “Exploring Progress in Multivariate Time Series Forecasting: Comprehensive Benchmarking and Heterogeneity Analysis,” IEEE Transactions on Knowledge and Data Engineering, vol. 37, pp. 291–305, Jan. 2025. [4] Q. Guo, B. Zhao, M. Song, and G. Zhong, “A Survey of Deep Learning for Time Series Forecasting: Taxonomy, Analysis and Future Directions,” IEEE Transactions on Knowledge and Data Engineering, pp. 1–20, 2026. [5] H. Zhou, S. Zhang, J. Peng, S. Zhang, J. Li, H. Xiong, and W. Zhang, “Informer: Beyond Efficient Transformer for Long Sequence TimeSeries Forecasting,” in Proceedings of The AAAI Conference on Artificial Intelligence, Virtual Event, Feb. 2-9, 2021. [6] A. Zeng, M. Chen, L. Zhang, and Q. Xu, “Are Transformers Effective for Time Series Forecasting?” in Proceedings of The AAAI Conference on Artificial Intelligence, Washington, DC, USA, Feb. 7-14, 2023. [7] X. Zhang, Z. Huang, Y. Wu, X. Lu, E. Qi, Y. Chen, Z. Xue, Q. Wang, P. Wang, and W. Wang, “Multi-Period Learning for Financial Time Series Forecasting,” in Proceedings of The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Toronto, ON, Canada, Aug. 3-7, Jul. 2025, pp. 2848–2859. [Online]. Available: http://arxiv.org/abs/2511.08622 [8] L. Chen, X. Zhong, F. Zhang, Y. Cheng, Y. Xu, Y. Qi, and H. Li, “FuXi: A Cascade Machine Learning Forecasting System for 15-Day Global Weather Forecast,” npj Climate and Atmospheric Science, vol. 6, no. 1, p. 190, Nov. 2023. [9] H. Wu, J. Xu, J. Wang, and M. Long, “Autoformer: Decomposition Transformers with Auto-Correlation for Long-Term Series Forecasting,” in Annual Conference on Neural Information Processing Systems (NeurIPS), Virtual, Dec. 6-14, 2021. [10] Y. Nie, N. H. Nguyen, P. Sinthong, and J. Kalagnanam, “A Time Series Is Worth 64 Words: Long-Term Forecasting with Transformers,” in International Conference on Learning Representations (ICLR), Kigali, Rwanda, May 1-5, 2023. [11] Y. Liu, T. Hu, H. Zhang, H. Wu, S. Wang, L. Ma, and M. Long, “iTransformer: Inverted Transformers Are Effective for Time Series Forecasting,” in International Conference on Learning Representations (ICLR), Vienna, Austria, May 7-11, 2024. [12] W. Ye, S. Deng, Q. Zou, and N. Gui, “Frequency Adaptive Normalization for Non-Stationary Time Series Forecasting,” in Annual Conference on Neural Information Processing Systems (NeurIPS), Vancouver, BC, Canada, Dec. 10 - 15, 2024. [13] P. Liu, B. Wu, Y. Hu, N. Li, T. Dai, J. Bao, and S.-T. Xia, “TimeBridge: Non-Stationarity Matters for Long-Term Time Series Forecasting,” in International Conference on Machine Learning (ICML), Vancouver, Canada, Jul. 13-19, 2025. [14] Z. Song, X. Zhang, L. Zhuang, T. Guo, X. Zhao, Y. Xu, and S. Jin, “Diffusion-based spatio-temporal channel prediction via non-stationarity decoupling,” IEEE Transactions on Cognitive Communications and Networking, vol. 12, pp. 7647–7661, 2026. [15] S. Lin, W. Lin, X. Hu, W. Wu, R. Mo, and H. Zhong, “CycleNet: Enhancing Time Series Forecasting through Modeling Periodic Patterns,” in Annual Conference on Neural Information Processing Systems (NeurIPS), Vancouver, Canada, Dec. 9-15, 2024. [16] S. Lin, H. Chen, H. Wu, C. Qiu, and W. Lin, “Temporal Query Network for Efficient Multivariate Time Series Forecasting,” in International Conference on Machine Learning (ICML), ser. Proceedings of Machine Learning Research, vol. 267. BC, Canada, Jul. 13-19: PMLR / OpenReview.net, 2025. [Online]. Available: https://proceedings.mlr.press/v267/lin25e.html [17] T. Zhou, Z. Ma, Q. Wen, L. Sun, T. Yao, W. Yin, R. Jin et al., “FILM: Frequency Improved Legendre Memory Model for Long-Term Time Series Forecasting,” in Annual Conference on Neural Information Processing Systems (NeurIPS), LA, USA, Nov. 28-Dec. 9, 2022.

[18] H. Wang, L. Pan, Y. Shen, Z. Chen, D. Yang, Y. Yang, S. Zhang, X. Liu, H. Li, and D. Tao, “FreDF: Learning to Forecast in The Frequency Domain,” in International Conference on Learning Representations (ICLR), Singapore, Apr. 24-28, 2025. [Online]. Available: https://openreview.net/forum?id=4A9IdSa1ul [19] J. Fei, K. Yi, W. Fan, Q. Zhang, and Z. Niu, “Amplifier: Bringing Attention to Neglected Low-Energy Components in Time Series Forecasting,” in Proceedings of The AAAI Conference on Artificial Intelligence, Philadelphia, PA, USA, Feb. 25 - Mar. 4, 2025. [Online]. Available: https://doi.org/10.1609/aaai.v39i11.33267 [20] S. Wang, H. Wu, X. Shi, T. Hu, H. Luo, L. Ma, J. Y. Zhang, and J. Zhou, “TimeMixer: Decomposable Multiscale Mixing for Time Series Forecasting,” in International Conference on Learning Representations (ICLR), Vienna, Austria, May 7-11, 2024. [21] G. Yu, J. Zou, X. Hu, A. I. Aviles-Rivero, J. Qin, and S. Wang, “Revitalizing Multivariate Time Series Forecasting: Learnable Decomposition with Inter-Series Dependencies and Intra-Series Variations Modeling,” in International Conference on Machine Learning (ICML), Vienna, Austria, Jul. 21-27, 2024. [22] J. Deng, F. Ye, D. Yin, X. Song, I. Tsang, and H. Xiong, “Parsimony or Capability? Decomposition Delivers Both in Long-Term Time Series Forecasting,” in Annual Conference on Neural Information Processing Systems (NeurIPS), Vancouver, Canada, Dec. 9-15, 2024. [23] D. Gabor, “Theory of Communication,” Journal of the Institution of Electrical Engineers, vol. 93, no. 26, pp. 429–457, 1946. [24] B. Boashash, “Estimating and Interpreting the Instantaneous Frequency of a Signal. I. Fundamentals,” Proceedings of the IEEE, vol. 80, no. 4, pp. 520–568, 1992. [25] T. Zhou, Z. Ma, Q. Wen, X. Wang, L. Sun, and R. Jin, “FEDFOrmer: Frequency Enhanced Decomposed Transformer for Long-Term Series Forecasting,” in International Conference on Machine Learning (ICML),, Baltimore, MD, Jul. 17-23, 2022. [26] H. Wang, J. Peng, F. Huang, J. Wang, J. Chen, and Y. Xiao, “MICN: Multi-Scale Local and Global Context Modeling for Long-Term Series Forecasting,” in International Conference on Learning Representations (ICLR), Kigali, Rwanda, May 1-5, 2023. [27] S. Lin, W. Lin, W. Wu, H. Chen, and J. Yang, “SparseTSF: Modeling Long-Term Time Series Forecasting with *1k* Parameters,” in International Conference on Machine Learning (ICML), ser. Proceedings of Machine Learning Research, vol. 235. Vienna, Austria, Jul. 21-27: PMLR / OpenReview.net, 2024, pp. 30 211–30 226. [Online]. Available: https://proceedings.mlr.press/v235/lin24n.html [28] J. Ma, B. Wang, Q. Huang, G. Wang, P. Wang, Z. Zhou, and Y. Wang, “MoFo: Empowering Long-Term Time Series Forecasting with Periodic Pattern Modeling,” in Annual Conference on Neural Information Processing Systems (NeurIPS), San Diego, CA, USA, Dec. 2-7, 2026. [Online]. Available: https://openreview.net/forum?id=sbvLts2HqR [29] Z. Xu, A. Zeng, and Q. Xu, “FITS: Modeling Time Series with 10K Parameters,” in International Conference on Learning Representations (ICLR), Vienna, Austria, May 7-11, 2024. [30] A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention Is All You Need,” in Annual Conference on Neural Information Processing Systems (NeurIPS), Long Beach, California, USA, Dec. 4-9, 2017. [31] Z. Song, N. Jiang, M. He, X. Zhao, and T. Guo, “Channel, Trend and Periodic-Wise Representation Learning for Multivariate Long-Term Time Series Forecasting,” in International Conference on Acoustics, Speech and Signal Processing (ICASSP). Barcelona, Spain, May 48: IEEE, 2026, pp. 4821–4825. [32] L. Han, H.-J. Ye, and D.-C. Zhan, “The Capacity and Robustness Trade-Off: Revisiting The Channel Independent Strategy for Multivariate Time Series Forecasting,” IEEE Transactions on Knowledge and Data Engineering, 2024. [33] Y. Zhang and J. Yan, “Crossformer: Transformer Utilizing CrossDimension Dependency for Multivariate Time Series Forecasting,” in International Conference on Learning Representations (ICLR). Kigali, Rwanda, May 1-5: OpenReview.net, 2023. [Online]. Available: https://openreview.net/forum?id=vSVLM2j9eie [34] Q. Huang, L. Shen, R. Zhang, J. Cheng, S. Ding, Z. Zhou, and Y. Wang, “HDMixer: Hierarchical Dependency with Extendable Patch for Multivariate Time Series Forecasting,” in Proceedings of The AAAI Conference on Artificial Intelligence, Vancouver, Canada, Feb. 20-27, 2024.

[35] R. Ilbert, A. Odonnat, V. Feofanov, A. Virmaux, G. Paolo, T. Palpanas, and I. Redko, “SAMformer: Unlocking The Potential of Transformers in Time Series Forecasting with Sharpness-Aware Minimization and Channel-Wise Attention,” in International Conference on Machine Learning (ICML), vol. 235. Vienna, Austria, Jul. 21-27: PMLR, 2024. [Online]. Available: https://proceedings.mlr.press/v235/ilbert24a.html [36] E. O. Brigham and R. E. Morrow, “The Fast Fourier Transform,” IEEE Spectrum, 1967. [37] D. Hendrycks and K. Gimpel, “Gaussian Error Linear Units (GELUs),” arXiv preprint arXiv:1606.08415, 2016. [38] N. Srivastava, G. Hinton, A. Krizhevsky, I. Sutskever, and R. Salakhutdinov, “Dropout: A Simple Way to Prevent Neural Networks from Overfitting,” Journal of Machine Learning Research, vol. 15, no. 56, pp. 1929–1958, 2014.

[39] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga et al., “Pytorch: An Imperative Style, High-Performance Deep Learning Library,” in Annual Conference on Neural Information Processing Systems (NeurIPS), Vancouver, Canada, Dec. 8-14, 2019. [40] X. Wu, X. Qiu, H. Cheng, Z. Li, J. Hu, C. Guo, and B. Yang, “Enhancing Time Series Forecasting through Selective Representation Spaces: A Patch Perspective,” in Annual Conference on Neural Information Processing Systems (NeurIPS), Vancouver, Canada, Dec. 9-14, 2025. [41] Y. Liu, B. Liu, S. Huang, G. Luo, W. Hu, M. Wang, and R. Hong, “Sparse-scale transformer with bidirectional awareness for time series forecasting,” in Proceedings of The AAAI Conference on Artificial Intelligence. Singapore, January 20-27: AAAI Press, 2026, pp. 23 899– 23 907. [Online]. Available: https://doi.org/10.1609/aaai.v40i28.39566

Related documents

Record · ID 259584 · SHA-256 72c3abf8edd2fc90
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.