DONE
The Data-based Online Nonlinear Extremumseeker (DONE) algorithm is a black-box optimization algorithm. DONE models the unknown cost function and attempts to find an optimum of the underlying function. The DONE algorithm is suitable for optimizing costly and noisy functions and does not require derivatives. An advantage of DONE over similar algorithms, such as Bayesian optimization, is that the computational cost per iteration is independent of the number of function evaluations.
Methods[]
The DONE algorithm was first proposed by Hans Verstraete and Sander Wahls.[1] The algorithm fits a surrogate model based on random Fourier features[2] and then uses a well-known L-BFGS algorithm to find an optimum of the surrogate model.
Applications[]
DONE was first demonstrated for maximizing the signal in optical coherence tomography measurements, but has since then been applied to various other applications. For example, it was used to help extending the field of view in light sheet fluorescence microscopy.[3]
References[]
- ^ Hans R. G. W. Verstraete, Sander Wahls, Jeroen Kalkman, Michel Verhaegen: Model-based sensor-less wavefront aberration correction in optical coherence tomography, Opt. Lett. 40, 5722-5725 (2015)
- ^ Ali Rahimi, Benjamin Recht: Random features for large-scale kernel machines, Advances in neural information processing systems, pp. 1177-1184 (2007)
- ^ Dean Wilding, Paolo Pozzi, Oleg Soloviev, Gleb Vdovin, Colin J. Sheppard, Michel Verhaegen: Pupil filters for extending the field-of-view in light-sheet microscopy, Optics letters 41, no. 6 (2016): 1205-1208
 | This algorithms or data structures-related article is a stub. You can help Wikipedia by . |
- Algorithms and data structures stubs
- Algorithms