TY - GEN
T1 - HyperTime
T2 - 32nd ACM International Conference on Multimedia, MM 2024
AU - Zhang, Shaokun
AU - Wu, Yiran
AU - Zheng, Zhonghua
AU - Wu, Qingyun
AU - Wang, Chi
N1 - Publisher Copyright:
© 2024 ACM.
PY - 2024/10/28
Y1 - 2024/10/28
N2 - 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/.
AB - 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/.
UR - https://www.scopus.com/pages/publications/85209824269
UR - https://www.scopus.com/inward/citedby.url?scp=85209824269&partnerID=8YFLogxK
U2 - 10.1145/3664647.3681608
DO - 10.1145/3664647.3681608
M3 - Conference contribution
AN - SCOPUS:85209824269
T3 - MM 2024 - Proceedings of the 32nd ACM International Conference on Multimedia
SP - 4610
EP - 4619
BT - MM 2024 - Proceedings of the 32nd ACM International Conference on Multimedia
PB - Association for Computing Machinery, Inc
Y2 - 28 October 2024 through 1 November 2024
ER -