The BdryMatérn GP: Reliable incorporation of boundary information on irregular domains for Gaussian process modeling

• URL: http://arxiv.org/abs/2507.09178v1
• Date: Sat, 12 Jul 2025 07:53:49 GMT
• Title: The BdryMatérn GP: Reliable incorporation of boundary information on irregular domains for Gaussian process modeling
• Abstract summary: We propose a novel BdryMat'ern GP modeling framework, which can reliably integrate Dirichlet, Neumann and Robin boundaries on an irregular connected domain.<n>We also present an efficient approximation procedure for the BdryMat'ern kernel using finite element modeling with rigorous error analysis.
• Score: 11.009869781698477
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Gaussian processes (GPs) are broadly used as surrogate models for expensive computer simulators of complex phenomena. However, a key bottleneck is that its training data are generated from this expensive simulator and thus can be highly limited. A promising solution is to supplement the learning model with boundary information from scientific knowledge. However, despite recent work on boundary-integrated GPs, such models largely cannot accommodate boundary information on irregular (i.e., non-hypercube) domains, and do not provide sample path smoothness control or approximation error analysis, both of which are important for reliable surrogate modeling. We thus propose a novel BdryMat\'ern GP modeling framework, which can reliably integrate Dirichlet, Neumann and Robin boundaries on an irregular connected domain with a boundary set that is twice-differentiable almost everywhere. Our model leverages a new BdryMat\'ern covariance kernel derived in path integral form via a stochastic partial differential equation formulation. Similar to the GP with Mat\'ern kernel, we prove that sample paths from the BdryMat\'ern GP satisfy the desired boundaries with smoothness control on its derivatives. We further present an efficient approximation procedure for the BdryMat\'ern kernel using finite element modeling with rigorous error analysis. Finally, we demonstrate the effectiveness of the BdryMat\'ern GP in a suite of numerical experiments on incorporating broad boundaries on irregular domains.

Related papers

• Enforcing Dirichlet Boundary Conditions in Operator Learning [1.6615337656760854]
  We propose an architecture which satisfies homogeneous Dirichlet boundary conditions.<n>We prove universal approximation for the resulting architecture.<n>We also prove for a broad class of kernel-integral neural operators.
  arXiv  Detail & Related papers  (2026-08-27T15:40:29Z)
• A Mean Curvature Approach to Boundary Detection: Geometric Insights for Unsupervised Learning [52.452902154360565]
  We introduce Mean Curvature Boundary Points (MCBP), a novel geometric framework grounded in Geometric Machine Learning.<n>MCBP explicitly models the intrinsic curvature of the data manifold and computes pointwise mean curvature without requiring principled manifold parametrization.<n>Experiments on synthetic and real-world datasets demonstrate that MCBP consistently improves clustering performance.
  arXiv  Detail & Related papers  (2026-05-05T20:19:09Z)
• A Novel Method for Enforcing Exactly Dirichlet, Neumann and Robin Conditions on Curved Domain Boundaries for Physics Informed Machine Learning [0.19336815376402716]
  We present a systematic method for exactly enforcing Dirichlet, Neumann, and Robin type conditions on general quadrilateral domains with arbitrary curved boundaries.<n>Our method is built upon exact mappings between general quadrilateral domains and the standard domain.
  arXiv  Detail & Related papers  (2026-03-23T12:30:33Z)
• Weighted Euclidean Distance Matrices over Mixed Continuous and Categorical Inputs for Gaussian Process Models [1.22995445255292]
  We introduce WEighted Euclidean distance matrices Gaussian Process (WEGP)<n>We construct the kernel function for each categorical input by estimating the Euclidean distance matrix (EDM) among all categorical choices of this input.<n>We achieve superior performance on both synthetic and real-world optimization problems.
  arXiv  Detail & Related papers  (2025-03-04T13:55:22Z)
• Compactly-supported nonstationary kernels for computing exact Gaussian processes on big data [2.8377382540923004]
  The Gaussian process (GP) is a widely used machine learning method with implicit uncertainty characterization.<n>Traditional implementations of GPs involve stationary kernels that limit their flexibility.<n>We derive an alternative kernel that can discover and encode both sparsity and nonstationarity.
  arXiv  Detail & Related papers  (2024-11-07T20:07:21Z)
• Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds [77.4346324549323]
  We show that a step size agnostic to the curvature of the manifold achieves a curvature-independent and linear last-iterate convergence rate. To the best of our knowledge, the possibility of curvature-independent rates and/or last-iterate convergence has not been considered before.
  arXiv  Detail & Related papers  (2023-06-29T01:20:44Z)
