Response surface methodology(RSM) is a commonly used statistical method for studying and optimizing the influencing factors in the production process. By establishing mathematical models to describe the relationship b...
详细信息
Portfolio optimization that allows the borrowed money from a loan to be invested in risk assets is formulated as a data-driven optimization problem called POL_P. Then, in order to reflect investor preferences called &...
详细信息
As an effective path exploration technology, dung Beetle algorithm has been widely used in the path planning of unmanned aerial vehicle autonomous navigation. In this paper, a 3D path planning strategy for unmanned ae...
详细信息
During the iterative process, the probability of selection is directly linked to the fitness magnitude, as each iteration of swarm intelligence optimization algorithms progressively converges towards an optimal soluti...
详细信息
A newly developed optimization technique, known as "Social Group optimization (SGO)," has been recently introduced by S.C. Satapathy and colleagues. This innovative method presents an effective strategy for ...
详细信息
The Remora optimization Algorithm (ROA) is a meta-heuristic algorithm that imitates the foraging behaviors of Remora. Its main idea lies in simulating the mechanism of switching hosts during the foraging process of re...
详细信息
The current paper addresses the central role of hyperparameter optimization in improving the predictive power of the MLP Regressor for forecasting student performance in Portuguese secondary schools. The uniqueness of...
详细信息
We study the problem of preferential Bayesian optimization (BO), where we aim to optimize a black-box function with only preference feedback over a pair of candidate solutions. Inspired by the likelihood ratio idea, w...
详细信息
We study the problem of preferential Bayesian optimization (BO), where we aim to optimize a black-box function with only preference feedback over a pair of candidate solutions. Inspired by the likelihood ratio idea, we construct a confidence set of the black-box function using only the preference feedback. An optimistic algorithm with an efficient computational method is then developed to solve the problem, which enjoys an information-theoretic bound on the total cumulative regret, a first-of-its-kind for preferential BO. This bound further allows us to design a scheme to report an estimated best solution, with a guaranteed convergence rate. Experimental results on sampled instances from Gaussian processes, standard test functions, and a thermal comfort optimization problem all show that our method stably achieves better or competitive performance as compared to the existing state-of-the-art heuristics, which, however, do not have theoretical guarantees on regret bounds or convergence. Copyright 2024 by the author(s)
In response to the collaborative detection problem of unmanned aerial vehicle (UAV) formations in dual aircraft formation cluster operations, this paper constructs an optimization model with detection benefits and det...
详细信息
With the rapid development of electric power technology, the application of wireless sensor networks (WSNs) in the electric power field has received widespread attention. The WSNs coverage optimization problem in the ...
详细信息
暂无评论