The continuous computational power growth in the last decades has made solving several optimization problems significant to humankind a tractable task; however, tackling some of them remains a challenge due to the overwhelming amount of candidate solutions to be evaluated, even by using sophisticated algorithms. In such a context, a set of nature-inspired stochastic methods, called meta-heuristic optimization, can provide robust approximate solutions to different kinds of problems with a small computational burden, such as derivative-free real function optimization. Nevertheless, these methods may converge to inadequate solutions if the function landscape is too harsh, e.g., enclosing too many local optima. Previous works addressed this issue by employing a hypercomplex representation of the search space, like quaternions, where the landscape becomes smoother and supposedly easier to optimize. Under this approach, meta-heuristic computations happen in the hypercomplex space, whereas variables are mapped back to the real domain before function evaluation. Despite this latter operation being performed by the Euclidean norm, we have found that after the optimization procedure has finished, it is usually possible to obtain even better solutions by employing the Minkowski $p$-norm instead and fine-tuning $p$ through an auxiliary sub-problem with neglecting additional cost and no hyperparameters. Such behavior was observed in eight well-established benchmarking functions, thus fostering a new research direction for hypercomplex meta-heuristic optimization.
WASHH: An Anchor-Aware Whale-Guided Selection Hyper-Heuristic for Continuous Optimization and SVC Configuration
Faculty of Applied Sciences, Macao Polytechnic University(澳门理工学院应用科学学院);School of Mechanical and Electrical Engineering and Automation, Shanghai University(上海大学机械与自动化工程学院);Pazhou Lab (Huangpu), Guangzhou(广州 Pazhou 实验室(黄埔));College of Animal Science and Technology, Zhongkai University of Agriculture and Engineering(仲恺农业工程学院动物科学与技术学院);Macao Polytechnic University(澳门理工学院)
Generalizable Heuristic Generation Through LLMs with Meta-Optimization
Nanyang Technological University(南洋理工大学);Shandong University(山东大学);Singapore Management University(新加坡国立大学);Eindhoven University of Technology(埃因霍温理工大学)
Reinforcement-Guided Hyper-Heuristic Hyperparameter Optimization for Fair and Explainable Spiking Neural Network-Based Financial Fraud Detection
organization= Department of Computer Science \& Engineering, Khulna University of Engineering \& Technology (KUET) , city= Khulna , postcode= 9203 , country= Bangladesh;organization= Thomas Lord Department of Computer Science, Viterbi School of Engineering, University of Southern California , city= Los Angeles , state= CA , postcode= 90089 , country= USA;organization= Department of Computer Science, American International University-Bangladesh (AIUB) , city= Dhaka , postcode= 1229 , country= Bangladesh
Deep Memory Search: A Metaheuristic Approach for Optimizing Heuristic Search
Assiut University(艾斯尤特大学);Umm Al-Qura University(乌姆阿尔古拉大学);Texas A&M University-San Antonio(德克萨斯农工大学圣安东尼奥分校);College of Computer and Information Systems(计算机与信息系统学院);Higher Colleges of Technology(高等技术学院)
Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling
Faculty of Applied Sciences, Macao Polytechnic University(澳门理工学院应用科学学院);Pazhou Lab (Huangpu), Guangzhou(广州 Pazhou 实验室(黄埔));College of Animal Science and Technology, Zhongkai University of Agriculture and Engineering(仲恺农业工程学院动物科学与技术学院);Macao Polytechnic University(澳门理工学院)