Prompting-based Temporal Domain Generalization
Sepidehsadat Hosseini, Mengyao Zhai, Hossein Hajimirsadegh, Frederick Tung
TL;DR
The paper tackles temporal distribution shifts by introducing a prompting-based temporal domain generalization framework that keeps a frozen backbone while learning compact prompts. It decomposes prompts into domain-specific, temporal, and global components, with a temporal prompt generator forecasting future prompts from past domain prompts. The approach shows strong, parameter-efficient generalization across classification, regression, and time-series forecasting, outperforming state-of-the-art temporal DG methods on synthetic and real datasets while reducing training and inference overhead. This enables robust predictions in evolving environments without access to future data during training, with broad applicability to modern transformer-based architectures. The results suggest prompting-based temporal DG as a practical strategy for real-world deployment under non-i.i.d. temporal drift.
Abstract
Machine learning traditionally assumes that the training and testing data are distributed independently and identically. However, in many real-world settings, the data distribution can shift over time, leading to poor generalization of trained models in future time periods. This paper presents a novel prompting-based approach to temporal domain generalization that is parameter-efficient, time-efficient, and does not require access to future data during training. Our method adapts a trained model to temporal drift by learning global prompts, domain-specific prompts, and drift-aware prompts that capture underlying temporal dynamics. Experiments on classification, regression, and time series forecasting tasks demonstrate the generality of the proposed approach. The code repository will be publicly shared.
