Problems with high-dimensional data optimisation in high-d parameter space is computationally expensive and hard to find a global optimum Good news: in many cases, the intrinsic dimensionality is actually low datapoints are sampled from a low-dimensional manifold embedded in a high-dimensional space example: swiss roll Adapted from Roweis & Saul, Science, 2000 Manifold learning: attempts to uncover the manifold structure Non-probabilistic prior work idea: preserve geometric properties of local neighbourhoods limits: sensitive to noise due to lack of explicit model heuristic methods to evaluate manifold dimensionality no measure of uncertainties in the estimates out-of-sample extension requires extra approximations Gaussian process laten...