Learning to Generalize Across Conditions: A PPO-Based Learning Approach to Multi-Condition Multi-Objective Optimization

This study introduces sPPO-CR, a policy-gradient deep reinforcement learning (DRL) algorithm for multi-objective (MO) and multi-condition multi-objective (MCMO) optimization. The method builds on a simplified single-step variant of Proximal Policy Optimization (PPO) and incorporates a Chebyshev-based reproduction mechanism with a log-likelihood rejection filter to safely integrate synthetic off-policy samples (sPPO-CR). sPPO-CR is benchmarked against sTD3-CR, a single-step variant of TD3, and three evolutionary baselines (NSGA-II, NSGA-III, and MOEA/D) across mathematical benchmarks and an airfoil shape optimization task. Results show that while evolutionary algorithms remain effective in standard MO settings, DRL methods, particularly sPPO-CR, offer improved performance in certain higher-dimensional and condition-dependent problems through effective generalization across both the design and condition spaces. Moreover, sPPO-CR achieves similar or superior performance to sTD3-CR while requiring an order of magnitude fewer network updates. Overall, the findings demonstrate that DRL-based optimizers provide a scalable and computationally efficient alternative for solving complex multi-condition multi-objective problems.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Evolutionary Learning and Optimization
Published
2026-10-14
DOI
https://doi.org/10.1145/3856294
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Learning to Generalize Across Conditions: A PPO-Based Learning Approach to Multi-Condition Multi-Objective Optimization

Alan Blair, Craig Wheeler, Ben Wilks, Stephan K. Chalup et al.
ACM Transactions on Evolutionary Learning and Optimization
Advanced Multi-Objective Optimization Algorithms
article

Learning to Generalize Across Conditions: A PPO-Based Learning Approach to Multi-Condition Multi-Objective Optimization

Alan Blair, Craig Wheeler, Ben Wilks, Stephan K. Chalup, Dasun Shalila Balasooriya, Tahir Abbas Jauhar
article en

Abstract

This study introduces sPPO-CR, a policy-gradient deep reinforcement learning (DRL) algorithm for multi-objective (MO) and multi-condition multi-objective (MCMO) optimization. The method builds on a simplified single-step variant of Proximal Policy Optimization (PPO) and incorporates a Chebyshev-based reproduction mechanism with a log-likelihood rejection filter to safely integrate synthetic off-policy samples (sPPO-CR). sPPO-CR is benchmarked against sTD3-CR, a single-step variant of TD3, and three evolutionary baselines (NSGA-II, NSGA-III, and MOEA/D) across mathematical benchmarks and an airfoil shape optimization task. Results show that while evolutionary algorithms remain effective in standard MO settings, DRL methods, particularly sPPO-CR, offer improved performance in certain higher-dimensional and condition-dependent problems through effective generalization across both the design and condition spaces. Moreover, sPPO-CR achieves similar or superior performance to sTD3-CR while requiring an order of magnitude fewer network updates. Overall, the findings demonstrate that DRL-based optimizers provide a scalable and computationally efficient alternative for solving complex multi-condition multi-objective problems.

ACM Transactions on Evolutionary Learning and Optimization
Australian National University (AU), UNSW Sydney (AU), The University of Adelaide (AU), University of Newcastle Australia (AU)
Openalex Percentile: Top 14%
Advanced Multi-Objective Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.