Reinforcement Learning-assisted Constraint Relaxation for Constrained Expensive Optimization
Qianhao Zhu, Sijie Ma, Zeyuan Ma, Hongshu Guo, Yue-Jiao Gong

TL;DR
This paper introduces a reinforcement learning-based method to adaptively handle constraints in complex, expensive optimization problems, improving performance over traditional manual techniques.
Contribution
It proposes a novel RL framework with a tailored Markov Decision Process and deep Q-network policy for dynamic constraint relaxation in optimization.
Findings
Outperforms strong baselines on CEC 2017 benchmark
Effective in limited evaluation budget scenarios
Provides insights through ablation studies
Abstract
Constraint handling plays a key role in solving realistic complex optimization problems. Though intensively discussed in the last few decades, existing constraint handling techniques predominantly rely on human experts' designs, which more or less fall short in utility towards general cases. Motivated by recent progress in Meta-Black-Box Optimization where automated algorithm design can be learned to boost optimization performance, in this paper, we propose learning effective, adaptive and generalizable constraint handling policy through reinforcement learning. Specifically, a tailored Markov Decision Process is first formulated, where given optimization dynamics features, a deep Q-network-based policy controls the constraint relaxation level along the underlying optimization process. Such adaptive constraint handling provides flexible tradeoff between objective-oriented exploitation…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Advanced Multi-Objective Optimization Algorithms · Metaheuristic Optimization Algorithms Research
