{"title":"多变量到任意部分指定随机向量生成的进化策略","authors":"S. Stanhope","doi":"10.1109/CEC.2004.1331175","DOIUrl":null,"url":null,"abstract":"Multivariate-to-anything methods for partially specified random vector generation work by transforming samples from a driving distribution into samples characterized by given marginals and correlations. The correlations of the transformed random vector are controlled by the driving distribution; sampling a partially specified random vector requires finding an appropriate driving distribution. This paper motivates the use of evolution strategies for solving such problems and compares evolution strategies to conjugate gradient methods in the context of solving a Dirichlet-to-anything transformation. It is shown that the evolution strategy is at least as effective as the conjugate gradient method for solution of the parameterization problem.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"2265 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Evolution strategies for multivariate-to-anything partially specified random vector generation\",\"authors\":\"S. Stanhope\",\"doi\":\"10.1109/CEC.2004.1331175\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multivariate-to-anything methods for partially specified random vector generation work by transforming samples from a driving distribution into samples characterized by given marginals and correlations. The correlations of the transformed random vector are controlled by the driving distribution; sampling a partially specified random vector requires finding an appropriate driving distribution. This paper motivates the use of evolution strategies for solving such problems and compares evolution strategies to conjugate gradient methods in the context of solving a Dirichlet-to-anything transformation. It is shown that the evolution strategy is at least as effective as the conjugate gradient method for solution of the parameterization problem.\",\"PeriodicalId\":152088,\"journal\":{\"name\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"volume\":\"2265 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2004.1331175\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2004.1331175","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Evolution strategies for multivariate-to-anything partially specified random vector generation
Multivariate-to-anything methods for partially specified random vector generation work by transforming samples from a driving distribution into samples characterized by given marginals and correlations. The correlations of the transformed random vector are controlled by the driving distribution; sampling a partially specified random vector requires finding an appropriate driving distribution. This paper motivates the use of evolution strategies for solving such problems and compares evolution strategies to conjugate gradient methods in the context of solving a Dirichlet-to-anything transformation. It is shown that the evolution strategy is at least as effective as the conjugate gradient method for solution of the parameterization problem.