Metraipolis › archive › dc_aee9d22a98e2

Resolving the Dual-Timescale Forecasting Dilemma in High-Frequency Cyber-Physical Telemetry via Physics-Grounded Dynamic Asymptotic Decomposition — arXiv:2609.31361

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.31361
License (as archived)
CC0-1.0
Archived
2026-10-08T04:19:11.811Z
SHA-256 of the archived text
db0ee0d7ae0fddbdde06f96799b94ee7918acab8b999b969050f32b3594a342e
Stable URL of this page
https://metraipolis.com/documento/dc_aee9d22a98e2

How to cite

Resolving the Dual-Timescale Forecasting Dilemma in High-Frequency Cyber-Physical Telemetry via Physics-Grounded Dynamic Asymptotic Decomposition — arXiv:2609.31361 — arXiv (en), https://arxiv.org/abs/2609.31361 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aee9d22a98e2 (Metraipolis archive dc_aee9d22a98e2, sha256 db0ee0d7ae0fddbdde06f96799b94ee7918acab8b999b969050f32b3594a342e)
BibTeX
@misc{dcaee9d22a98e2,
  title = {Resolving the Dual-Timescale Forecasting Dilemma in High-Frequency Cyber-Physical Telemetry via Physics-Grounded Dynamic Asymptotic Decomposition — arXiv:2609.31361},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.31361},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aee9d22a98e2; sha256 db0ee0d7ae0fddbdde06f96799b94ee7918acab8b999b969050f32b3594a342e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31361. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

High-frequency industrial cyber-physical systems (CPS) stream continuous sensor telemetry at sub-10-second intervals. Multi-horizon forecasting over hours is required for predictive maintenance and operational control. However, deploying machine learning models over extended horizons (H = 2,160 steps at dt = 5 s) encounters the Dual-Timescale Forecasting Dilemma: the trade-off between short-horizon kinetic momentum and long-horizon diurnal thermodynamic equilibrium. Autoregressive rollouts suffer from compounding error drift, while direct multi-output projectors exhibit variance explosion and noise extrapolation. In this work, we prove that autoregressive mutual information decays exponentially toward zero over extended lead times, and that the optimal minimum-variance estimator converges asymptotically to the periodic diurnal baseline (Lemma 1 and Theorem 1). Guided by these bounds, we propose the Dynamic Asymptotic Decomposition (DAD) framework. The architecture couples a continuous sigmoidal authority transition schedule \(\alpha(h)\) with monotonic L2 regularization scaling \(\lambda(h)\), transferring prediction authority from kinetic autoregression to diurnal equilibrium while enforcing physical non-negativity. Evaluated across a 30-day industrial telemetry stream (N = 518,400 steps) over 16 walk-forward test windows, DAD achieves an overall Mean Absolute Error (MAE) of 0.1764, representing a 78.3% error reduction over Deep LSTM (0.8143), 60.2% over PatchTST (0.4431), and 20.8% over DLinear (0.2227). Computational profiling demonstrates edge execution in 0.72 ms with 0.203 MFLOPs and 72k parameters on a single CPU core (over 3400x faster than Transformer baselines), validated by an automated dual-stage CI/CD quality assurance harness and physical fail-safe architecture.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-28 in eess.SP).
Categorie arXiv: Signal Processing (eess.SP).
Pagina del lavoro: https://arxiv.org/abs/2609.31361 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T03:49:53.477Z dalla pagina https://arxiv.org/catchup/eess.SP/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).