English
Related papers

Related papers: Sparse Gaussian processes for solving nonlinear PD…

200 papers

Recently, diffusion models have achieved great success in generative tasks. Sampling from diffusion models is equivalent to solving the reverse diffusion stochastic differential equations (SDEs) or the corresponding probability flow…

Machine Learning · Computer Science 2023-11-03 Hanzhong Guo , Cheng Lu , Fan Bao , Tianyu Pang , Shuicheng Yan , Chao Du , Chongxuan Li

The key task of physical simulation is to solve partial differential equations (PDEs) on discretized domains, which is known to be costly. In particular, high-fidelity solutions are much more expensive than low-fidelity ones. To reduce the…

Machine Learning · Statistics 2020-06-11 Zheng Wang , Wei Xing , Robert Kirby , Shandian Zhe

We give an efficient algorithm for finding sparse approximate solutions to linear systems of equations with nonnegative coefficients. Unlike most known results for sparse recovery, we do not require {\em any} assumption on the matrix other…

Data Structures and Algorithms · Computer Science 2015-01-09 Aditya Bhaskara , Ananda Theertha Suresh , Morteza Zadimoghaddam

This paper deals with the numerical approximation of semilinear parabolic stochastic partial differential equation (SPDE) driven simultaneously by Gaussian noise and Poisson random measure, more realistic in modeling real world phenomena.…

Numerical Analysis · Mathematics 2020-11-19 Jean Daniel Mukam , Antoine Tambue

In this paper we use Gaussian processes (kernel methods) to learn mappings between trajectories of distinct differential equations. Our goal is to simplify both the representation and the solution of these equations. We begin by examining…

Dynamical Systems · Mathematics 2024-10-07 Jonghyeon Lee , Boumediene Hamzi , Yannis Kevrekidis , Houman Owhadi

We study the proximal gradient descent (PGD) method for $\ell^{0}$ sparse approximation problem as well as its accelerated optimization with randomized algorithms in this paper. We first offer theoretical analysis of PGD showing the bounded…

Optimization and Control · Mathematics 2017-09-06 Yingzhen Yang , Jiashi Feng , Nebojsa Jojic , Jianchao Yang , Thomas S. Huang

This paper presents a computationally efficient approach for Gaussian process model predictive control (GP-MPC), where Gaussian process (GP) regression is used to complement a baseline model of the system dynamics. The proposed method…

Optimization and Control · Mathematics 2026-05-12 Giannis Badakis , Mircea Lazar , Roland Toth

We consider Bayesian inference problems with computationally intensive likelihood functions. We propose a Gaussian process (GP) based method to approximate the joint distribution of the unknown parameters and the data. In particular, we…

Computation · Statistics 2018-03-15 Hongqiao Wang , Jinglai Li

The simulation of high-dimensional problems with manageable computational resource represents a long-standing challenge. In a series of our recent work [25, 17, 18, 24], a class of sparse grid DG methods has been formulated for solving…

Numerical Analysis · Mathematics 2019-06-27 Wei Guo

This work introduces a new method to efficiently solve optimization problems constrained by partial differential equations (PDEs) with uncertain coefficients. The method leverages two sources of inexactness that trade accuracy for speed:…

Optimization and Control · Mathematics 2019-05-20 Matthew J. Zahr , Kevin T. Carlberg , Drew P. Kouri

Gaussian Processes (GPs) are a generic modelling tool for supervised learning. While they have been successfully applied on large datasets, their use in safety-critical applications is hindered by the lack of good performance guarantees. To…

Machine Learning · Statistics 2019-08-27 David Reeb , Andreas Doerr , Sebastian Gerwinn , Barbara Rakitsch

This paper presents a method for approximate Gaussian process (GP) regression with tensor networks (TNs). A parametric approximation of a GP uses a linear combination of basis functions, where the accuracy of the approximation depends on…

Machine Learning · Statistics 2023-11-01 Clara Menzen , Eva Memmel , Kim Batselier , Manon Kok

Despite a large corpus of recent work on scaling up Gaussian processes, a stubborn trade-off between computational speed, prediction and uncertainty quantification accuracy, and customizability persists. This is because the vast majority of…

Machine Learning · Computer Science 2025-12-09 Marcus M. Noack , Mark D. Risser , Hengrui Luo , Vardaan Tekriwal , Ronald J. Pandolfi

Gaussian Processes (GP) is a staple in the toolkit of a spatial statistician. Well-documented computing roadblocks in the analysis of large geospatial datasets using Gaussian Processes have now been successfully mitigated via several recent…

Methodology · Statistics 2021-11-19 Abhirup Datta

Adaptive learning is necessary for non-stationary environments where the learning machine needs to forget past data distribution. Efficient algorithms require a compact model update to not grow in computational burden with the incoming data…

Machine Learning · Computer Science 2023-07-11 Vanessa Gómez-Verdejo , Emilio Parrado-Hernández , Manel Martínez-Ramón

In this paper a new approach for constructing \emph{multivariate} Gaussian random fields (GRFs) using systems of stochastic partial differential equations (SPDEs) has been introduced and applied to simulated data and real data. By solving a…

Methodology · Statistics 2013-07-08 Xiangping Hu , Daniel Simpson , Finn Lindgren , Håvard Rue

Gaussian processes (GPs) are typically criticised for their unfavourable scaling in both computational and memory requirements. For large datasets, sparse GPs reduce these demands by conditioning on a small set of inducing variables…

Gaussian processes (GPs) are flexible distributions over functions that enable high-level assumptions about unknown functions to be encoded in a parsimonious, flexible and general way. Although elegant, the application of GPs is limited by…

Machine Learning · Statistics 2017-10-06 Thang D. Bui , Josiah Yan , Richard E. Turner

Deep Gaussian Processes (DGPs) leverage a compositional structure to model non-stationary processes. DGPs typically rely on local inducing point approximations across intermediate GP layers. Recent advances in DGP inference have shown that…

Machine Learning · Computer Science 2025-04-29 Xinxing Shi , Thomas Baldwin-McDonald , Mauricio A. Álvarez

In this paper, we propose a model's sparse representation based on reduced mixed generalized multiscale finite element (GMsFE) basis methods for elliptic PDEs with random inputs. Mixed generalized multiscale finite element method (GMsFEM)…

Numerical Analysis · Mathematics 2017-04-05 Lijian Jiang , Qiuqi Li