Continuum Limit of Posteriors in Graph Bayesian Inverse Problems

Abstract

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, …, xn\ ⊂ 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…