基于贝叶斯树邻接文法的方程发现

作者 PulseAugur 编辑部 · [1 个来源] · 2026-09-28 04:00

研究人员引入了一种使用树邻接文法（TAGs）的贝叶斯方程发现方法。该方法定义了树结构和参数上的生成先验，并采用可逆跳跃马尔可夫链蒙特卡洛（Reversible-Jump MCMC）采样器来推断联合后验分布。该方法在模拟多项式NARX系统、Silverbox基准测试和波浪载荷数据上进行了测试，证明了其在量化不确定性和拟合动力学系统的物理信息模型方面的能力。 AI

影响这项研究推进了动力学系统中方程发现的方法，有望提高AI模型在科学应用中的可解释性和准确性。

排序理由该集群包含一篇详细介绍方程发现新方法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv stat.ML 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 0 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 该集群包含一篇详细介绍方程发现新方法的学术论文。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, model release; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: 10 days old; Aged out of breaking-news scoring windows; ranking reflects the durable signal from the full source set.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv stat.ML TIER_1 English(EN) · Christopher A. Lindley, Nikolaos Dervilis, Keith Worden · 2026-09-28 04:00

Bayesian 树邻接文法方程发现

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 t…

本文如何被排名

报道来源 [1]

Bayesian 树邻接文法方程发现

相关实体

相关话题