User preference extraction using dynamic query sliders in conjunction with UPS-EMO algorithm

10/27/2011
by   Timo Aittokoski, et al.
0

One drawback of evolutionary multiobjective optimization algorithms (EMOA) has traditionally been high computational cost to create an approximation of the Pareto front: number of required objective function evaluations usually grows high. On the other hand, for the decision maker (DM) it may be difficult to select one of the many produced solutions as the final one, especially in the case of more than two objectives. To overcome the above mentioned drawbacks number of EMOA's incorporating the decision makers preference information have been proposed. In this case, it is possible to save objective function evaluations by generating only the part of the front the DM is interested in, thus also narrowing down the pool of possible selections for the final solution. Unfortunately, most of the current EMO approaches utilizing preferences are not very intuitive to use, i.e. they may require tweaking of unintuitive parameters, and it is not always clear what kind of results one can get with given set of parameters. In this study we propose a new approach to visually inspect produced solutions, and to extract preference information from the DM to further guide the search. Our approach is based on intuitive use of dynamic query sliders, which serve as a means to extract preference information and are part of the graphical user interface implemented for the efficient UPS-EMO algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/03/2022

A unified surrogate-based scheme for black-box and preference-based optimization

Black-box and preference-based optimization algorithms are global optimi...
research
08/16/2022

PD-MORL: Preference-Driven Multi-Objective Reinforcement Learning Algorithm

Many real-world problems involve multiple, possibly conflicting, objecti...
research
02/27/2023

Experience in Engineering Complex Systems: Active Preference Learning with Multiple Outcomes and Certainty Levels

Black-box optimization refers to the optimization problem whose objectiv...
research
04/27/2023

Inferring Preferences from Demonstrations in Multi-objective Reinforcement Learning: A Dynamic Weight-based Approach

Many decision-making problems feature multiple objectives. In such probl...
research
01/02/2018

Interactive Decomposition Multi-Objective Optimization via Progressively Learned Value Functions

Decomposition has become an increasingly popular technique for evolution...
research
09/28/2019

Active preference learning based on radial basis functions

This paper proposes a method for solving optimization problems in which ...
research
02/14/2020

How to cluster nearest unique nodes from different classes using JJCluster in Wisp application?

The work of finding the best place according to user preference is a ted...

Please sign up or login with your details

Forgot password? Click here to reset