• Stochastic Marginal Likelihood Gradients using Neural Tangent Kernels [78.6096486885658]
  We introduce lower bounds to the linearized Laplace approximation of the marginal likelihood. These bounds are amenable togradient-based optimization and allow to trade off estimation accuracy against computational complexity.
  arXiv  Detail & Related papers  (2023-06-06T19:02:57Z)
• Score-based Diffusion Models in Function Space [137.70916238028306]
  Diffusion models have recently emerged as a powerful framework for generative modeling.<n>This work introduces a mathematically rigorous framework called Denoising Diffusion Operators (DDOs) for training diffusion models in function space.<n>We show that the corresponding discretized algorithm generates accurate samples at a fixed cost independent of the data resolution.
  arXiv  Detail & Related papers  (2023-02-14T23:50:53Z)
• A mixed-categorical correlation kernel for Gaussian process [0.0]
  We present a kernel-based approach that extends continuous exponential kernels to handle mixed-categorical variables. The proposed kernel leads to a new GP surrogate that generalizes both the continuous relaxation and the Gower distance based GP models.
  arXiv  Detail & Related papers  (2022-11-15T16:13:04Z)
• The Schr\"odinger Bridge between Gaussian Measures has a Closed Form [101.79851806388699]
  We focus on the dynamic formulation of OT, also known as the Schr"odinger bridge (SB) problem. In this paper, we provide closed-form expressions for SBs between Gaussian measures.
  arXiv  Detail & Related papers  (2022-02-11T15:59:01Z)
• Non-Gaussian Gaussian Processes for Few-Shot Regression [71.33730039795921]
  We propose an invertible ODE-based mapping that operates on each component of the random variable vectors and shares the parameters across all of them. NGGPs outperform the competing state-of-the-art approaches on a diversified set of benchmarks and applications.
  arXiv  Detail & Related papers  (2021-10-26T10:45:25Z)
• Gaussian Process Uniform Error Bounds with Unknown Hyperparameters for Safety-Critical Applications [71.23286211775084]
  We introduce robust Gaussian process uniform error bounds in settings with unknown hyper parameters. Our approach computes a confidence region in the space of hyper parameters, which enables us to obtain a probabilistic upper bound for the model error. Experiments show that the bound performs significantly better than vanilla and fully Bayesian processes.
  arXiv  Detail & Related papers  (2021-09-06T17:10:01Z)
• Exact imposition of boundary conditions with distance functions in physics-informed deep neural networks [0.5804039129951741]
  We introduce geometry-aware trial functions in artifical neural networks to improve the training in deep learning for partial differential equations. To exactly impose homogeneous Dirichlet boundary conditions, the trial function is taken as $phi$ multiplied by the PINN approximation. We present numerical solutions for linear and nonlinear boundary-value problems over domains with affine and curved boundaries.
  arXiv  Detail & Related papers  (2021-04-17T03:02:52Z)
• Adversarial Robustness Guarantees for Gaussian Processes [22.403365399119107]
  Gaussian processes (GPs) enable principled computation of model uncertainty, making them attractive for safety-critical applications. We present a framework to analyse adversarial robustness of GPs, defined as invariance of the model's decision to bounded perturbations. We develop a branch-and-bound scheme to refine the bounds and show, for any $epsilon > 0$, that our algorithm is guaranteed to converge to values $epsilon$-close to the actual values in finitely many iterations.
  arXiv  Detail & Related papers  (2021-04-07T15:14:56Z)
• Mat\'ern Gaussian Processes on Graphs [67.13902825728718]
  We leverage the partial differential equation characterization of Mat'ern Gaussian processes to study their analog for undirected graphs. We show that the resulting Gaussian processes inherit various attractive properties of their Euclidean and Euclidian analogs. This enables graph Mat'ern Gaussian processes to be employed in mini-batch and non-conjugate settings.
  arXiv  Detail & Related papers  (2020-10-29T13:08:07Z)
• SLEIPNIR: Deterministic and Provably Accurate Feature Expansion for Gaussian Process Regression with Derivatives [86.01677297601624]
  We propose a novel approach for scaling GP regression with derivatives based on quadrature Fourier features. We prove deterministic, non-asymptotic and exponentially fast decaying error bounds which apply for both the approximated kernel as well as the approximated posterior.
  arXiv  Detail & Related papers  (2020-03-05T14:33:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.