Renzhong Deng — accepted AI-conference papers

2025

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)

Renzhong Deng, Weijie Zheng, Benjamin Doerr

IJCAI 2025

This work conducts a first theoretical analysis studying how well the NSGA-III approximates the Pareto front when the population size N is less than the Pareto front size. We show that when N is at least the number Nr of reference points, then the approximation quality, measured by the maximum empty

Cited by 0 Source ↗PDF ↗Scholar ↗

2024

How to Use the Metropolis Algorithm for Multi-Objective Optimization?

Weijie Zheng, Mingfeng Li, Renzhong Deng, Benjamin Doerr

AAAI 2024technical

The Metropolis algorithm can cope with local optima by accepting inferior solutions with suitably small probability. That this can work well was not only observed in empirical research, but also via mathematical runtime analyses on single-objective benchmarks. This paper takes several steps towards…

Cited by 11 Source ↗PDF ↗Scholar ↗