Tim Weiland
banner
timwei.land
Tim Weiland
@timwei.land
PhD student @ ELLIS, IMPRS-IS.
Working on physics-informed ML and probabilistic numerics at Philipp Hennig's group in Tübingen.
https://timwei.land
Love the skeleton marketing
April 24, 2025 at 6:37 AM
Excited to mention that this work was accepted to AISTATS 2025.
Shout-out to my amazing collaborators Marvin Pförtner & @philipphennig.bsky.social!
March 17, 2025 at 12:25 PM
In summary: The SPDE perspective brings us more flexible prior dynamics and highly efficient inference mechanisms through sparsity.

📄 Curious to learn more? Our preprint: arxiv.org/abs/2503.08343
💻 And there's Julia code: github.com/timweiland/G... & github.com/timweiland/D...

8/8
Flexible and Efficient Probabilistic PDE Solvers through Gaussian Markov Random Fields
Mechanistic knowledge about the physical world is virtually always expressed via partial differential equations (PDEs). Recently, there has been a surge of interest in probabilistic PDE solvers -- Bay...
arxiv.org
March 17, 2025 at 12:25 PM
So here's the full pipeline in a nutshell:
Construct a linear stochastic proxy to the PDE you want to solve -> discretize to get a GMRF -> Gauss-Newton + sparse linear algebra to get a posterior which is informed about your data and the PDE. 7/8
March 17, 2025 at 12:25 PM
Turns out that these "physics-informed priors" indeed then converge much faster (in terms of the discretization resolution) to the true solution. 6/8
March 17, 2025 at 12:25 PM
But wait a sec...
With this approach, we express our prior belief through an SPDE.
Then why should we use the Whittle-Matérn SPDE?
Instead, why don't we construct a linear SPDE that more closely captures the dynamics we care about? 5/8
March 17, 2025 at 12:25 PM
Still with me?
So we get a FEM representation of the solution function, with stochastic weights given by a GMRF.
Now we just need to "inform" these weights about a discretization of the PDE we want to solve.
These computations are highly efficient, due to the magic of ✨sparse linear algebra✨. 4/8
March 17, 2025 at 12:25 PM
Matérn GPs are solutions to the Whittle-Matérn stochastic PDE (SPDE).
In 2011, Lindgren et al. used the finite element method (FEM) to discretize this SPDE.
This results in a Gaussian Markov Random Field (GMRF), a Gaussian with a sparse precision matrix. 3/8
March 17, 2025 at 12:25 PM
In the context of probabilistic numerics, people have been using Gaussian processes to model the solution of PDEs.
Numerically solving the PDE then becomes a task of Bayesian inference.
This works well, but the underlying computations involve expensive dense covariance matrices.
What can we do? 2/8
March 17, 2025 at 12:25 PM
Interestingly enough, these reparameterizations can indeed cause trouble in Bayesian deep learning. Check out arxiv.org/abs/2406.03334, which uses this same ReLU example as motivation :)
Reparameterization invariance in approximate Bayesian inference
Current approximate posteriors in Bayesian neural networks (BNNs) exhibit a crucial limitation: they fail to maintain invariance under reparameterization, i.e. BNNs assign different posterior densitie...
arxiv.org
February 16, 2025 at 1:25 PM
My recs: Doom emacs to get started; org mode + org-roam for notes, org-roam-bibtex + zotero auto-export for reference management; dired for file navigation; tramp mode for remote dev; gptel for LLMs; julia snail for julia, make sure you set up lsp. Start small and expand gradually, see what sticks
December 30, 2024 at 12:04 PM
I would also like to be added :) Great idea, thanks for this!
November 19, 2024 at 5:44 PM
ELLIS PhD student here, I would also appreciate getting added :)
November 19, 2024 at 5:44 PM