Automated Learning: An Implementation of The A* Search Algorithm over The Random Base Functions

11/09/2022

∙

by   Nima Tatari, et al.

∙

0

∙

share

This letter explains an algorithm for finding a set of base functions. The method aims to capture the leading behavior of the dataset in terms of a few base functions. Implementation of the A-star search will help find these functions, while the gradient descent optimizes the parameters of the functions at each search step. We will show the resulting plots to compare the extrapolation with the unseen data.