Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 19 of 19 for “"inducing points"”.

  1. Scalable inference and private co-training for Gaussian processes

    … process regression to very large numbers of data points, and that of differentially private co-training between multiple Gaussian processes with distinct private views of the data.</p> <p>The first chapter acts as an introduction to Bayesian nonparametric regression and standard techniques for …

    oxford Repository record for Scalable inference and private co-training for Gaussian processes (opens in a new tab)

  2. Scalable Gaussian Processes and Bayesian Optimization with Application to Hyperparameter Tuning

    … large-scale data by sparsifying the model via inducing points and approximating the posterior. Despite advances, variational GPs still may require many inducing points (and significant computational costs) to achieve good accuracy, a gap this dissertation aims to bridge.This dissertation also …

    cornell Repository record for Scalable Gaussian Processes and Bayesian Optimization with Application to Hyperparameter Tuning (opens in a new tab)

  3. Efficient computer experiment designs for Gaussian process surrogates

    … process (LIGP) incorporates latent design points, inducing points, with a local Gaussian process built from a subset of the data. Various methods are introduced for the design of the inducing points. LIGP is then extended to adapt to stochastic data with replicates, estimating noise while …

    vt Repository record for Efficient computer experiment designs for Gaussian process surrogates (opens in a new tab)

  4. Sparse intrinsic Gaussian processes in complex constrained domains with application of Bayesian optimisation

    … distance to define the covariance between data points on the target surface, such as the radial basis function (RBF) kernel. Traditional GPs cannot be directly applied to manifolds due to their failure to accurately capture the underlying structure, especially in the presence of gaps and complex …

    glasgow Repository record for Sparse intrinsic Gaussian processes in complex constrained domains with application of Bayesian optimisation (opens in a new tab) Download PDF for Sparse intrinsic Gaussian processes in complex constrained domains with application of Bayesian optimisation (opens in a new tab)

  5. Efficient and Adaptive Decentralized Sparse Gaussian Process Regression for Environmental Sampling Using Autonomous Vehicles

    … (DSGPR) model with event-triggered, adaptive inducing points. This DSGPR model brings the advantages of sparse Gaussian process regression to a decentralized implementation. Being decentralized and sparse provides advantages that are ideal for multi-agent systems (MASs) performing …

    byu Repository record for Efficient and Adaptive Decentralized Sparse Gaussian Process Regression for Environmental Sampling Using Autonomous Vehicles (opens in a new tab) Download PDF for Efficient and Adaptive Decentralized Sparse Gaussian Process Regression for Environmental Sampling Using Autonomous Vehicles (opens in a new tab)

  6. Energy-Efficient Navigation of Electric Vehicles using Gaussian Processes

    … how the GP method is impacted by the number of inducing points, heteroskedastic noise modeling, an informative prior, and the choice of bandit algorithm.

    chalmers Repository record for Energy-Efficient Navigation of Electric Vehicles using Gaussian Processes (opens in a new tab)

  7. Scaling Gaussian Processes

    … solves the open problem of efficient discrete inducing set selection in the context of inducing point based approximation to full GPs. When inducing points need to be chosen from the training set, the proposed method is the only principled approach to date for joint tuning of inducing set and …

    toronto-retro Repository record for Scaling Gaussian Processes (opens in a new tab)

  8. Scalable Gaussian Processes in Modern Machine Learning

    … matrix; (ii) an approximation that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving …

    tamu Repository record for Scalable Gaussian Processes in Modern Machine Learning (opens in a new tab) Embargoed until 2027-08-01

  9. Scalable Gaussian Processes in Modern Machine Learning

    … matrix; (ii) an approximation that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving …

    tamu Repository record for Scalable Gaussian Processes in Modern Machine Learning (opens in a new tab) Embargoed until 2027-08-01

  10. Scalable Gaussian Processes in Modern Machine Learning

    … matrix; (ii) an approximation that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving …

    tamu Repository record for Scalable Gaussian Processes in Modern Machine Learning (opens in a new tab) Embargoed until 2027-08-01

  11. Scalable Gaussian Processes in Modern Machine Learning

    … matrix; (ii) an approximation that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving …

    tamu Repository record for Scalable Gaussian Processes in Modern Machine Learning (opens in a new tab) Embargoed until 2027-08-01

  12. Scalable Gaussian Processes in Modern Machine Learning

    … matrix; (ii) an approximation that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving …

    tamu Repository record for Scalable Gaussian Processes in Modern Machine Learning (opens in a new tab) Embargoed until 2027-08-01

  13. Scalable Gaussian Processes in Modern Machine Learning

    … matrix; (ii) an approximation that leverages inducing points with sparse grids; (iii) a distributed aggregation framework that fuses local GP experts via optimally weighted combination. These innovations reduce computational complexity from cubic to near-linear scaling while preserving …

    tamu Repository record for Scalable Gaussian Processes in Modern Machine Learning (opens in a new tab) Embargoed until 2027-08-01

  14. Function-Space Bayesian Learning: from Gaussian Processes to Bayesian Deep Learning

    … in neural networks can be viewed as inter-domain inducing points so that I can draw an equivalence between finite neural networks and sparse Gaussian processes. In the last part, I employ Bayesian models for online memory selection and improve the robustness against imbalanced data streams in …

    toronto-retro Repository record for Function-Space Bayesian Learning: from Gaussian Processes to Bayesian Deep Learning (opens in a new tab)

  15. Pessimistic Bayesianism for conservative optimization and imitation

    … first Gaussian process with this time complexity—inducing points methods have linear complexity—but we do outperform such methods significantly on regression benchmarks, as one might expect given the much higher dimensionality of our kernel. This thesis shows the viability of pessimism with …

    oxford Repository record for Pessimistic Bayesianism for conservative optimization and imitation (opens in a new tab)

  16. Novel Machine Learning Algorithms for Large Spatial Data

    … The second contribution develops the Vecchia-inducing-point full-scale (VIF) approximation, a hybrid method that unifies global inducing points with local Vecchia conditioning. A correlation-based neighbor selection strategy, implemented through a modified cover tree, enables accurate …

    zurich

  17. Advances in Scalable Bayesian Inference: Gaussian Processes & Discrete Variable Models

    … of kernel eigenfunction can use as many as 10^33 inducing points with little computational expense. We subsequently consider a highly general class of GP covariance kernels and show that the GP marginal likelihood can be computed with a complexity that is independent of the number of training …

    toronto-retro Repository record for Advances in Scalable Bayesian Inference: Gaussian Processes & Discrete Variable Models (opens in a new tab)

  18. Strengthening nonparametric Bayesian methods with structured kernels

    … can draw upon a smaller set of pseudo-inputs, or inducing points, to obtain a sparse and more scalable approximate posteriors. Myriad studies of sparse GPs have established a separation of model parameters, which can either be optimized or inferred, and variational parameters which only requires …

    aalto Repository record for Strengthening nonparametric Bayesian methods with structured kernels (opens in a new tab)

  19. Computational methods for automatic analog integrated circuit design

    … are introduced to the GPs by using inducing points. In addition to the above, a new framework is proposed in which the GP models are restricted to model certain hypercubes of the design space. This approach, which is motivated by the concept of trust-regions in the EA literature, …

    greece Repository record for Computational methods for automatic analog integrated circuit design (opens in a new tab)