Quaternion-Based Backtracking Search Optimization Algorithm

Author(s)

Passos, Leandro Aparecido ; Rodrigues, Douglas ; Papa, Joao Paulo ; IEEE

• Document type: Journal article
• Source: 2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC); v. N/A, p. 8-pg., 2019-01-01.

Abstract

Fitness landscape has been one of the main limitations regarding optimization tasks. Although meta-heuristic techniques have achieved outstanding results over a large variety of problems, some issues related to the function geometry and the risk to get trapped from local optima are issues that still require attention. To deal with this problem, we propose the Quaternion-based Backtracking Search Optimization Algorithm, a variant of the standard Backtracking Search Optimization Algorithm that maps each decision variable in a tensor onto a hypercomplex search space, whose landscape is expected to be smoother. Experiments conducted using nine benchmarking functions showed considerably better results than the ones achieved over standard search spaces, as well as more accurate results than some quaternion-based methods as well. (AU)

• FAPESP's process: 14/16250-9 - On the parameter optimization in machine learning techniques: advances and paradigms
• Grantee: João Paulo Papa
• Support Opportunities: Regular Research Grants
• FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
• Grantee: Francisco Louzada Neto
• Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
• FAPESP's process: 14/12236-1 - AnImaLS: Annotation of Images in Large Scale: what can machines and specialists learn from interaction?
• Grantee: Alexandre Xavier Falcão
• Support Opportunities: Research Projects - Thematic Grants
• FAPESP's process: 16/06441-7 - Semantic information retrieval in large video databases
• Grantee: Jurandy Gomes de Almeida Junior
• Support Opportunities: Regular Research Grants