Deep Symbolic Regression for Recurrent Sequences

01/12/2022

∙

by   Stéphane d'Ascoli, et al.

∙

13

∙

share

Symbolic regression, i.e. predicting a function from the observation of its values, is well-known to be a challenging task. In this paper, we train Transformers to infer the function or recurrence relation underlying sequences of integers or floats, a typical task in human IQ tests which has hardly been tackled in the machine learning literature. We evaluate our integer model on a subset of OEIS sequences, and show that it outperforms built-in Mathematica functions for recurrence prediction. We also demonstrate that our float model is able to yield informative approximations of out-of-vocabulary functions and constants, e.g. bessel0(x)≈sin(x)+cos(x)/√(π x) and 1.644934≈π^2/6. An interactive demonstration of our models is provided at https://bit.ly/3niE5FS.