<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-22T06:01:11Z</responseDate><request verb="GetRecord" identifier="oai:www.repository.cam.ac.uk:1810/374873" metadataPrefix="uketd_dc">https://api.repository.cam.ac.uk/server/oai/request</request><GetRecord><record><header><identifier>oai:www.repository.cam.ac.uk:1810/374873</identifier><datestamp>2024-10-17T00:45:45Z</datestamp><setSpec>com_1810_213729</setSpec><setSpec>com_1810_256065</setSpec><setSpec>col_1810_219485</setSpec></header><metadata><uketd_dc:uketddc xmlns:uketd_dc="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:uketdterms="http://naca.central.cranfield.ac.uk/ethos-oai/terms/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://naca.central.cranfield.ac.uk/ethos-oai/2.0/ http://naca.central.cranfield.ac.uk/ethos-oai/2.0/uketd_dc.xsd">
   <dc:title>Improved Gaussian process approximations for spatial and flow fields</dc:title>
   <dc:identifier xsi:type="dcterms:DOI">https://doi.org/10.17863/CAM.112770</dc:identifier>
   <dc:creator>Cheema, Talay</dc:creator>
   <uketdterms:advisor>Rasmussen, Carl</uketdterms:advisor>
   <dcterms:abstract>Many modelling problems in scientific and engineering applications require quantitative models of uncertainty, for example to appropriately weight different sources of information, or to make risk-aware decisions. A natural way to formalise this is as a probabilistic model with a Bayesian point of view. When the main object of interest is a function - such as a spatial or flow field - Gaussian processes (GPs) are suitable probabilistic models. These can incorporate expert knowledge (priors), and data can be used to learn the model parameters. The cost of learning is high, motivating approximations, most notably variational approximations. This thesis improves on variational GP approximations in different settings.

Firstly, I consider approximate learning of low dimensional spatial fields. In Chapter 2, I argue for precomputable variational approximations, which only access the training data once during learning. These lead to significant computational savings, but are limited to an excessively narrow class of priors. In Chapter 3, I develop a class of precomputable approximations which first replace the prior with a periodic approximation. These approximate Fourier series methods outperform existing methods, have compelling theoretical guarantees, and are applicable to a broad class of priors - stationary priors whose covariance functions have well-defined spectral densities. Since many spatial fields are highly non-stationary, in Chapter 4 I construct a new class of non-stationary priors based on multiresolution (discrete wavelet) approximations, with a compatible precomputable approximation. 

In Chapter 5 I turn to modelling flow fields for system identification problems. Here I propose a new approach - approximating the state posterior with Kalman smoothing - leading to faster and less biased learning, while also applicable to either discrete or continuous time.

Overall, this thesis presents improved GP variational approximations to make learning cheaper, with applicability to a broader class of priors, supported by a mix of theoretical guarantees and empirical evaluation.</dcterms:abstract>
   <uketdterms:institution>University of Cambridge</uketdterms:institution>
   <dcterms:issued>2024-03-15</dcterms:issued>
   <dc:type>Thesis</dc:type>
   <uketdterms:qualificationlevel>Doctoral</uketdterms:qualificationlevel>
   <uketdterms:qualificationname>Doctor of Philosophy (PhD)</uketdterms:qualificationname>
   <dc:language>eng</dc:language>
   <uketdterms:sponsor>Bill Brown Fund</uketdterms:sponsor>
   <dcterms:isReferencedBy xsi:type="dcterms:URI">https://www.repository.cam.ac.uk/handle/1810/374873</dcterms:isReferencedBy>
   <dc:identifier xsi:type="dcterms:URI">https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/419c1da6-c9e6-49c3-9d79-55342ee2d69a/download</dc:identifier>
   <uketdterms:checksum xsi:type="uketdterms:MD5">1491348d6aa836835e2cf2200244a6c4</uketdterms:checksum>
   <dcterms:license>https://apollo8-f-pro.lib.cam.ac.uk/bitstreams/032e81e5-4a04-4ccb-aa9d-6820fbb6b54e/download</dcterms:license>
   <uketdterms:checksum xsi:type="uketdterms:MD5">87eda9de84448d1f82354d60eee3eb5f</uketdterms:checksum>
   <dc:rights>https://www.rioxx.net/licenses/all-rights-reserved/</dc:rights>
   <dc:subject>Dynamical systems</dc:subject>
   <dc:subject>Gaussian processes</dc:subject>
   <dc:subject>Machine learning</dc:subject>
</uketd_dc:uketddc>
</metadata></record></GetRecord></OAI-PMH>