Automated Learning: An Implementation of The A* Search Algorithm over The Random Base Functions
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 0 of its 3 references that are in the map. First posted on arXiv 9 Nov 2022.
Builds on
0 of 3 references.
No references here yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.