2022/04/01 by Julien Pelamatti, Rodolphe Le Riche, Pelamatti, Julien +5
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #Advanced Multi-Objective Optimization Algorithms #FOS: Mathematics #Gaussian Processes and Bayesian Inference #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.2204.00527
openalex publication_date 2022/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider chance constrained optimization where it is sought to optimize a function while complying with constraints, both of which are affected by uncertainties. The high computational cost of realistic simulations strongly limits the number of evaluations and makes this type of problems particularly challenging. In such a context, it is common to rely on Bayesian optimization algorithms. Assuming, without loss of generality, that the uncertainty comes from some of the inputs, it becomes possible to build a Gaussian process model in the joint space of design and uncertain variables. A two-step acquisition function is then used to provide, both, promising optimization variables associated to relevant uncertain samples. Our overall contribution is to correlate the constraints in the GP model and exploit this to optimally decide, at each iteration, which constraint should be evaluated and at which point. The coupled Gaussian model of the constraints relies on an output-as-input encoding. The constraint selection idea is developed by enabling that each constraint can be evaluated for a different uncertain input, thus improving the refinement efficiency. Constraints coupling and selection are gradually implement in 3 algorithm variants which are compared to a reference Bayesian approach. The results are promising in terms of convergence speed, accuracy and stability as observed on a 2, a 4 and a 27-dimensional problems.