Efficient Cholesky decomposition of low-rank updates
We give a short and practical guide to efficiently computing the Cholesky decomposition of matrices perturbed by low-rank updates.
We give a short and practical guide to efficiently computing the Cholesky decomposition of matrices perturbed by low-rank updates.
Our paper "Batch Bayesian Optimisation via Density-ratio Estimation with Guarantees", led by Rafael Oliveira, was paper accepted to NeurIPS2022!
We swap Gibbs sampling for mean-field variational inference in the Pólya-Gamma augmented model and watch the classical Jaakkola-Jordan bound on the logistic sigmoid fall out, EM …
Our paper "BORE — Bayesian Optimization by Density-Ratio Estimation" was accepted to ICML 2021 as a Long Talk (top 3% of submissions).
We use one weird trick — Pólya-Gamma augmentation — to make exact inference in Bayesian logistic regression tractable.
We collect the identities that make the Pólya-Gamma augmentation tick: the logistic sigmoid in terms of the hyperbolic cosine, the hyperbolic cosine as a Pólya-Gamma Laplace …
We give a short illustrated reference guide to the Knowledge Gradient acquisition function with an implementation from scratch in TensorFlow Probability.
Our paper "Variational Inference for Graph Convolutional Networks in the Absence of Graph Data and Adversarial Settings" was accepted to NeurIPS 2020 as a Spotlight Presentation …
We summarize the notation, identities, and derivations underlying the sparse variational Gaussian process (SVGP) framework.
We show how to approximate the KL divergence (in fact, any f-divergence) between implicit distributions using density ratio estimation by probabilistic classification.