@conference {4699, title = {AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity}, booktitle = {Advances in Neural Information Processing Systems 33 pre-proceedings (NeurIPS 2020)}, year = {2020}, month = {12/2020}, abstract = {

We present an improved method for symbolic regression that seeks to fit data toformulas that are Pareto-optimal, in the sense of having the best accuracy for a givencomplexity. It improves on the previous state-of-the-art by typically being ordersof magnitude more robust toward noise and bad data, and also by discovering manyformulas that stumped previous methods. We develop a method for discoveringgeneralized symmetries (arbitrary modularity in the computational graph of aformula) from gradient properties of a neural network fit. We use normalizingflows to generalize our symbolic regression method to probability distributionsfrom which we only have samples, and employ statistical hypothesis testing toaccelerate robust brute-force search.

GitHub:\ https://github.com/SJ001/AI-Feynman
Readthedocs: https://ai-feynman.readthedocs.io/en/latest/
Database:\ https://space.mit.edu/home/tegmark/aifeynman.html
}, author = {Silviu-Marian Udrescu and Andrew Tan and Jianhai Feng and Orisvaldo Neto and Tailin Wu and Max Tegmark} }