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

Nima Tatari

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

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2211.05085 v1 pith:C636QMGH submitted 2022-11-09 physics.data-an cs.LG

Nima Tatari This is my paper · ORCID

classification physics.data-ancs.LG

keywords functionsbasesearchalgorithmimplementationwilla-staraims

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Training Environment for High Performance Reinforcement Learning
cs.AI 2025-05 reject novelty 4.0 of 10

Tunnel couples F-16 nonlinear flight dynamics with customizable Gymnasium sensors and tasks, plus an informal comparison of RL, behavioral cloning, and PID baselines.

Pith tools