帕累托最优性无处不在:从工程设计、机器学习到生物系统

Yaochu Jin
{"title":"帕累托最优性无处不在:从工程设计、机器学习到生物系统","authors":"Yaochu Jin","doi":"10.1109/GEFS.2008.4484555","DOIUrl":null,"url":null,"abstract":"This talk attempts to argue that almost all adaptive systems have multiple objectives to achieve. Very often, there is no single solution that can optimize all objectives, in which case, the concept of Pareto-optimization plays an important rule. Examples will be given ranging from engineering design, machine learning, to biological systems to show how Pareto-optimality can make a difference in analyzing these systems. The first example we will discuss is the aerodynamic design optimization of turbine blades, where energy efficiency in terms of pressure loss as well as the variation of pressure distribution must be minimized. One additional difficulty in aerodynamic design optimization is that the quality of candidate designs must be assessed by performing computational fluid dynamics analysis, which is very time consuming. To reduce computation time, computational techniques like parallel computation, and machine learning techniques, such as meta-modeling can be employed.Surprisingly interesting results will also be achieved when the concept of Pareto-optimality is applied to machine learning. Two cases will be provided to illustrate this idea. In the first case, we show how Pareto-based approach can address neural network regularization more elegantly, through which deeper insights into the problem can be gained. In the second case, we show that analysis of the Pareto-optimal solutions will help determine the optimal number of clusters in data clustering, which again shown how the Pareto front can disclose additional knowledge about the problem at hand. The final example is concerned with tradeoffs in simulated evolution of genetic representation. It has been argued that robustness is critical for biological evolution, because without certain degree of robustness to mutations, it is impossible for evolution to create new functionalities. Therefore, evolution must find representations that are sufficiently robust yet have the potential to innovate. Examples will be given to show that such tradeoff does exist in evolving both a stationary genotype-phenotype mapping, and also a gene regulatory network described by a random Boolean network.","PeriodicalId":297294,"journal":{"name":"IEEE Workshop on Genetic and Evolutionary Fuzzy Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Pareto-optimality is everywhere: From engineering design, machine learning, to biological systems\",\"authors\":\"Yaochu Jin\",\"doi\":\"10.1109/GEFS.2008.4484555\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This talk attempts to argue that almost all adaptive systems have multiple objectives to achieve. Very often, there is no single solution that can optimize all objectives, in which case, the concept of Pareto-optimization plays an important rule. Examples will be given ranging from engineering design, machine learning, to biological systems to show how Pareto-optimality can make a difference in analyzing these systems. The first example we will discuss is the aerodynamic design optimization of turbine blades, where energy efficiency in terms of pressure loss as well as the variation of pressure distribution must be minimized. One additional difficulty in aerodynamic design optimization is that the quality of candidate designs must be assessed by performing computational fluid dynamics analysis, which is very time consuming. To reduce computation time, computational techniques like parallel computation, and machine learning techniques, such as meta-modeling can be employed.Surprisingly interesting results will also be achieved when the concept of Pareto-optimality is applied to machine learning. Two cases will be provided to illustrate this idea. In the first case, we show how Pareto-based approach can address neural network regularization more elegantly, through which deeper insights into the problem can be gained. In the second case, we show that analysis of the Pareto-optimal solutions will help determine the optimal number of clusters in data clustering, which again shown how the Pareto front can disclose additional knowledge about the problem at hand. The final example is concerned with tradeoffs in simulated evolution of genetic representation. It has been argued that robustness is critical for biological evolution, because without certain degree of robustness to mutations, it is impossible for evolution to create new functionalities. Therefore, evolution must find representations that are sufficiently robust yet have the potential to innovate. Examples will be given to show that such tradeoff does exist in evolving both a stationary genotype-phenotype mapping, and also a gene regulatory network described by a random Boolean network.\",\"PeriodicalId\":297294,\"journal\":{\"name\":\"IEEE Workshop on Genetic and Evolutionary Fuzzy Systems\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Workshop on Genetic and Evolutionary Fuzzy Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GEFS.2008.4484555\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Workshop on Genetic and Evolutionary Fuzzy Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GEFS.2008.4484555","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本演讲试图论证几乎所有的适应性系统都有多个目标要实现。通常,没有单一的解决方案可以优化所有的目标,在这种情况下,帕累托优化的概念起着重要的作用。将给出从工程设计、机器学习到生物系统的例子,以展示帕累托最优性如何在分析这些系统时发挥作用。我们将讨论的第一个例子是涡轮叶片的气动设计优化,其中能量效率方面的压力损失以及压力分布的变化必须最小化。气动设计优化的另一个难点是必须通过计算流体动力学分析来评估候选设计的质量,这非常耗时。为了减少计算时间,可以使用并行计算等计算技术和元建模等机器学习技术。当帕累托最优的概念应用于机器学习时,也会获得令人惊讶的有趣结果。将提供两个案例来说明这个想法。在第一种情况下,我们展示了基于帕累托的方法如何更优雅地解决神经网络正则化问题,通过这种方法可以更深入地了解问题。在第二种情况下,我们展示了对帕累托最优解的分析将有助于确定数据聚类中的最佳簇数,这再次显示了帕累托前沿如何揭示手头问题的额外知识。最后一个例子是关于遗传表征模拟进化中的权衡。人们一直认为,鲁棒性对生物进化至关重要,因为如果没有一定程度的对突变的鲁棒性,进化就不可能创造新的功能。因此,进化必须找到足够健壮但又有创新潜力的表征。将给出的例子表明,这种权衡确实存在于进化中,既稳定的基因型-表型定位,也由随机布尔网络描述的基因调控网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Pareto-optimality is everywhere: From engineering design, machine learning, to biological systems
This talk attempts to argue that almost all adaptive systems have multiple objectives to achieve. Very often, there is no single solution that can optimize all objectives, in which case, the concept of Pareto-optimization plays an important rule. Examples will be given ranging from engineering design, machine learning, to biological systems to show how Pareto-optimality can make a difference in analyzing these systems. The first example we will discuss is the aerodynamic design optimization of turbine blades, where energy efficiency in terms of pressure loss as well as the variation of pressure distribution must be minimized. One additional difficulty in aerodynamic design optimization is that the quality of candidate designs must be assessed by performing computational fluid dynamics analysis, which is very time consuming. To reduce computation time, computational techniques like parallel computation, and machine learning techniques, such as meta-modeling can be employed.Surprisingly interesting results will also be achieved when the concept of Pareto-optimality is applied to machine learning. Two cases will be provided to illustrate this idea. In the first case, we show how Pareto-based approach can address neural network regularization more elegantly, through which deeper insights into the problem can be gained. In the second case, we show that analysis of the Pareto-optimal solutions will help determine the optimal number of clusters in data clustering, which again shown how the Pareto front can disclose additional knowledge about the problem at hand. The final example is concerned with tradeoffs in simulated evolution of genetic representation. It has been argued that robustness is critical for biological evolution, because without certain degree of robustness to mutations, it is impossible for evolution to create new functionalities. Therefore, evolution must find representations that are sufficiently robust yet have the potential to innovate. Examples will be given to show that such tradeoff does exist in evolving both a stationary genotype-phenotype mapping, and also a gene regulatory network described by a random Boolean network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信