Winner-takes-all for Multivariate Probabilistic Time Series Forecasting

Adrien Cortés, Rémi Rehm, Victor Letzelter
6/5/2025
cs.LGcs.AIstat.ML

No official code found. Best implementation: Victorletzelter/timeMCL (63 stars, Apache-2.0, last commit 2025-08-17).

Abstract

We introduce TimeMCL, a method leveraging the Multiple Choice Learning (MCL) paradigm to forecast multiple plausible time series futures. Our approach employs a neural network with multiple heads and utilizes the Winner-Takes-All (WTA) loss to promote diversity among predictions. MCL has recently gained attention due to its simplicity and ability to address ill-posed and ambiguous tasks. We propose an adaptation of this framework for time-series forecasting, presenting it as an efficient method to predict diverse futures, which we relate to its implicit quantization objective. We provide insights into our approach using synthetic data and evaluate it on real-world time series, demonstrating its promising performance at a light computational cost.

View on arXivView PDF

Code Implementations(1)

Apache-2.0

Winner-takes-all for Multivariate Probabilistic Time Series Forecasting

6313Shell, PythonApr 3, 20251 years agoApache-2.0
icml-2025quantizationtime-series-forecastinguncertainty-quantificationwinner-take-all

Similar Papers

Cite this paper

@article{corts2025winnertakesall,
  title  = {Winner-takes-all for Multivariate Probabilistic Time Series Forecasting},
  author = {Adrien Cortés and Rémi Rehm and Victor Letzelter},
  year   = {2025},
  eprint = {2506.05515},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.05515v2},
  journal = {ICML 2025 2025}
}

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/2506.05515.svg)](https://codeofpaper.com/paper/2506.05515)

Discussion