Zobrazit minimální záznam



dc.contributor.authorPošík, Petr
dc.contributor.authorBaudiš, Petr
dc.date.accessioned2016-03-08T08:31:06Z
dc.date.available2016-03-08T08:31:06Z
dc.date.issued2015
dc.identifier.citationPošík, P. - Baudiš, P.: Dimension Selection in Axis-Parallel Brent-STEP Method for Black-Box Optimization of Separable Continuous Functions. In Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO Companion '15), Sara Silva (Ed.). ACM, New York, NY, USA, p. 1151-1158.en
dc.identifier.isbn978-1-4503-3488-4
dc.identifier.otherhttp://dl.acm.org/citation.cfm?id=2768469
dc.identifier.urihttp://hdl.handle.net/10467/62782
dc.description.abstractThe recently proposed Brent-STEP algorithm was gener alized for separable functions by performing axis-parallel searches, interleaving the steps in individual dimensions in a round-robin fashion. This article explores the possibility to choose the dimension for the next step in a more “intel ligent way”, i.e. to optimize first along dimensions which are believed to bring the highest profit. We present here the results for the epsilon-greedy strategy, and for a method based on the internals of the Brent-STEP algorithm. Al though the proposed methods work better than the round robin strategy in some situations, due to the marginal im provement they bring we suggest the round robin strategy to be used, thanks to its simplicity.en
dc.language.isoenen
dc.publisherACMcze
dc.subjectBlack-box optimizationen
dc.subjectBenchmarkingen
dc.subjectLine searchen
dc.subjectSeparable functionsen
dc.titleDimension Selection in Axis-Parallel Brent-STEP Method for Black-Box Optimization of Separable Continuous Functionsen
dc.typeBook chapteren
dc.identifier.doiDOI=http://dx.doi.org/10.1145/2739482.2768469


Soubory tohoto záznamu



Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam