aiqbench analysis
This research advances AI by integrating partial differential equations directly into probabilistic inference frameworks via factor graphs, offering a computationally efficient alternative to traditional sampling methods. The approach significantly reduces training time while maintaining high predictive accuracy and structured uncertainty quantification for physical systems modeled by advection and Fisher-KPP equations. By eliminating the need for global gradient-based optimization or posterior sampling, this method streamlines the application of physics-informed machine learning to complex real-world phenomena.
Efficient Message Passing for Partial Differential Equation Priors
arXiv:2609.32956v1 Announce Type: new Abstract: Prior information for real-world physical quantities is most elegantly expressed via partial differential equations (PDEs). In this paper, we propose a novel way to solve PDEs using probabilistic inference on a factor graph. In general, factor graphs provide a natural way to encode prior knowledge into a model as explicit factors; here, this knowledge is provided by a governing PDE, which narrows the solution space, while observed data further shape the posterior over the parameters. The approximate parameter posterior is inferred using message passing based on moment matching, without posterior sampling or global gradient-based optimization. We demonstrate our approach on the first-order advection and the second-order semi-linear Fisher-KPP equations, where it achieves predictive accuracy comparable to a standard baseline while providing structured predictive uncertainty. Moreover, the inferred posterior marginal means and uncertainty structure match more closely those obtained using Hamiltonian Monte Carlo than the evaluated mean-field variational inference baseline, while requiring up to 10x less training time in our experiments, with inference speed comparable to variational inference.
Abstract:Prior information for real-world physical quantities is most elegantly expressed via partial differential equations (PDEs). In this paper, we propose a novel way to solve PDEs using probabilistic inference on a factor graph. In general, factor graphs provide a natural way to encode prior knowledge into a model as explicit factors; here, this knowledge is provided by a governing PDE, which narrows the solution space, while observed data further shape the posterior over the parameters. The approximate parameter posterior is inferred using message passing based on moment matching, without posterior sampling or global gradient-based optimization. We demonstrate our approach on the first-order advection and the second-order semi-linear Fisher-KPP equations, where it achieves predictive accuracy comparable to a standard baseline while providing structured predictive uncertainty. Moreover, the inferred posterior marginal means and uncertainty structure match more closely those obtained using Hamiltonian Monte Carlo than the evaluated mean-field variational inference baseline, while requiring up to 10x less training time in our experiments, with inference speed comparable to variational inference.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI); Machine Learning (stat.ML)
arXiv:2609.32956 [cs.LG]
(or arXiv:2609.32956v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.32956 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 267 words
Related coverage

[AINews] not much happened today
Latent Space · Oct 3, 2026

[AINews] not much happened today
Latent Space · Sep 18, 2026
Deep learning methods for inverse problems using connections between proximal operators and Hamilton-Jacobi equations
arXiv · Sep 14, 2026
Data-Efficient Time-Dependent PDE Surrogates: Graph Neural Simulators vs. Neural Operators
arXiv · Sep 30, 2026