Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.21495 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910918127910912 |
|---|---|
| author | Budszuhn, Timo Krallmann, Mark Joachim Horn, Daniel |
| author_facet | Budszuhn, Timo Krallmann, Mark Joachim Horn, Daniel |
| contents | The challenge of noisy multi-objective optimization lies in the constant trade-off between exploring new decision points and improving the precision of known points through resampling. This decision should take into account both the variability of the objective functions and the current estimate of a point in relation to the Pareto front. Since the amount and distribution of noise are generally unknown, it is desirable for a decision function to be highly adaptive to the properties of the optimization problem. This paper presents a resampling decision function that incorporates the stochastic nature of the optimization problem by using bootstrapping and the probability of dominance. The distribution-free estimation of the probability of dominance is achieved using bootstrap estimates of the means. To make the procedure applicable even with very few observations, we transfer the distribution observed at other decision points. The efficiency of this resampling approach is demonstrated by applying it in the NSGA-II algorithm with a sequential resampling procedure under multiple noise variations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_21495 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Adaptive Resampling with Bootstrap for Noisy Multi-Objective Optimization Problems Budszuhn, Timo Krallmann, Mark Joachim Horn, Daniel Machine Learning Artificial Intelligence 90C29 G.1.6 The challenge of noisy multi-objective optimization lies in the constant trade-off between exploring new decision points and improving the precision of known points through resampling. This decision should take into account both the variability of the objective functions and the current estimate of a point in relation to the Pareto front. Since the amount and distribution of noise are generally unknown, it is desirable for a decision function to be highly adaptive to the properties of the optimization problem. This paper presents a resampling decision function that incorporates the stochastic nature of the optimization problem by using bootstrapping and the probability of dominance. The distribution-free estimation of the probability of dominance is achieved using bootstrap estimates of the means. To make the procedure applicable even with very few observations, we transfer the distribution observed at other decision points. The efficiency of this resampling approach is demonstrated by applying it in the NSGA-II algorithm with a sequential resampling procedure under multiple noise variations. |
| title | Adaptive Resampling with Bootstrap for Noisy Multi-Objective Optimization Problems |
| topic | Machine Learning Artificial Intelligence 90C29 G.1.6 |
| url | https://arxiv.org/abs/2503.21495 |