Quant Memo
Advanced

Sparse Gaussian Processes and Inducing Points

A way to make Gaussian process regression scale to large datasets by summarizing the training data with a small set of learned 'inducing points' instead of using every observation directly.

Prerequisites: Gaussian Processes, Gaussian Process Regression

A Gaussian process is an appealing model because it doesn't just predict a value — it predicts a value and a calibrated uncertainty around it, useful anywhere a quant needs to know not just "what's the estimate" but "how confident should I be." The catch is that exact Gaussian process regression requires inverting a matrix whose size grows with the number of training points, which becomes computationally infeasible once a dataset reaches even a few thousand observations, let alone the tick-level datasets common in finance.

Sparse Gaussian processes get around this by summarizing the whole training set with a much smaller number of "inducing points" — a handful of representative locations in input space, learned during training rather than picked from the actual data, that the model uses to approximate what the full dataset would have told it. Instead of computing exact relationships between every pair of training observations, the model only needs relationships between these inducing points and the training data, and between the inducing points and each other — cutting the expensive computation down from scaling with the full dataset size to scaling with the much smaller number of inducing points.

Picture fitting a Gaussian process to a year of daily volatility observations. An exact GP would need to relate every one of the roughly 250 trading days to every other, an expensive but manageable computation. Scale that to tick data with millions of observations and the exact approach is simply impossible on ordinary hardware. A sparse GP might instead learn 50 inducing points spread across the input range, and use those 50 to summarize everything the millions of ticks would have said about the underlying relationship — losing a little precision in exchange for a computation that is actually tractable.

What this means in practice

Sparse Gaussian processes are what make GP-based approaches usable at all on realistic quant datasets — for volatility surface fitting, for yield curve modeling, or for any application where a calibrated uncertainty estimate matters and the raw dataset is too large for the exact method. The number of inducing points is itself a trade-off knob: more inducing points recovers more of the accuracy of the exact GP at the cost of more computation, so it's chosen based on how much approximation error is tolerable for the task.

Sparse Gaussian processes replace the full training dataset with a small, learned set of inducing points that summarize it, making the expensive computation scale with the number of inducing points instead of the number of observations — a trade-off that makes GP-based uncertainty estimates usable on realistically large datasets.

Related concepts

Further reading

  • Titsias, Variational Learning of Inducing Variables in Sparse Gaussian Processes (2009)
ShareTwitterLinkedIn