Description : This package includes the python code of the EPORSS algorithm [1] for robust subset selection with monotone objective functions. EPORSS first reformulates the original robust subset selection problem as a bi-objective optimization problem that maximizes the worst-case objective function and minimizes the subset size simultaneously, then employs a multi-objective evolutionary algorithm to solve it. A README file is included in the package.

References: [1] Chao Bian, Yawen Zhou, and Chao Qian. Robust Subset Selection by Greedy and Evolutionary Pareto Optimization. In: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI'22), Vienna, Austria, 2022.

ATTN: This package is free for academic usage. You can run it at your own risk. For other purposes, please contact Dr. Chao Qian (qianc@lamda.nju.edu.cn).

Requirement: The package was developed with python.

ATTN2: This package was developed by Mr. Chao Bian (bianc@lamda.nju.edu.cn) and Ms. Yawen Zhou (zyw8769@gmail.com). For any problem concerning the code, please feel free to contact them.

Download: code (415KB)