paper-with-me

홈 › Papers

Stochastic PDE representation of random fields for large-scale Gaussian process regression and statistical finite element analysis

2023-05-23 · Kim Jie Koh, Fehmi Cirak

The efficient representation of random fields on geometrically complex domains is crucial for Bayesian modelling in engineering and machine learning. Today's prevalent random field representations are either intended for unbounded domains or are too restrictive in terms of possible field properties. Because of these limitations, techniques leveraging the historically established link between stochastic PDEs (SPDEs) and random fields have been gaining interest. The SPDE representation is especially appealing for engineering applications which already have a finite element discretisation for solving the physical conservation equations. In contrast to the dense covariance matrix of a random field, its inverse, the precision matrix, is usually sparse and equal to the stiffness matrix of an elliptic SPDE. We use the SPDE representation to develop a scalable framework for large-scale statistical finite element analysis and Gaussian process (GP) regression on complex geometries. The statistical finite element method (statFEM) introduced by Girolami et al. (2022) is a novel approach for synthesising measurement data and finite element models. In both statFEM and GP regression, we use the SPDE formulation to obtain the relevant prior probability densities with a sparse precision matrix. The properties of the priors are governed by the parameters and possibly fractional order of the SPDE so that we can model on bounded domains and manifolds anisotropic, non-stationary random fields with arbitrary smoothness. The observation models for statFEM and GP regression are such that the posterior probability densities are Gaussians with a closed-form mean and precision. The respective mean vector and precision matrix and can be evaluated using only sparse matrix operations. We demonstrate the versatility of the proposed framework and its convergence properties with Poisson and thin-shell examples.

📄 PDF Abstract BibTeX arXiv:2305.13879

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Methods 이 논문이 사용한 방법론

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Similar Papers 제목 키워드 기반

Forming A Random Field via Stochastic Cliques: From Random Graphs to Fully Connected Random Fields

2015-06-30 · Mohammad Javad Shafiee, Alexander Wong, Paul Fieguth

Random fields have remained a topic of great interest over past decades for the purpose of structured inference, especially for problems such as image segmentation. The local nodal interactions commonly used in such mode…

Image SegmentationSemantic Segmentation

Tree-structured Markov random fields with Poisson marginal distributions

2024-08-24 · Benjamin Côté, Hélène Cossette, Etienne Marceau

A new family of tree-structured Markov random fields for a vector of discrete counting random variables is introduced. According to the characteristics of the family, the marginal distributions of the Markov random field…

Efficient Parallel Estimation for Markov Random Fields

2013-03-27 · Michael J. Swain, Lambert E. Wixson, Paul B. Chou

We present a new, deterministic, distributed MAP estimation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The algorithm has been applied to segmentation problems in computer vision…

Learning low-dimensional representations of ensemble forecast fields using autoencoder-based methods

2025-02-06 · Jieyu Chen, Kevin Höhlein, Sebastian Lerch

Large-scale numerical simulations often produce high-dimensional gridded data that is challenging to process for downstream applications. A prime example is numerical weather prediction, where atmospheric processes are m…

Dimensionality Reduction

Learning in Markov Random Fields using Tempered Transitions

2009-12-01 · NeurIPS 2009 12 · Ruslan R. Salakhutdinov

Markov random fields (MRFs), or undirected graphical models, provide a powerful framework for modeling complex dependencies among random variables. Maximum likelihood learning in MRFs is hard due to the presence of the g…

Object Recognition