HyperTime: Hyperparameter Optimization for Combating Temporal Distribution Shifts

In this work, we propose a hyperparameter optimization method named HyperTime to find hyperparameters robust to potential temporal distribution shifts in the unseen test data. Our work is motivated by an important observation that it is, in many cases, possible to achieve temporally robust predictive performance via hyperparameter optimization. Based on this observation, we leverage the 'worst-case-oriented' philosophy from the robust optimization literature to help find such robust hyperparameter configurations. HyperTime imposes a lexicographic priority order on average validation loss and worst-case validation loss over chronological validation sets. We perform a theoretical analysis on the upper bound of the expected test loss, which reveals the unique advantages of our approach. We also demonstrate the strong empirical performance of the proposed method on multiple machine learning tasks with temporal distribution shifts. The algorihtm is available in ~https://microsoft.github.io/FLAML/.

Authors

Institutions

Publication Details

Published
2024-10-26
DOI
https://doi.org/10.1145/3664647.3681608
Primary Topic
Machine Learning and Data Classification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

HyperTime: Hyperparameter Optimization for Combating Temporal Distribution Shifts

S. C. Zhang, Zhonghua Zheng, Chi Wang, Youruo Wu et al.
Machine Learning and Data Classification
article

HyperTime: Hyperparameter Optimization for Combating Temporal Distribution Shifts

S. C. Zhang, Zhonghua Zheng, Chi Wang, Youruo Wu, Qingyun Wu
article en

Abstract

In this work, we propose a hyperparameter optimization method named HyperTime to find hyperparameters robust to potential temporal distribution shifts in the unseen test data. Our work is motivated by an important observation that it is, in many cases, possible to achieve temporally robust predictive performance via hyperparameter optimization. Based on this observation, we leverage the 'worst-case-oriented' philosophy from the robust optimization literature to help find such robust hyperparameter configurations. HyperTime imposes a lexicographic priority order on average validation loss and worst-case validation loss over chronological validation sets. We perform a theoretical analysis on the upper bound of the expected test loss, which reveals the unique advantages of our approach. We also demonstrate the strong empirical performance of the proposed method on multiple machine learning tasks with temporal distribution shifts. The algorihtm is available in ~https://microsoft.github.io/FLAML/.

Microsoft (United States) (US), Pennsylvania State University (US), University of Manchester (GB)
Openalex Percentile: Top 83%
Machine Learning and Data Classification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

HyperTime: Hyperparameter Optimization for Combating Temporal Distribution Shifts — S. C. Zhang, Zhonghua Zheng, et al. · (2024) | TGRS Research Map | TGRS