Co-evolution improves the efficiency of preference learning methods when the Decision Maker's aspirations develop over time

Michał K. Tomczyk, M. Kadziński
{"title":"Co-evolution improves the efficiency of preference learning methods when the Decision Maker's aspirations develop over time","authors":"Michał K. Tomczyk, M. Kadziński","doi":"10.1145/3583131.3590348","DOIUrl":null,"url":null,"abstract":"This paper's research scope is interactive evolutionary multiple objective optimization founded on the preference learning paradigm. It concerns a scenario in which the Decision Maker's (DM's) aspirations develop over time. In this view, the interactive method may be forced to occasionally re-learn the DM's value system and, thus, re-orient the search during optimization. In preliminary studies, we observed that although a satisfactory recommendation can ultimately be discovered, it is often attainable with more significant computational power. To resolve this issue, we propose a co-evolutionary method, evolving sub-populations that approximate the Pareto front or align with the DM's preferences. This diversifies the maintained solution set, which is useful when re-understanding the DM's aspirations during interactions. Also, it helps reallocate the preference-driven sub-population quickly, avoiding an extensive computational burden. We demonstrate the usefulness of such hybridization in a series of extensive experiments that involve different test problems, numbers of objectives, and behavioral models of the Decision Maker.","PeriodicalId":89841,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference. Genetic and Evolutionary Computation Conference","volume":"49 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Genetic and Evolutionary Computation Conference. Genetic and Evolutionary Computation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3583131.3590348","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper's research scope is interactive evolutionary multiple objective optimization founded on the preference learning paradigm. It concerns a scenario in which the Decision Maker's (DM's) aspirations develop over time. In this view, the interactive method may be forced to occasionally re-learn the DM's value system and, thus, re-orient the search during optimization. In preliminary studies, we observed that although a satisfactory recommendation can ultimately be discovered, it is often attainable with more significant computational power. To resolve this issue, we propose a co-evolutionary method, evolving sub-populations that approximate the Pareto front or align with the DM's preferences. This diversifies the maintained solution set, which is useful when re-understanding the DM's aspirations during interactions. Also, it helps reallocate the preference-driven sub-population quickly, avoiding an extensive computational burden. We demonstrate the usefulness of such hybridization in a series of extensive experiments that involve different test problems, numbers of objectives, and behavioral models of the Decision Maker.
当决策者的愿望随着时间的推移而发展时,共同进化提高了偏好学习方法的效率
本文的研究范围是基于偏好学习范式的交互式进化多目标优化。它涉及决策者(DM)的愿望随着时间的推移而发展的情景。在这种观点下,交互方法可能会被迫偶尔重新学习DM的值系统,从而在优化过程中重新定位搜索。在初步研究中,我们观察到,尽管最终可以发现令人满意的推荐,但通常需要更大的计算能力才能实现。为了解决这个问题,我们提出了一种共同进化的方法,即进化出近似帕累托前沿或与决策者偏好一致的亚种群。这使维护的解决方案集多样化,这在交互期间重新理解DM的期望时非常有用。此外,它有助于快速重新分配偏好驱动的子种群,避免了大量的计算负担。我们在一系列广泛的实验中证明了这种杂交的有用性,这些实验涉及不同的测试问题、目标数量和决策者的行为模型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书