Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Arnold, Dirk V. | de |
dc.contributor.author | Beyer, Hans-Georg | de |
dc.date.accessioned | 2004-12-07T08:21:06Z | - |
dc.date.available | 2004-12-07T08:21:06Z | - |
dc.date.created | 2002 | de |
dc.date.issued | 2002-04-08 | de |
dc.identifier.uri | http://hdl.handle.net/2003/5422 | - |
dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-15282 | - |
dc.description.abstract | The cumulative step-size adaptation (CSA) based on path length control is regarded as a robust alternative to the standard mutative self-adaptation technique in evolution strategies (ES), guaranteeing an almost optimal control of the mutation operator. In this short paper it is shown that the underlying basic assumption in CSA - the perpendicularity of expected consecutive steps - does not necessarily guarantee optimal progress performance for (...)intermediate recombinative ES. | en |
dc.format.extent | 145368 bytes | - |
dc.format.extent | 291369 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | application/postscript | - |
dc.language.iso | en | de |
dc.publisher | Universität Dortmund | de |
dc.relation.ispartofseries | Reihe Computational Intelligence ; 129 | de |
dc.subject | covariance matrix adaptation | en |
dc.subject | cumulative step-size adaptation | en |
dc.subject | evolution strategies | en |
dc.subject | mutative self-adaptation | en |
dc.subject | progress rate | en |
dc.subject.ddc | 004 | de |
dc.title | Qualms Regarding the Optimality of Cumulative Path Length Control in CSA/CMA-Evolution Strategies | en |
dc.type | Text | de |
dc.type.publicationtype | report | - |
dcterms.accessRights | open access | - |
Appears in Collections: | Sonderforschungsbereich (SFB) 531 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
129.pdf | DNB | 141.96 kB | Adobe PDF | View/Open |
129.ps | 284.54 kB | Postscript | View/Open |
This item is protected by original copyright |
Items in Eldorado are protected by copyright, with all rights reserved, unless otherwise indicated.