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.
Bibtex
@misc{hosseini2024promptingbasedtemporaldomaingeneralization,
title={Prompting-based Temporal Domain Generalization},
author={Sepidehsadat Hosseini and Mengyao Zhai and Hossein Hajimirsadegh and Frederick Tung},
year={2024},
eprint={2310.02473},
archivePrefix={arXiv},
primaryClass={cs.LG},
url={https://arxiv.org/abs/2310.02473},
}
Related Research
-
Can LLMs Access their World Knowledge for Event Prediction?
Can LLMs Access their World Knowledge for Event Prediction?
Z. Wu, Z. Zhang, H. Hajimirsadeghi, N. Dvornik, and A. Pashevich. EMNLP
Publications
-
Jump Start or False Start? A Theoretical and Empirical Evaluation of LLM-initialized Bandits
Jump Start or False Start? A Theoretical and Empirical Evaluation of LLM-initialized Bandits
A. Bailey, X. Zhu, R. Aoki, Y. Cao, and K. Wilson. TMLR
Publications
-
Exploring Model Invariance with Discrete Search for Ultra-Low-Bit Quantization
Exploring Model Invariance with Discrete Search for Ultra-Low-Bit Quantization
Y. Wen, Y. Cao, and L. Mou. CIKM
Publications