Active Learning Improves Performance on Symbolic RegressionTasks in StackGP
원문 초록
In this paper we introduce an active learning method for symbolic regression using StackGP. The approach begins with a small number of data points for StackGP to model. To improve the model the system incrementally adds a data point such that the new point maximizes prediction uncertainty as measured by the model ensemble. Symbolic regression is re-run with the larger data set. This cycle continues until the system satisfies a termination criterion. We use the Feynman AI benchmark set of equations to examine the ability of our method to find appropriate models using fewer data points. The approach was found to successfully rediscover 72 of the 100 Feynman equations using as few data points as possible, and without use of domain expertise or data translation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Active Learning for Manifold Gaussian Process Regression
Sparse Interpretable Deep Learning with LIES Networks for Symbolic Regression
Neural Network-Guided Symbolic Regression for Interpretable Descriptor Discovery in Perovskite Catalysts
DrSR: LLM based Scientific Equation Discovery with Dual Reasoning from Data and Experience
Active Learning via Regression Beyond Realizability
Diffusion-Based Symbolic Regression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.