CAMP: A Cycle-Aware Multi-Scale Patch Mixer for Time Series Forecasting
Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.
Computer Science > Machine Learning
Title:CAMP: A Cycle-Aware Multi-Scale Patch Mixer for Time Series Forecasting
Abstract:Real-world time series are often governed by recurring patterns, but their dominant periods may vary across datasets, forecasting settings, and individual input windows. Existing cycle-aware forecasters commonly rely on a single period selected at the dataset level, which can be restrictive when periodic behavior changes over time or when multiple cycles coexist. Moreover, patch-based models typically process all patch positions uni- formly, although patches farther from the forecast boundary may require broader contextual refinement, while recent patches contain information that should be preserved more directly. Af- ter cyclic behavior is removed, the remaining dynamics may also span multiple temporal resolutions and cannot be adequately de- scribed at a single scale. We introduce CAMP, a Cycle-Aware Multi-Scale Patch Mixer designed to address these challenges. The Adaptive Cycle Learning module identifies dominant fre- quencies separately for each input window and generates both historical and future cyclic components without requiring a pre- defined cycle length. The Horizon-Guided Patch Mixer intro- duces position-dependent refinement, allowing earlier patches to incorporate broader temporal context while preserving infor- mation close to the forecast boundary. CAMP further models the de-cycled residual through temporally aligned multi-resolution representations, enabling complementary dynamics at different scales to be captured within one forecasting framework. Across seven long-term forecasting benchmarks, CAMP achieves the best average MSE on six datasets and the best or tied-best MAE on six. It also obtains the highest MSE win count across sixteen settings on four PEMS traffic benchmarks.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2608.04051 [cs.LG] |
| (or arXiv:2608.04051v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2608.04051
arXiv-issued DOI via DataCite
|
Access Paper:
- View PDF
- HTML (experimental)
- TeX Source
References & Citations
Bibliographic and Citation Tools
Code, Data and Media Associated with this Article
Demos
Recommenders and Search Tools
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
More from arXiv — Machine Learning
-
Learning Discrete Riemannian Metrics for Physical Fields with Cochain-Frame Equivarianc
Aug 18
-
Forward Pass Domain Adaptation (Without Cross-Layer Backpropagation)
Aug 18
-
Coarse-to-Fine Multi-Resolution Diffusion Models for Trajectory Generation in Urban Systems
Aug 18
-
Geometry Is Not Robustness: A Trajectory-Level Study of PGD Evaluation
Aug 18
Discussion (0)
Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.
Sign in →No comments yet. Sign in and be the first to say something.