REVIEW 2 major objections 5 minor 31 references
Reviewed by Pith at T0; open to challenge.
T0 means a machine referee read the full paper against a public rubric. The mark states how deep the mechanical check went, never who wrote it. the ladder, T0–T4 →
T0 review · glm-5.2
Unified Bayesian framework ties together fragmented GP methods for differential equations
2026-07-08 10:42 UTC pith:YFL6GVIT
load-bearing objection Solid unifying framework for GP-based differential equation methods; the nonlinear treatment has a real but moderate gap that should be addressed the 2 major comments →
A unified perspective of Gaussian process approximation for differential equations
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper identifies a single probabilistic structure — a Bayesian posterior combining a GP prior on the solution with a derivative-matching likelihood — that subsumes a fragmented literature of GP-based differential equation methods. The central mechanism is derivative matching: GP-estimated derivatives of the solution are required to agree with the right-hand side of the governing equation up to Gaussian noise. This yields a posterior over both the solution and unknown parameters, from which two scenarios follow naturally: parameter estimation (marginalizing out the solution) and solution prediction (conditioning on both data and equation constraints). The framework extends to weak forms,P
What carries the argument
Derivative matching likelihood: the GP-estimated differential operator applied to the solution (via operator-transformed kernels) is matched against the differential equation's right-hand side, producing a Gaussian likelihood that encodes the governing equation as data.
Load-bearing premise
For nonlinear differential equations, the framework evaluates the nonlinear source term at a separate GP regression estimate of the solution rather than jointly updating it with the posterior, which simplifies the mathematics but may lose joint uncertainty quantification and introduce approximation errors that the paper does not bound.
What would settle it
If an existing GP-for-PDE method cannot be expressed as a special case of the derivative-matching likelihood with operator-transformed kernels, the claim of unification would be weakened.
If this is right
- Researchers can systematically compare existing GP-for-PDE methods by examining which modeling choices they make within the unified framework, rather than treating each method as an independent proposal.
- The framework provides a template for deriving new methods: choosing different priors, kernel families, or inference strategies within the unified structure yields new methods whose relationship to existing ones is immediately clear.
- The extension to weak forms connects GP-based methods to the variational and finite-element traditions, potentially enabling hybrid approaches that combine GP flexibility with finite-element structure.
- The parameter-to-solution pushforward map provides a principled way to propagate parameter uncertainty through to solution predictions, which is critical for uncertainty quantification in inverse problems.
Where Pith is reading between the lines
- The decoupling of the nonlinear source term evaluation (using a separate GP regression estimate) suggests that the framework's unification may be exact for linear PDEs but approximate for nonlinear ones — a distinction the paper does not sharply draw.
- If the framework is adopted as a reference, new methods could be evaluated not just by performance but by where they sit within the taxonomy: which prior, which likelihood factorization, which marginalization order.
- The duality between placing a prior on the solution (this framework) versus on the forcing (latent force models) hints at a deeper symmetry that might be exploited for computational advantage — e.g., choosing whichever formulation yields smaller covariance matrices for a given problem.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This manuscript presents a unified Bayesian perspective on Gaussian process (GP) approximation for differential equations. The core idea is a "derivative matching" mechanism: a GP prior is placed on the solution, and a likelihood is constructed by matching GP-estimated derivatives (obtained via linear operator-transformed kernels) with differential equation constraints. The framework accommodates both parameter estimation (Scenario I) and solution approximation (Scenario II), and the author shows how physics-informed GPs, latent force models, and parameter estimation techniques can be interpreted as special cases. The note also extends the formulation to weak/variational forms.
Significance. The paper addresses a genuine gap in the literature: the GP-for-DEs field is fragmented, and a clean unifying framework that clarifies the relationships among existing methods is valuable. The derivative matching interpretation is a useful conceptual lens, and the reduction to existing methods in Section 4 is largely convincing for the linear case. The extension to weak forms (Section 4) broadens the scope. The framework is derived from standard Bayesian principles without circularity, and the two-scenario structure (parameter estimation vs. equation solving) is pedagogically effective.
major comments (2)
- Eq. (25): The joint density p_{U*,Y,R|φ,θ} is written as Gaussian with mean [0; 0; −g_θ(ũ)], where ũ = κ(S',S)(K+σ²_y I)^{-1}y. However, y is simultaneously the second component of the random vector (U*, Y, R) in this density. When g_θ is nonlinear, the mean of the third component is a nonlinear function of the second component's realization, so the joint density is not Gaussian — it is a Gaussian with a data-dependent, nonlinear mean. The conditional Gaussian formula applied to derive Eq. (27) is therefore only valid if ũ is treated as a pre-computed constant (from observed data) rather than as a function of the random variable Y. This is the same plug-in approximation introduced in Eq. (9), but its consequences for the Gaussianity claim in Eq. (25) are not acknowledged. The paper should explicitly state that Eq. (25) is Gaussian only under the plug-in approximation (i.e., treating ũ as
- Eq. (9) and the surrounding discussion: The approximation g_θ(u) ≈ g_θ(ũ) decouples the nonlinear source term from the latent state U. This means the likelihood p_{R|φ,θ,U} in Eq. (10) depends on u only through the linear term (L_φ ⊗ Id)κ(S',S)K^{-1}u, breaking the nonlinear coupling between U and θ. The paper should discuss the implications of this decoupling more explicitly: (a) it means the framework does not exactly reduce to methods that handle nonlinearities through joint sampling, iterative linearization, or other coupling mechanisms; (b) for highly nonlinear systems, the plug-in estimate ũ (which is based on GP regression using only observational data y, without incorporating the differential equation constraint) may be a poor proxy for the latent state. A brief discussion of when this approximation is reasonable and when it may fail would strengthen the paper's honesty about its
minor comments (5)
- The notation in Eq. (25) uses g_θ(ũ) in the mean vector, but ũ is defined in Eq. (9) as a function of y. It would help to add a remark at Eq. (25) reminding the reader that ũ is computed from the observed data y and treated as fixed.
- Section 4, 'Latent force models' paragraph: The duality discussion (prior on u with likelihood via L vs. prior on f with recovery via L^{-1}) is insightful but could be stated more precisely — e.g., clarifying whether the two formulations yield the same posterior or merely analogous structures.
- The paper would benefit from a concrete numerical example, even a simple one-dimensional ODE, to illustrate the framework end-to-end and show the plug-in approximation in action. This is not strictly necessary for a perspective note but would increase its pedagogical value.
- Reference [14] is listed as a 2025 arXiv preprint (arXiv:2506.17366); verify this citation is accurate and stable.
- Minor typographical issues: 'W e' appears split in the abstract and introduction; 'T o' appears split multiple times (e.g., before Eq. 7, Section 3.2 title area).
Simulated Author's Rebuttal
The referee raises two related and technically correct points about the plug-in approximation (ũ treated as a fixed constant) and its consequences for the Gaussianity claims in Eqs. (9) and (25). Both points are valid and require revision to the manuscript.
read point-by-point responses
-
Referee: Eq. (25): The joint density p_{U*,Y,R|φ,θ} is written as Gaussian with mean [0; 0; −g_θ(ũ)], where ũ = κ(S',S)(K+σ²_y I)^{-1}y. However, y is simultaneously the second component of the random vector (U*, Y, R) in this density. When g_θ is nonlinear, the mean of the third component is a nonlinear function of the second component's realization, so the joint density is not Gaussian — it is a Gaussian with a data-dependent, nonlinear mean. The conditional Gaussian formula applied to derive Eq. (27) is therefore only valid if ũ is treated as a pre-computed constant (from observed data) rather than as a function of the random variable Y. This is the same plug-in approximation introduced in Eq. (9), but its consequences for the Gaussianity claim in Eq. (25) are not acknowledged. The paper should explicitly state that Eq. (25) is Gaussian only under the plug-in approximation (i.e., treating ũ as
Authors: The referee is entirely correct on this point. In Eq. (25), the mean of the third component, −g_θ(ũ), involves ũ = κ(S',S)(K+σ²_y I)^{-1}y, which is a function of the random variable Y. When g_θ is nonlinear, the mean of R becomes a nonlinear function of the realization of Y within the same joint density, so the joint distribution p_{U*,Y,R|φ,θ} is not Gaussian in the strict sense. The conditional Gaussian formula used to derive Eq. (27) is valid only because ũ is treated as a pre-computed constant derived from the observed data y, not as a function of the random variable Y. This is indeed the same plug-in approximation introduced in Eq. (9), and we failed to make this connection explicit in the discussion surrounding Eq. (25). We will revise the manuscript to state clearly that the Gaussianity of the joint density in Eq. (25) holds under the plug-in approximation — that is, ũ is computed from the observed data y and treated as a fixed quantity, not as a function of the random variable Y. We will add a remark immediately after Eq. (25) to this effect, and cross-reference the approximation already introduced in Eq. (9). revision: yes
-
Referee: Eq. (9) and the surrounding discussion: The approximation g_θ(u) ≈ g_θ(ũ) decouples the nonlinear source term from the latent state U. This means the likelihood p_{R|φ,θ,U} in Eq. (10) depends on u only through the linear term (L_φ ⊗ Id)κ(S',S)K^{-1}u, breaking the nonlinear coupling between U and θ. The paper should discuss the implications of this decoupling more explicitly: (a) it means the framework does not exactly reduce to methods that handle nonlinearities through joint sampling, iterative linearization, or other coupling mechanisms; (b) for highly nonlinear systems, the plug-in estimate ũ (which is based on GP regression using only observational data y, without incorporating the differential equation constraint) may be a poor proxy for the latent state. A brief discussion of when this approximation is reasonable and when it may fail would strengthen the paper's honesty about its
Authors: The referee raises a valid and important point about the implications of the plug-in approximation in Eq. (9). We agree that the decoupling of the nonlinear source term g_θ(u) from the latent state U — replacing it with g_θ(ũ), where ũ is computed from observational data alone — has consequences that should be discussed more explicitly. On point (a): the referee is correct that this approximation means the framework does not exactly reduce to methods that handle nonlinearities through joint sampling of (U, θ), iterative linearization, or other coupling mechanisms. For instance, methods that perform full Bayesian inference over the joint posterior of (U, θ) with the nonlinear coupling intact — such as particle MCMC or Hamiltonian Monte Carlo over the full state-parameter space — are not exactly recovered by our framework. The plug-in approximation linearizes the dependence of the likelihood on U, which is what enables the marginalization in closed form. We will add a remark clarifying this limitation and noting which classes of methods are and are not exactly subsumed. On point (b): the referee is also correct that ũ, being based on GP regression using only observational data y without incorporating the differential equation constraint, may be a poor proxy for the latent state when the nonlinearity is strong or when the observational data is sparse relative to the complexity of the dynamics. The approximation is most reasonable when: (i) the observational data y is sufficiently dense and low-noise that ũ provides a good estimate of u; (ii) the nonlinearity g_θ is not so severe that small errors in ũ lead to large errors in g_θ(ũ); or (iii) the differential equation constraint is only weakly coupled to the solution (e.g., mildly nonlinear regimes). It may fail when the GP revision: yes
Circularity Check
No significant circularity: the unified Bayesian framework is derived from standard GP identities, and connections to existing methods are shown by reduction, not by fitting or self-definitional loops.
specific steps
-
self citation load bearing
[Section 3.1, special case (Eq. 22) and Section 4, parameter estimation paragraph]
"Special case: parameter estimation in nonlinear dynamics (see, e.g., [29]) Consider nonlinear dynamics described by the ordinary differential equation d/dt u(t) = g_θ(u(t))... The posterior distribution of the parameter θ is then given by π_post(θ|y,0) = p_{θ|Y,R}(θ|y,0) ∝ p_{R|θ,Y}(0|θ,y) p_θ(θ)."
Reference [29] (Ye and Guo) is co-authored by the present author and is cited as the origin of the parameter estimation special case. However, the citation is contextual rather than load-bearing: the derivation of Eq. (22) follows directly from the unified framework's Eq. (15) specialized to L=d/dt and f=0, using only standard Gaussian conditioning identities. The self-citation points to prior work that uses the same framework, but the mathematical derivation here does not depend on any unverified claim from [29]. This is normal scholarly attribution, not circular reasoning.
full rationale
The paper's core derivation chain is self-contained. Section 2 constructs the likelihood (Eq. 10) from two standard ingredients: (1) the conditional Gaussian formula for Z|φ,U (Eq. 8), which is a direct application of GP closure under linear operators — a textbook result [22] — and (2) the derivative matching condition p_{R|Z,θ} (Eq. 9), which enforces consistency between GP-estimated derivatives and the differential equation's right-hand side. The posterior (Eq. 11) follows by Bayes' rule. Scenario I (Eq. 15) marginalizes U using standard GP regression identities. Scenario II (Eq. 27) applies the conditional Gaussian formula to the joint in Eq. (25). The connections to existing methods in Section 4 are shown by specializing the framework's equations to match prior work (e.g., Eq. 29 for linear PDEs), not by fitting parameters or defining quantities in terms of the target result. The g_θ(ũ) plug-in (Eq. 9) is an approximation choice that the paper acknowledges introduces simplification; it is not a circular definition. Self-citations [15, 26, 27, 29] are used for context and attribution but do not form a load-bearing chain: the mathematical content of each cited result is either re-derived within the paper from first principles or is a standard GP identity. The one minor concern is that [29] is co-authored by the present author and is cited as the origin of the parameter estimation special case, but the derivation of Eq. (22) follows independently from Eq. (15). No step reduces to its inputs by construction.
Axiom & Free-Parameter Ledger
free parameters (3)
- σ²_y
- σ²_f
- κ(·,·)
axioms (3)
- standard math Gaussianity is preserved under linear operations.
- domain assumption The parameters φ, θ, and the state U are mutually independent under the prior.
- ad hoc to paper The nonlinear source term g_θ(u) can be approximated by evaluating it at a separate GP regression estimate ˜u.
read the original abstract
The use of Gaussian processes for approximating differential equations has expanded rapidly, leading to a growing, diverse, and fragmented body of numerical methods. We present a unified Bayesian perspective that places these techniques within a common probabilistic framework, based on a derivative matching interpretation for incorporating differential equation constraints into likelihood. This unified perspective supports both parameter estimation and solution approximation, and shows how a range of existing methods can be understood within it. This work aims to consolidate current developments and provide a foundation for future research.
Figures
Reference graph
Works this paper leans on
-
[1]
M. A. Alvarez, D. Luengo, and N. D. Lawrence. Linear latent force models using Gaussian processes.IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(11):2693—-2705, 2013
work page 2013
-
[2]
T. Bai, A. L. T eckentrup, and K. C. Zygalakis. Gaussian processes for Bayesian inverse problems associated with linear partial differential equations.Statistics and Computing, 34(4):139, 2024
work page 2024
- [3]
-
[4]
T. Beckers, J. Seidman, P. Perdikaris, and G. J. Pappas. Gaussian process port-Hamiltonian systems: Bayesian learning with physics prior. In2022 IEEE 61st Conference on Decision and Control (CDC), pages 1447–1453. IEEE, 2022
work page 2022
-
[5]
G. E. Box and G. C. Tiao.Bayesian Inference in Statistical Analysis. John Wiley & Sons, 1992
work page 1992
-
[6]
S. L. Brunton, J. L. Proctor, and J. N. Kutz. Discovering governing equations from data by sparse identification of nonlinear dynamical systems.Proceedings of the national academy of sciences, 113(15):3932–3937, 2016
work page 2016
-
[7]
B. Calderhead, M. Girolami, and N. Lawrence. Accelerating Bayesian inference over nonlinear differential equations with Gaussian processes.Advances in Neural Information Processing Systems, 21, 2008
work page 2008
-
[8]
R. T. Chen, Y. Rubanova, J. Bettencourt, and D. K. Duvenaud. Neural ordinary differential equations.Advances in Neural Information Processing Systems, 31, 2018
work page 2018
-
[9]
Y. Chen, B. Hosseini, H. Owhadi, and A. M. Stuart. Solving and learning nonlinear PDEs with Gaussian processes.Journal of Computational Physics, 447:110668, 2021
work page 2021
-
[10]
M. Daniels, L. Hodgkinson, and M. Mahoney. Uncertainty-aware diagnostics for physics- informed machine learning.arXiv preprint arXiv:2510.26121, 2025
-
[11]
O. Ghattas and K. Willcox. Learning physics-based models from data: perspectives from inverse problems and model reduction.Acta Numerica, 30:445–554, 2021
work page 2021
-
[12]
M. Girolami, E. Febrianto, G. Yin, and F. Cirak. The statistical finite element method (statFEM) for coherent synthesis of observation data and model predictions.Computer Methods in Applied Mechanics and Engineering, 375:113533, 2021
work page 2021
- [13]
-
[14]
Gaussian Processes and Reproducing Kernels: Connections and Equivalences
M. Kanagawa, P. Hennig, D. Sejdinovic, and B. K. Sriperumbudur. Gaussian Processes and Reproducing Kernels: Connections and Equivalences.arXiv preprint arXiv:2506.17366, 2025
work page internal anchor Pith review Pith/arXiv arXiv 2025
-
[15]
S. A. McQuarrie, A. Chaudhuri, K. E. Willcox, and M. Guo. Bayesian learning with Gaussian processes for low-dimensional representations of time-dependent nonlinear systems.Physica D: Nonlinear Phenomena, 475:134572, May 2025
work page 2025
-
[16]
R. Meng and X. Y ang. Sparse Gaussian processes for solving nonlinear PDEs.Journal of Computational Physics, 490:112340, 2023
work page 2023
-
[17]
K. P. Murphy.Machine Learning: A Probabilistic Perspective. MIT Press, 2012
work page 2012
-
[18]
B. Peherstorfer and K. Willcox. Data-driven operator inference for nonintrusive projection- based model reduction.Computer Methods in Applied Mechanics and Engineering, 306:196–215, 2016
work page 2016
-
[19]
Physics-Informed Gaussian Process Regression Generalizes Linear PDE Solvers
M. Pf ¨ortner, I. Steinwart, P. Hennig, and J. W enger. Physics-informed Gaussian process regres- sion generalizes linear PDE solvers.arXiv preprint arXiv:2212.12474, 2022
work page internal anchor Pith review Pith/arXiv arXiv 2022
- [20]
- [21]
-
[22]
C. E. Rasmussen and C. K. I. Williams.Gaussian Processes for Machine Learning. MIT Press, 2005
work page 2005
-
[23]
S. S¨arkk¨a. Linear operators and stochastic partial differential equations in Gaussian process regression. InArtificial Neural Networks and Machine Learning – ICANN 2011: 21st Interna- tional Conference on Artificial Neural Networks, Proceedings Part II 21, pages 151–158. Springer, 2011
work page 2011
-
[24]
F. T ronarp, H. Kersting, S. S¨arkk¨a, and P. Hennig. Probabilistic solutions to ordinary differential equations as nonlinear Bayesian filtering: A new perspective.Statistics and Computing, 29:1297– 1315, 2019
work page 2019
- [25]
-
[26]
W . Y an, C. Brune, and M. Guo. PDE-DKL: PDE-constrained deep kernel learning in high dimensionality.arXiv preprint arXiv:2501.18258, 2025. 15 Unified GP approximation for differential equations M. Guo
work page internal anchor Pith review Pith/arXiv arXiv 2025
- [27]
- [28]
- [29]
-
[30]
D. Y e, W . Y an, C. Brune, and M. Guo. PDE-constrained Gaussian process surrogate modeling with uncertain data locations.Advanced Modeling and Simulation in Engineering Sciences, 12(1), 2025
work page 2025
-
[31]
M. ´Alvarez, D. Luengo, and N. D. Lawrence. Latent force models. InProceedings of the 12th International Conference on Artificial Intelligence and Statistics, volume 5 ofProceedings of Machine Learning Research, pages 9–16, 2009. 16
work page 2009
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.