A gradient-based and determinant-free framework for fully Bayesian Gaussian process regression
From MaRDI portal
Cites work
- A determinant-free method to simulate the parameters of large Gaussian fields
- A Proof That Anderson Acceleration Improves the Convergence Rate in Linearly Converging Fixed-Point Methods (But Not in Those Converging Quadratically)
- A randomized algorithm for approximating the log determinant of a symmetric positive definite matrix
- A unified view of some numerical methods for fractional diffusion
- Anderson acceleration for fixed-point iterations
- Computing A^\alpha, \log(A), and Related Matrix Functions by Contour Integrals
- Convergence analysis for Anderson acceleration
- Ensemble samplers with affine invariance
- Gaussian processes for machine learning.
- Iterative Procedures for Nonlinear Integral Equations
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- MCMC methods for functions: modifying old algorithms to make them faster
- MCMC using Hamiltonian dynamics
- Mission \(\mathrm{CO}_2\)ntrol: a statistical scientist's role in remote sensing of atmospheric carbon dioxide
- Non-stationary Anderson acceleration with optimized damping
- On randomized trace estimates for indefinite matrices with an application to determinants
- Randomized Nyström Preconditioning
- Randomly pivoted Cholesky: practical approximation of a kernel matrix with few entry evaluations
- Riemann manifold Langevin and Hamiltonian Monte Carlo methods. With discussion and authors' reply
- Runge-Kutta schemes for Hamiltonian systems
- Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions
- Uniform approximation of common Gaussian process kernels using equispaced Fourier grids
This page was built for publication: A gradient-based and determinant-free framework for fully Bayesian Gaussian process regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900872)
