mlsanityData to 14 Oct 2026

Optimization on Manifolds via Graph Gaussian Processes

arXiv 2210.10962 ↗First posted 20 Oct 2022stat.ML cs.LG math.OCcited by 6

Not on the map. Why?

Abstract (arXiv)

This paper integrates manifold learning techniques within a Gaussian process upper confidence bound algorithm to optimize an objective function on a manifold. Our approach is motivated by applications where a full representation of the manifold is not available and querying the objective is expensive. We rely on a point cloud of manifold samples to define a graph Gaussian process surrogate model for the objective. Query points are sequentially chosen using the posterior distribution of the surrogate model given all previous queries. We establish regret bounds in terms of the number of queries and the size of the point cloud. Several numerical examples complement the theory and illustrate the performance of our method.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 31 of its 68 references that are in the map. First posted on arXiv 20 Oct 2022.

Builds on

31 of 68 references.

References · 31

  1. 2018A Tutorial on Bayesian Optimizationcited by 744
  2. 2013Bayesian Optimization in a Billion Dimensions via Random Embeddingscited by 182
  3. 2020On Information Gain and Regret Bounds in Gaussian Process Banditscited by 158
  4. 2020Mat'ern Gaussian processes on Riemannian manifoldscited by 82
  5. 2019Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspacescited by 73
  6. 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
  7. 2020Mat'ern Gaussian Processes on Graphscited by 66
  8. 2018Bayesian Optimization of Combinatorial Structurescited by 64
  9. 2021Misspecified Gaussian Process Bandit Optimizationcited by 55
  10. 2014Geodesic Exponential Kernels: When Curvature and Linearity Conflictcited by 47
  11. 2019A Brief Introduction to Manifold Optimizationcited by 35
  12. 2020Concentration Inequalities for Statistical Inferencecited by 24
19 more
  1. 2021Geometry-aware Bayesian Optimization in Robotics using Riemannian Mat'ern Kernelscited by 24
  2. 2019Bayesian Optimization Meets Riemannian Manifolds in Robot Learningcited by 23
  3. 2021Bayesian Optimization over Hybrid Spacescited by 23
  4. 2016Bayesian Optimization with Exponential Convergencecited by 18
  5. 2018Inverse Problems and Data Assimilationcited by 18
  6. 2019Optimization on flag manifoldscited by 13
  7. 2020Graph Based Gaussian Processes on Restricted Domainscited by 10
  8. 2018Gaussian Process Landmarking on Manifoldscited by 9
  9. 2017The rational SPDE approach for Gaussian random fields with general smoothnesscited by 7
  10. 2020The SPDE Approach to Mat'ern Fields: Graph Representationscited by 6
  11. 2021Global optimization using random embeddingscited by 6
  12. 2017On the Consistency of Graph-based Bayesian Learning and the Scalability of Sampling Algorithmscited by 5
  13. 2020Constrained global optimization of functions with low effective dimensionality using multiple random embeddingscited by 5
  14. 2017Continuum Limit of Posteriors in Graph Bayesian Inverse Problemscited by 4
  15. 2020Unlabeled Data Help in Graph-Based Semi-Supervised Learning: A Bayesian Nonparametrics Perspectivecited by 4
  16. 2022Manifold Free Riemannian Optimizationcited by 4
  17. 2019Local Regularization of Noisy Point Clouds: Improved Global Geometric Estimates and Data Analysiscited by 3
  18. 2021Graph-based Prior and Forward Models for Inverse Problems on Manifolds with Boundariescited by 2
  19. 2022Mathematical Foundations of Graph-Based Bayesian Semi-Supervised Learningcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 3; 2026: 2.

6 papers.