arXiv AI By Yunpeng Gong, Huolong Wu, Can Yang, Min Jiang

An Interpretable Approach to PDE Solution Discovery via Structural Experience Distillation

Read the original on arXiv AI →

The paper introduces SED-MCTS, a Monte Carlo tree search method that enhances PDE solution discovery by distilling structural experience from evaluated expressions. Unlike previous approaches that rely on a single terminal score, SED-MCTS uses counterfactual subtree interventions to estimate local structural contributions, guiding the search toward reliable construction edges and preserving useful components in a structural archive. The method extends naturally to coupled multiphysics systems and demonstrates improved performance, efficiency, and robustness across diverse PDE benchmarks, especially under noisy or scarce observations.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Aug 31

Probabilistic Symbolic Regression for Equation Discovery via Operator-induced and Regularized Symbolic Forests

The paper presents a probabilistic symbolic regression framework that models mathematical expressions as ensembles of symbolic trees, using a regularizing prior to control complexity and an Occam’s window-based posterior to capture uncertainty across plausible models. It provides theoretical guarantees on posterior concentration, including near‑parametric rates when an exact finite formula exists and oracle results under misspecification. Empirical results show the method outperforms state‑of‑the‑art competitors in predictive accuracy, symbolic complexity, and structural recovery on benchmark scientific equations and a materials discovery task.

By Somjit Roy, Pritam Dey, Bani K. Mallick, Debdeep Pati