H. Sherry Zhang, Dianne Cook, Nicolas Langrené, Jessica Wai Yin Leung
{"title":"研究水母搜索优化器在投影追寻应用中的性能","authors":"H. Sherry Zhang, Dianne Cook, Nicolas Langrené, Jessica Wai Yin Leung","doi":"arxiv-2407.13663","DOIUrl":null,"url":null,"abstract":"The projection pursuit (PP) guided tour interactively optimises a criteria\nfunction known as the PP index, to explore high-dimensional data by revealing\ninteresting projections. The optimisation in PP can be non-trivial, involving\nnon-smooth functions and optima with a small squint angle, detectable only from\nclose proximity. To address these challenges, this study investigates the\nperformance of a recently introduced swarm-based algorithm, Jellyfish Search\nOptimiser (JSO), for optimising PP indexes. The performance of JSO for\nvisualising data is evaluated across various hyper-parameter settings and\ncompared with existing optimisers. Additionally, this work proposes novel\nmethods to quantify two properties of the PP index, smoothness and\nsquintability that capture the complexities inherent in PP optimisation\nproblems. These two metrics are evaluated along with JSO hyper-parameters to\ndetermine their effects on JSO success rate. Our numerical results confirm the\npositive impact of these metrics on the JSO success rate, with squintability\nbeing the most significant. The JSO algorithm has been implemented in the tourr\npackage and functions to calculate smoothness and squintability are available\nin the ferrn package.","PeriodicalId":501215,"journal":{"name":"arXiv - STAT - Computation","volume":"63 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Studying the Performance of the Jellyfish Search Optimiser for the Application of Projection Pursuit\",\"authors\":\"H. Sherry Zhang, Dianne Cook, Nicolas Langrené, Jessica Wai Yin Leung\",\"doi\":\"arxiv-2407.13663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The projection pursuit (PP) guided tour interactively optimises a criteria\\nfunction known as the PP index, to explore high-dimensional data by revealing\\ninteresting projections. The optimisation in PP can be non-trivial, involving\\nnon-smooth functions and optima with a small squint angle, detectable only from\\nclose proximity. To address these challenges, this study investigates the\\nperformance of a recently introduced swarm-based algorithm, Jellyfish Search\\nOptimiser (JSO), for optimising PP indexes. The performance of JSO for\\nvisualising data is evaluated across various hyper-parameter settings and\\ncompared with existing optimisers. Additionally, this work proposes novel\\nmethods to quantify two properties of the PP index, smoothness and\\nsquintability that capture the complexities inherent in PP optimisation\\nproblems. These two metrics are evaluated along with JSO hyper-parameters to\\ndetermine their effects on JSO success rate. Our numerical results confirm the\\npositive impact of these metrics on the JSO success rate, with squintability\\nbeing the most significant. The JSO algorithm has been implemented in the tourr\\npackage and functions to calculate smoothness and squintability are available\\nin the ferrn package.\",\"PeriodicalId\":501215,\"journal\":{\"name\":\"arXiv - STAT - Computation\",\"volume\":\"63 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - STAT - Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.13663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.13663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Studying the Performance of the Jellyfish Search Optimiser for the Application of Projection Pursuit
The projection pursuit (PP) guided tour interactively optimises a criteria
function known as the PP index, to explore high-dimensional data by revealing
interesting projections. The optimisation in PP can be non-trivial, involving
non-smooth functions and optima with a small squint angle, detectable only from
close proximity. To address these challenges, this study investigates the
performance of a recently introduced swarm-based algorithm, Jellyfish Search
Optimiser (JSO), for optimising PP indexes. The performance of JSO for
visualising data is evaluated across various hyper-parameter settings and
compared with existing optimisers. Additionally, this work proposes novel
methods to quantify two properties of the PP index, smoothness and
squintability that capture the complexities inherent in PP optimisation
problems. These two metrics are evaluated along with JSO hyper-parameters to
determine their effects on JSO success rate. Our numerical results confirm the
positive impact of these metrics on the JSO success rate, with squintability
being the most significant. The JSO algorithm has been implemented in the tourr
package and functions to calculate smoothness and squintability are available
in the ferrn package.