Scalable Gaussian Processes on Discrete Domains

Abstract

Kernel methods on discrete domains have shown great promise for many challenging data types, for instance, biological sequence data and molecular structure data. Scalable kernel methods like Support Vector Machines may offer good predictive performances but do not intrinsically provide uncertainty estimates. In contrast, probabilistic kernel methods like Gaussian Processes offer uncertainty estimates in addition to good predictive performance but fall short in terms of scalability. While the scalability of Gaussian processes can be improved using sparse inducing point approximations, the selection of these inducing points remains challenging. We explore different techniques for selecting inducing points on discrete domains, including greedy selection, determinantal point processes, and simulated annealing. We find that simulated annealing, which can select inducing points that are not in the training set, can perform competitively with support vector machines and full Gaussian processes on synthetic data, as well as on challenging real-world DNA sequence data.

Published at IEEE Access

References in corpus (9)

• On Calibration of Modern Neural Networks
• Expectation Propagation for approximate Bayesian inference
• Kernel Interpolation for Scalable Structured Gaussian Processes (KISS-GP)
• Rates of Convergence for Sparse Variational Gaussian Process Regression
• Fast DPP Sampling for Nyström with Application to Kernel Methods
• BOSS: Bayesian Optimization over String Spaces
• Sparse Gaussian Processes with Spherical Harmonic Features
• Convolutional Kitchen Sinks for Transcription Factor Binding Site Prediction
• Doubly Sparse Variational Gaussian Processes

Cited by in corpus (6)

• GP-VAE: Deep Probabilistic Time Series Imputation
• Meta-Learning Mean Functions for Gaussian Processes
• Scalable Gaussian Process Variational Autoencoders
• Kernels over Sets of Finite Sets using RKHS Embeddings, with Application to Bayesian (Combinatorial) Optimization
• Gradient Importance Learning for Incomplete Observations
• META${}^2$: Memory-efficient taxonomic classification and abundance estimation for metagenomics with deep learning