Optimizing the Training Diet: Data Mixture Search for Robust Time Series Forecasting
Federico Pennino, Maurizio Gabbrielli

TL;DR
This paper introduces a data mixture search framework that optimizes training data composition for time series models, leading to improved performance by selecting the most informative data subsets rather than using all available data.
Contribution
It presents a novel data-centric approach using clustering and Bayesian optimization to discover optimal training data mixtures for time series forecasting.
Findings
Optimized data mixtures outperform full dataset training.
Achieved 19.41% reduction in MSE on PMSM dataset.
Framework generalizes to large unlabeled time series data.
Abstract
The standard paradigm for training deep learning models on sensor data assumes that more data is always better. However, raw sensor streams are often imbalanced and contain significant redundancy, meaning that not all data points contribute equally to model generalization. In this paper, we show that, in some cases, "less is more" when considering datasets. We do this by reframing the data selection problem: rather than tuning model hyperparameters, we fix the model and optimize the composition of the training data itself. We introduce a framework for discovering the optimal "training diet" from a large, unlabeled time series corpus. Our framework first uses a large-scale encoder and k-means clustering to partition the dataset into distinct, behaviorally consistent clusters. These clusters represent the fundamental 'ingredients' available for training. We then employ the Optuna…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting · Data Stream Mining Techniques · Forecasting Techniques and Applications
