Bayesian Physics-Informed Neural Networks
- B-PINNs are probabilistic extensions of PINNs that replace point estimates with Bayesian inference to yield a posterior distribution over neural and physical parameters.
- They integrate governing equations with observational data to address both forward simulations and inverse problems, supporting robust uncertainty quantification and model comparison.
- Various inference methods such as variational inference, SVGD, and HMC are employed, though computational cost and approximation challenges remain key considerations.
Bayesian Physics-Informed Neural Networks (B-PINNs) are probabilistic extensions of Physics-Informed Neural Networks in which neural-network parameters, and in many inverse formulations physical parameters as well, are treated as random variables inferred from observational data together with PDE residuals, boundary conditions, and initial conditions. Rather than returning a single deterministic surrogate, a B-PINN defines a posterior over admissible solution functions and thereby supports uncertainty quantification in forward simulation, inverse identification, and data assimilation for systems governed by differential equations or related forward operators (Nilabh et al., 2023, Stock et al., 2022).
1. Definition, scope, and relation to deterministic PINNs
A standard PINN approximates an unknown field with a neural network and embeds governing equations in the training objective as soft constraints. A B-PINN retains that structure but replaces point estimation of the network parameters by Bayesian inference. In the most common formulation, priors are assigned to the weights and biases, the likelihood contains both observational misfit and physics residual terms, and the output is a posterior distribution over functions rather than a single best-fit solution (Nilabh et al., 2023).
Several works make explicit that deterministic PINN training can be interpreted as a Maximum A Posteriori estimate inside a broader Bayesian model. In this view, the familiar weighted sum of data misfit, PDE residual, and regularization terms is the negative log-posterior under chosen priors and likelihoods; the B-PINN keeps the full posterior instead of collapsing it to a single optimizer (Mohammad-Djafari, 18 Feb 2025, Mohammad-Djafari et al., 2 Dec 2025).
The Bayesian formulation has also been used to infer hyperparameters that control relative weighting between equation and boundary contributions, and to rank architectures by evidence under a Laplace approximation. This suggests that B-PINNs are not only uncertainty-aware surrogates but also a framework for model comparison and loss balancing (Graczyk et al., 2023).
2. Probabilistic and physics-informed formulation
The generic B-PINN construction combines a neural surrogate with a probabilistic model of data and physics. A representative posterior has the form
where denotes network parameters, denotes physical parameters when they are unknown, denotes observational data, physics residual data, and boundary or initial-condition data (Stock et al., 2022, Pensoneault et al., 2023).
A concrete example is the B-PINN for engineered nanoparticle mobility in a contaminated aquifer. There, the aqueous concentration and retained concentration are approximated by two fully connected feed-forward neural networks, and the governing physics is a coupled advection-dispersion-retention system (Nilabh et al., 2023):
The same study imposes a Dirichlet inlet condition, a Neumann outlet condition, and zero initial concentrations. Physics enters the objective through residuals of both the mass-balance equation and the attachment-detachment kinetics, while data terms can be added for breakthrough curves and retention profiles (Nilabh et al., 2023).
In that representative implementation, the two networks each use 6 hidden layers, 50 neurons per hidden layer, and sigmoid activation. Physics is enforced at 15,000 interior collocation points generated by Latin Hypercube Sampling, with 3,000 additional collocation points on boundaries and the initial line. This is not a universal architecture for B-PINNs, but it illustrates the standard design pattern: continuous neural surrogates, automatic differentiation for residual evaluation, and probabilistic coupling of data and governing equations (Nilabh et al., 2023).
3. Inference mechanisms and uncertainty quantification
Exact posterior inference is generally intractable because B-PINNs are high-dimensional nonlinear latent-variable models. As a result, the literature uses several approximate or sampling-based schemes.
| Inference strategy | Representative paper | Characteristic use |
|---|---|---|
| Variational inference | (Nilabh et al., 2023) | Diagonal Gaussian posterior over network weights and, in inverse mode, physical parameters |
| SVGD | (Stock et al., 2022) | Particle-based posterior approximation for inertia and damping identification |
| HMC | (Imanov, 1 Feb 2026) | Gradient-based posterior sampling in multi-fidelity Bayesian PINNs |
| EKI | (Pensoneault et al., 2023) | Ensemble Kalman inversion for efficient high-dimensional inverse inference |
| Laplace approximation | (Graczyk et al., 2023) | Gaussian posterior around MAP and evidence-based model selection |
The uncertainty most commonly reported by B-PINNs is predictive uncertainty induced by posterior variation in the network parameters. A standard decomposition writes the predictive variance as
0
where 1 encodes observation noise and 2 denotes the random network parameters (Imanov, 1 Feb 2026).
Later work makes that decomposition explicit at the architectural level. A heteroscedastic B-PINN for insulation ageing outputs both a predictive mean and an input-dependent variance, so epistemic uncertainty is estimated from Monte Carlo variation over posterior weight samples while aleatoric uncertainty is estimated by averaging predicted variances across those samples (Ramirez et al., 7 Jan 2026). A different line of work augments B-PINNs with residual-based error bounds, producing an error-aware uncertainty term that inflates predictive variance when the residual implies poor compliance with the differential equation, especially outside the trained region or under undertraining (Graf et al., 2022).
4. Forward simulation and inverse identification
One of the defining features of B-PINNs is that the same formalism supports both forward and inverse problems. In forward mode, physical parameters are fixed and the posterior is sought over network parameters. In inverse mode, unknown coefficients are appended to the random parameter vector and inferred jointly with the network (Nilabh et al., 2023).
The groundwater nanoparticle study provides a clear example. In the forward problem, the B-PINN predicts breakthrough curves and retention profiles while quantifying uncertainty, and the forward model is validated against COMSOL Multiphysics with a minimal RMSE of 3 (Nilabh et al., 2023). In the inverse problem, synthetic data generated with
4
and additive Gaussian noise are used to infer the attachment and detachment coefficients. The reported approximate posteriors are
5
showing recovery close to the synthetic ground truth with nonzero posterior uncertainty (Nilabh et al., 2023).
A structurally similar use appears in power-system identification, where a B-PINN estimates inertia 6 and damping 7 in the swing equation of a single-machine infinite-bus system. There the physical parameters are explicit Bayesian variables in the physics residual rather than ordinary network weights, and the resulting posterior standard deviations provide a confidence measure that correlates with estimation error (Stock et al., 2022).
The inverse-problem literature also formalizes supervised and unsupervised B-PINN training when the forward model is a linear operator 8. In that setting, the deterministic PINN objective is derived as MAP estimation from a Bayesian model with data likelihood, physics likelihood, and priors on both the unknown field and the network parameters. This connects B-PINNs directly to classical regularization and Bayesian inverse theory (Mohammad-Djafari, 18 Feb 2025).
5. Representative application domains
B-PINNs have been deployed across a wide range of physical systems. In subsurface transport, they have been used to model the mobility of engineered nanoparticles in a contaminated aquifer, coupling advection-dispersion-retention physics with uncertainty-aware parameter inference for groundwater remediation scenarios (Nilabh et al., 2023).
In fire-front modeling, a Bayesian PINN has been applied to the level-set equation for wildfires. That work combines PDE residuals, a forecast likelihood that improves temporal continuity under abrupt changes in wind direction, and an observation likelihood that assimilates fire-front measurements, yielding uncertainty-aware predictions on real-world wildfire data (Dabrowski et al., 2022).
In prognostics, a B-PINN based on a heat diffusion PDE has been used to estimate transformer oil temperature and propagate that estimate to insulation ageing and loss-of-life. A later heteroscedastic extension jointly models epistemic and aleatoric uncertainty and reports improved predictive accuracy and calibration relative to deterministic PINNs and dropout-based baselines (Ramirez et al., 19 Sep 2025, Ramirez et al., 7 Jan 2026).
In noisy MIMO vehicle systems, the Damper-B-PINN introduces a neuron forward process inspired by mechanical dampers, combines it with Bayesian dropout, and embeds wheel-load physics in the loss to estimate dynamic wheel load across ten datasets and fourteen vehicle types (Zeng et al., 28 Feb 2025). In large or multi-scale PDEs, domain decomposition has been combined with local B-PINNs to form \$PINN, where global uncertainty is assembled from local Bayesian solutions coupled through flux continuity across subdomain interfaces (Figueres et al., 26 Apr 2025). The framework has also been adapted to multivariate time series with unknown governing equations by first extracting PDEs from historical data and then enforcing the learned relations in PINNs, B-PINNs, and Bayesian linear regression (Mortezanejad et al., 26 Mar 2025).
6. Limitations, misconceptions, and current directions
A common misconception is that “Bayesian” automatically implies calibrated uncertainty. Multiple studies explicitly caution against that interpretation. Simple Gaussian variational approximations may under-represent complex posterior structure (Nilabh et al., 2023). Posterior variance can be deceptively small in regions with large error, especially far from labeled points, so variance alone is not always a sufficient criterion for trust or pseudo-labeling (Innerebner et al., 2 Jul 2025). In error-aware formulations, posterior variance from the B-PINN alone can fail to cover the discrepancy between the surrogate and the true solution, motivating residual-based correction terms (Graf et al., 2022).
A second misconception is that B-PINN refers to a single inference algorithm. In practice, the literature spans variational inference, SVGD, HMC, Laplace approximation, dropout-based approximations, and ensemble Kalman inversion. These methods do not produce identical posteriors, and some are only approximate Bayesian procedures. EKI-based B-PINNs, for example, are explicitly presented as efficient approximate Bayesian inference tools rather than exact posterior samplers (Pensoneault et al., 2023).
Computational cost remains a persistent issue. HMC-based B-PINNs can be accurate but are expensive for large neural parameter spaces, which is one reason alternative schemes such as EKI, Laplace methods, dropout variants, and epinet-based uncertainty surrogates have been proposed (Nair et al., 25 Mar 2025). Current scaling directions therefore include multi-fidelity architectures that combine sparse high-fidelity data with abundant low-fidelity simulations, domain decomposition strategies that compute local uncertainty concurrently, and heteroscedastic formulations that separate epistemic and aleatoric effects rather than conflating them in a single predictive band (Imanov, 1 Feb 2026, Figueres et al., 26 Apr 2025, Ramirez et al., 7 Jan 2026).
In that sense, B-PINNs are best understood not as a fixed model class but as a research program in probabilistic scientific machine learning: encode governing equations in the learning objective, endow the surrogate with a posterior rather than a point estimate, and use that posterior for prediction, inversion, model comparison, and decision support under sparse or noisy data.