Optimal Transport for Time Series Imputation

Abstract

Missing data imputation through distribution alignment has demonstrated advantages for non-temporal datasets but exhibits suboptimal performance in time-series applications. The primary obstacle is crafting a discrepancy measure that simultaneously (1) captures temporal patterns—accounting for periodicity and temporal dependencies inherent in time-series—and (2) accommodates non-stationarity, ensuring robustness amidst multiple coexisting temporal patterns. In response to these challenges, we introduce the Proximal Spectrum Wasserstein (PSW) discrepancy, a novel discrepancy tailored for comparing two \textit{sets} of time-series based on optimal transport. It incorporates a pairwise spectral distance to encapsulate temporal patterns, and a selective matching regularization to accommodate non-stationarity. Subsequently, we develop the PSW for Imputation (PSW-I) framework, which iteratively refines imputation results by minimizing the PSW discrepancy. Extensive experiments demonstrate that PSW-I effectively accommodates temporal patterns and non-stationarity, outperforming prevailing time-series imputation methods. Code is available at https://github.com/FMLYD/PSW-I.

Cite

Text

Wang et al. "Optimal Transport for Time Series Imputation." International Conference on Learning Representations, 2025.

Markdown

[Wang et al. "Optimal Transport for Time Series Imputation." International Conference on Learning Representations, 2025.](https://mlanthology.org/iclr/2025/wang2025iclr-optimal/)

BibTeX

@inproceedings{wang2025iclr-optimal,
  title     = {{Optimal Transport for Time Series Imputation}},
  author    = {Wang, Hao and Li, Zhengnan and Li, Haoxuan and Chen, Xu and Gong, Mingming and BinChen,  and Chen, Zhichao},
  booktitle = {International Conference on Learning Representations},
  year      = {2025},
  url       = {https://mlanthology.org/iclr/2025/wang2025iclr-optimal/}
}