Addressing Expensive Multi-objective Games with Postponed Preference Articulation via Memetic Co-evolution
Adam \.Zychowski, Abhishek Gupta, Jacek Ma\'ndziuk, Yew Soon Ong

TL;DR
This paper introduces memetic co-evolutionary algorithms to improve convergence in multi-objective games with postponed preferences, especially for computationally expensive problems, by using local refinements on surrogate landscapes.
Contribution
It proposes novel memetic enhancements to co-evolutionary methods to mitigate the Red Queen effect and reduce costly evaluations in multi-objective games.
Findings
Memetic approaches improve convergence speed.
Surrogate-based local refinements reduce evaluation costs.
Enhanced methods outperform traditional co-evolutionary algorithms.
Abstract
This paper presents algorithmic and empirical contributions demonstrating that the convergence characteristics of a co-evolutionary approach to tackle Multi-Objective Games (MOGs) with postponed preference articulation can often be hampered due to the possible emergence of the so-called Red Queen effect. Accordingly, it is hypothesized that the convergence characteristics can be significantly improved through the incorporation of memetics (local solution refinements as a form of lifelong learning), as a promising means of mitigating (or at least suppressing) the Red Queen phenomenon by providing a guiding hand to the purely genetic mechanisms of co-evolution. Our practical motivation is to address MOGs of a time-sensitive nature that are characterized by computationally expensive evaluations, wherein there is a natural need to reduce the total number of true function evaluations…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
