Meta-Learning-Assisted Constraint Relaxation for Constrained Black-Box Optimization
cs.NE, cs.LG
Submitted: 2026-01-31
Updated: 2026-09-15
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Constraint handling is central to constrained black-box optimization (BBO), where objective improvement and feasibility restoration often provide conflicting search signals.
Terminology
Abstract
Constraint handling is central to constrained black-box optimization (BBO), where objective improvement and feasibility restoration often provide conflicting search signals. Existing ε-relaxation methods are simple and effective, but their relaxation schedules are usually fixed or manually designed for a limited range of problems. To address this limitation, this letter proposes MeCO, a meta-learning-assisted optimizer that learns an adaptive ε-relaxation policy for constrained BBO. MeCO couples a SHADE optimizer with a Double Deep Q-Network controller. At each optimization step, the controller observes compact population and constraint features and selects a scalar action, which is decoded into a relaxation vector for the candidate comparison rule. The policy is trained across constrained BBO instances and then deployed on held-out problems without problem-specific tuning. Experiments on the CEC2017 constrained benchmark, 16 UAV path-planning tasks and eight real-world engineering problems provide evidence that MeCO transfers across held-out benchmark functions, higher dimensions, and an application-domain setting. Ablation and behavior analyses further clarify the roles of constraint-related state features, action scaling, reward shaping, and meta-training.
Sources
- Symbol: Generating Flexible Black-Box Optimizers through Symbolic Equation Learning
- An Improved Epsilon Constraint-handling Method in MOEA/D for CMOPs with Large Infeasible Regions
- Meta Learning Black-Box Population-Based Optimizers
- DesignX: Human-Competitive Algorithm Designer for Black-Box Optimization
- Evolution of Heuristics: Towards Efficient Automatic Algorithm Design Using Large Language Model
- Neural Exploratory Landscape Analysis for Meta-Black-Box-Optimization
- Deep Reinforcement Learning for Dynamic Algorithm Configuration: A Case Study on Optimizing OneMax with the (1+($\lambda$,$\lambda$))-GA
- Instance Generation for Meta-Black-Box Optimization through Latent Space Reverse Engineering
- Recent Advances on Machine Learning for Computational Fluid Dynamics: A Survey
- Reinforcement learning Based Automated Design of Differential Evolution Algorithm for Black-box Optimization
- Learning Where, What and How to Transfer: A Multi-Role Reinforcement Learning Approach for Evolutionary Multitasking
Related papers
- Evolutionary Ensemble of Agents
- Encoding and Decoding Temporal Signals with Spiking Bandpass Wavelets
- Large Language Models and Evolutionary Computation: A Critical Review of Bidirectional Interaction, Automated Algorithm Design, and Co-Adaptive Systems
- Learning Alzheimer's Disease Signatures by bridging EEG with Spiking Neural Networks and Biophysical Simulations
- Investigating Hyperparameter Optimization and Transferability for ES-HyperNEAT: A TPE Approach
- S-AI-Recursive: A Bio-Inspired and Temporal Sparse AI Architecture for Iterative, Introspective, and Energy-Frugal Reasoning