Worm, AnthonyView Profile (State University of New York at Binghamton), “Prioritized Grammar Enumeration: A novel method for symbolic regression” (2016)

You are here

Inside Signal Processing Newsletter Home Page

Top Reasons to Join SPS Today!

1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.

News and Resources for Members of the IEEE Signal Processing Society

Worm, AnthonyView Profile (State University of New York at Binghamton), “Prioritized Grammar Enumeration: A novel method for symbolic regression” (2016)

Worm, AnthonyView Profile (State University of New York at Binghamton), “Prioritized Grammar Enumeration: A novel method for symbolic regression” (2016) Advisor: Chiu, Kenneth

The main thesis of this work is that computers can be programmed to derive mathematical formula and relationships from data in an efficient, reproducible, and interpretable way. This problem is known as Symbolic Regression, the data driven search for mathematical relations as performed by a computer. In essence, this is a search over all possible equations to find those which best model the data on hand.

The authors propose Prioritized Grammar Enumeration (PGE) as a deterministic machine learning algorithm for solving Symbolic Regression. PGE works with a grammar’s rules and input data to prioritize the enumeration of expressions in that language. By making large reductions to the search space and introducing mechanisms for memoization, PGE can explore the space of all equations efficiently. Most notably, PGE provides reproducibility, a key aspect to any system used by scientists at large.

The authors then enhance the PGE algorithm in several ways. The authors enrich the equation equation types and application domains PGE can operate on. The authors deepen equation abstractions and relationships, add configuration to search operaters, and enrich the fitness metrics. The authors enable PGE to scale by decoupling the subroutines into a set of services.
Their algorithm experiments cover a range of problem types from a multitude of domains. Our experiments cover a variety of architectural and parameter configurations. Their results show PGE to have great promise and efficacy in automating the discovery of equations at the scales needed by tomorrow's scientific data problems.

Additionally, reproducibility has been a significant factor in the formulation and development of PGE. All supplementary materials, codes, and data can be found at github.com/verdverm/pypge.

Table of Contents:

Conferences & Events

SPS Social Media

IEEE SPS Educational Resources

IEEE SPS Resource Center

IEEE SPS YouTube Channel