# Benchmarking Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization

arXiv: https://arxiv.org/abs/2201.06700 · HTML: https://mlsanity.com/paper/2201.06700/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 6 of its 71 references that are in the map.
- First posted on arXiv 18 Jan 2022.

## Builds on (most cited first, 6 of 6)

- [PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective Optimization](https://mlsanity.com/paper/1701.00879/) (2017)
- [Two-Archive Evolutionary Algorithm for Constrained Multi-Objective Optimization](https://mlsanity.com/paper/1711.07907/) (2017)
- [R2-based Hypervolume Contribution Approximation](https://mlsanity.com/paper/1805.06773/) (2018)
- [Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization](https://mlsanity.com/paper/2108.08453/) (2021)
- [Fast Greedy Subset Selection from Large Candidate Solution Sets in Evolutionary Multi-objective Optimization](https://mlsanity.com/paper/2102.00941/) (2021)
- [Maximum Volume Subset Selection for Anchored Boxes](https://mlsanity.com/paper/1803.00849/) (2018)

## Built on by (most cited first, 1 of 1)

- [On Finding Bi-objective Pareto-optimal Fraud Prevention Rule Sets for Fintech Applications](https://mlsanity.com/paper/2311.00964/) (2023)

## Abstract (arXiv)

In the evolutionary multi-objective optimization (EMO) field, the standard practice is to present the final population of an EMO algorithm as the output. However, it has been shown that the final population often includes solutions which are dominated by other solutions generated and discarded in previous generations. Recently, a new EMO framework has been proposed to solve this issue by storing all the non-dominated solutions generated during the evolution in an archive and selecting a subset of solutions from the archive as the output. The key component in this framework is the subset selection from the archive which usually stores a large number of candidate solutions. However, most studies on subset selection focus on small candidate solution sets for environmental selection. There is no benchmark test suite for large-scale subset selection. This paper aims to fill this research gap by proposing a benchmark test suite for subset selection from large candidate solution sets, and comparing some representative methods using the proposed test suite. The proposed test suite together with the benchmarking studies provides a baseline for researchers to understand, use, compare, and develop subset selection methods in the EMO field.