Training Feedforward Neural Networks with Bayesian Hyper-Heuristics

03/29/2023
by   Arné Schreuder, et al.
0

The process of training feedforward neural networks (FFNNs) can benefit from an automated process where the best heuristic to train the network is sought out automatically by means of a high-level probabilistic-based heuristic. This research introduces a novel population-based Bayesian hyper-heuristic (BHH) that is used to train feedforward neural networks (FFNNs). The performance of the BHH is compared to that of ten popular low-level heuristics, each with different search behaviours. The chosen heuristic pool consists of classic gradient-based heuristics as well as meta-heuristics (MHs). The empirical process is executed on fourteen datasets consisting of classification and regression problems with varying characteristics. The BHH is shown to be able to train FFNNs well and provide an automated method for finding the best heuristic to train the FFNNs at various stages of the training process.

READ FULL TEXT

page 8

page 21

research
01/23/2018

Hyper-heuristics Can Achieve Optimal Performance for Pseudo-Boolean Optimisation

Selection hyper-heuristics are randomised search methodologies which cho...
research
06/09/2010

Towards the Design of Heuristics by Means of Self-Assembly

The current investigations on hyper-heuristics design have sprung up in ...
research
09/25/2019

A Heuristic for Efficient Reduction in Hidden Layer Combinations For Feedforward Neural Networks

In this paper, we describe the hyper-parameter search problem in the fie...
research
06/15/2020

Evolution of Group-Theoretic Cryptology Attacks using Hyper-heuristics

In previous work, we developed a single Evolutionary Algorithm (EA) to s...
research
02/09/2012

Hyper heuristic based on great deluge and its variants for exam timetabling problem

Today, University Timetabling problems are occurred annually and they ar...
research
12/03/2022

Longest Common Substring in Longest Common Subsequence's Solution Service: A Novel Hyper-Heuristic

The Longest Common Subsequence (LCS) is the problem of finding a subsequ...
research
08/23/2023

Utilizing Admissible Bounds for Heuristic Learning

While learning a heuristic function for forward search algorithms with m...

Please sign up or login with your details

Forgot password? Click here to reset