Equation discovery with Bayesian tree-adjoining grammars
arXiv:2609.31368v1 Announce Type: new Abstract: Tree-Adjoining Grammars (TAGs) have recently been introduced to Nonlinear System Identification (NLSI) as a means of encoding an entire model class as a finite set of grammatical rules, from which candidate models are assembled as trees. Existing TAG-…
Read the full story at arXiv stat.ML ↗
Timeline · 1 report
- 2026-09-28 04:00 · arXiv stat.ML
Equation discovery with Bayesian tree-adjoining grammars