Continuum Limit of Posteriors in Graph Bayesian Inverse Problems
Not on the map. Why?
Abstract (arXiv)
We consider the problem of recovering a function input of a differential equation formulated on an unknown domain M. We assume to have access to a discrete domain Mn=x1, dots, xn subset M, and to noisy measurements of the output solution at p≤ n of those points. We introduce a graph-based Bayesian inverse problem, and show that the graph-posterior measures over functions in Mn converge, in the large n limit, to a posterior over functions in M that solves a Bayesian inverse problem with known domain. The proofs rely on the variational formulation of the Bayesian update, and on a new topology for the study of convergence of measures over functions on point clouds to a measure over functions on the continuum. Our framework, techniques, and results may serve to lay the foundations of robust uncertainty quantification of graph-based tasks in machine learning. The ideas are presented in the concrete setting of recovering the initial condition of the heat equation on an unknown manifold.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 0; 2025: 2.
4 papers.
- 2022Optimization on Manifolds via Graph Gaussian Processescited by 6
- 2022Rates of Convergence for Regression with the Graph Poly-Laplaciancited by 4
- 2025Gradient Flow Sampler-based Distributionally Robust Optimizationcited by 2
- 2025Geometric Autoencoder Priors for Bayesian Inversion: Learn First Observe Latercited by 1
- 2025Gradient Flow Sampler-based Distributionally Robust Optimization29 Oct 2025
- 2025Geometric Autoencoder Priors for Bayesian Inversion: Learn First Observe Later24 Sep 2025
- 2022Optimization on Manifolds via Graph Gaussian Processes20 Oct 2022
- 2022Rates of Convergence for Regression with the Graph Poly-Laplacian6 Sep 2022