The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Jonas Wallin. Photo.

Jonas Wallin

Senior lecturer, Director of third cycle studies, Department of Statistics

Jonas Wallin. Photo.

Efficient methods for Gaussian Markov random fields under sparse linear constraints

Author

  • David Bolin
  • Jonas Wallin

Summary, in English

Methods for inference and simulation of linearly constrained Gaussian Markov
Random Fields (GMRF) are computationally prohibitive when the number of
constraints is large. In some cases, such as for intrinsic GMRFs, they may even beunfeasible. We propose a new class of methods to overcome these challenges in the common case of sparse constraints, where one has a large number of constraints and each only involves a few elements. Our methods rely on a basis transformation into blocks of constrained versus non-constrained subspaces, and we show that the methods greatly outperform existing alternatives in terms of computational cost. By combining the proposed methods with the stochastic partial differential equation approach for Gaussian random fields, we also show how to formulate Gaussian process regression with linear constraints in a GMRF setting to reduce computational cost. This is illustrated in two applications with simulated data.

Department/s

  • Department of Statistics

Publishing year

2021

Language

English

Publication/Series

Advances in Neural Information Processing Systems

Volume

34

Document type

Conference paper

Topic

  • Probability Theory and Statistics

Conference name

35th Conference on Neural Information Processing Systems (NeurIPS 2021)

Conference date

2021-12-06 - 2021-12-14

Status

Published

ISBN/ISSN/Other

  • ISBN: 9781713845393