2 papers
cs.LG2020
AI Feynman 2.0: Pareto-optimal symbolic regression exploiting graph modularity
Silviu-Marian Udrescu, Andrew Tan, Jiahai Feng +3
We present an improved method for symbolic regression that seeks to fit data to formulas that are Pareto-optimal, in the sense of having the best accuracy for a given complexity. I…
cs.CC2020
Approximating Boolean Functions with Disjunctive Normal Form
Yunhao Yang, Andrew Tan
The theorem states that: Every Boolean function can be by a Disjunctive Normal Form (DNF) of size . This paper will demonstrate this theorem in…