Online Optimization with Costly and Noisy Measurements Using Random Fourier Expansions

Laurens Bliek, Hans R.G.W. Verstraete, Michel Verhaegen, Sander Wahls

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

13 Citaten (Scopus)


This paper analyzes data-based online nonlinear extremum-seeker (DONE), an online optimization algorithm that iteratively minimizes an unknown function based on costly and noisy measurements. The algorithm maintains a surrogate of the unknown function in the form of a random Fourier expansion. The surrogate is updated whenever a new measurement is available, and then used to determine the next measurement point. The algorithm is comparable with Bayesian optimization algorithms, but its computational complexity per iteration does not depend on the number of measurements. We derive several theoretical results that provide insight on how the hyperparameters of the algorithm should be chosen. The algorithm is compared with a Bayesian optimization algorithm for an analytic benchmark problem and three applications, namely, optical coherence tomography, optical beam-forming network tuning, and robot arm control. It is found that the DONE algorithm is significantly faster than Bayesian optimization in the discussed problems while achieving a similar or better performance.

Originele taal-2Engels
Pagina's (van-tot)167-182
Aantal pagina's16
TijdschriftIEEE Transactions on Neural Networks and Learning Systems
Nummer van het tijdschrift1
StatusGepubliceerd - jan 2018
Extern gepubliceerdJa

Vingerafdruk Duik in de onderzoeksthema's van 'Online Optimization with Costly and Noisy Measurements Using Random Fourier Expansions'. Samen vormen ze een unieke vingerafdruk.

Citeer dit