TY - GEN
T1 - DYNAMIC RANDOM FEATURE GAUSSIAN PROCESSES FOR BAYESIAN OPTIMIZATION OF TIME-VARYING FUNCTIONS
AU - Llorente, Fernando
AU - Djurić, Petar M.
N1 - Publisher Copyright: © 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Bayesian optimization (BO) is a popular approach to optimizing costly, black-box functions that rely on a statistical surrogate model of the function to select new query points, balancing exploration and exploitation of the parameter space. Most of the work on BO has focused on the time-invariant setting where the function does not change over time. Recently, the time-varying BO (TV-BO) framework has been introduced to handle non-stationary functions. In this work, we explore TV-BO with the use of dynamic random feature-based Gaussian processes (DRF-GPs). These processes capture the nonstationarity of the unknown functions by evolving the parameter vector of a linear model. We propose an evolution mechanism that results in an acquisition function with sensible exploitation-exploration trade-offs over time. We compare the resulting algorithm with the TV-BO baseline algorithms on a toy example and a localization problem with synthetic data.
AB - Bayesian optimization (BO) is a popular approach to optimizing costly, black-box functions that rely on a statistical surrogate model of the function to select new query points, balancing exploration and exploitation of the parameter space. Most of the work on BO has focused on the time-invariant setting where the function does not change over time. Recently, the time-varying BO (TV-BO) framework has been introduced to handle non-stationary functions. In this work, we explore TV-BO with the use of dynamic random feature-based Gaussian processes (DRF-GPs). These processes capture the nonstationarity of the unknown functions by evolving the parameter vector of a linear model. We propose an evolution mechanism that results in an acquisition function with sensible exploitation-exploration trade-offs over time. We compare the resulting algorithm with the TV-BO baseline algorithms on a toy example and a localization problem with synthetic data.
KW - Bayesian optimization
KW - feature-based Gaussian processes
KW - time-varying functions
UR - https://www.scopus.com/pages/publications/85195362157
U2 - 10.1109/ICASSP48485.2024.10447767
DO - 10.1109/ICASSP48485.2024.10447767
M3 - Conference contribution
T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
SP - 9756
EP - 9760
BT - 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2024 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2024
Y2 - 14 April 2024 through 19 April 2024
ER -