Upper Trust Bound Feasibility Criterion for Mixed Constrained Bayesian Optimization with Application to Aircraft Design
Bayesian optimization methods have been successfully applied to black box optimization problems that are expensive to evaluate. In this paper, we adapt the so-called super effcient global optimization algorithm to solve more accurately mixed constrained problems. The proposed approach handles constraints by means of upper trust bound, the latter encourages exploration of the feasible domain by combining the mean prediction and the associated uncertainty function given by the Gaussian processes. On top of that, a refinement procedure, based on a learning rate criterion, is introduced to enhance the exploitation and exploration trade-off. We show the good potential of the approach on a set of numerical experiments. Finally, we present an application to conceptual aircraft configuration upon which we show the superiority of the proposed approach compared to a set of the state-of-the-art black box optimization solvers. Keywords: Global Optimization, Mixed Constrained Optimization, Black box optimization, Bayesian Optimization, Gaussian Process.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian OptimizationGaussian Processesglobal-optimizationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Stopping criterion for active learning based on deterministic generalization bounds
Active learning is a framework in which the learning machine can select the samples to be used for training. This technique is promising, particularly when the cost of data acquisition and labeling is high. In active lea…
Active LearningGeneralization BoundsTwo-sample testingConstrained Online Decision-Making: A Unified Framework
Contextual online decision-making problems with constraints appear in various real-world applications, such as personalized recommendation with resource limits and dynamic pricing with fairness constraints. In this paper…
Active LearningcounterfactualDecision MakingDensity Estimation+3Minimal Intervention Shared Control with Guaranteed Safety under Non-Convex Constraints
Shared control combines human intention with autonomous decision-making. At the low level, the primary goal is to maintain safety regardless of the user's input to the system. However, existing shared control methods-bas…
Rademacher upper bounds for cross-validation errors with an application to the lasso
We establish a general upper bound for $K$-fold cross-validation ($K$-CV) errors that can be adapted to many $K$-CV-based estimators and learning algorithms. Based on Rademacher complexity of the model and the Orlicz-$\P…
BlockingVariable SelectionAverage-Reward Reinforcement Learning with Trust Region Methods
Most of reinforcement learning algorithms optimize the discounted criterion which is beneficial to accelerate the convergence and reduce the variance of estimates. Although the discounted criterion is appropriate for cer…
continuous-controlContinuous ControlMuJoCoreinforcement-learning+2