Prompting-based Temporal Domain Generalization

Sepidehsadat Hosseini, Mengyao Zhai, Hossein Hajimirsadegh, Frederick Tung
10/3/2023
cs.LG

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hosseini2023promptingbased,
  title  = {Prompting-based Temporal Domain Generalization},
  author = {Sepidehsadat Hosseini and Mengyao Zhai and Hossein Hajimirsadegh and Frederick Tung},
  year   = {2023},
  eprint = {2310.02473},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.02473v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.02473.svg)](https://codeofpaper.com/paper/2310.02473)

Discussion