Optimal Bayesian Smoothing of Functional Observations over a Large Graph
Arkaprava Roy, Shubhashis Ghosal

TL;DR
This paper develops a Bayesian smoothing method for high-resolution functional data observed over large graphs, achieving minimax optimality and high coverage, with applications to temperature data.
Contribution
It introduces a graph Laplacian-based prior for Bayesian smoothing that attains minimax rates and high coverage in functional data over large graphs.
Findings
The proposed method attains the minimax estimation rate.
It provides credible regions with high frequentist coverage.
Outperforms competing methods like random forest in simulations.
Abstract
In modern contexts, some types of data are observed in high-resolution, essentially continuously in time. Such data units are best described as taking values in a space of functions. Subject units carrying the observations may have intrinsic relations among themselves, and are best described by the nodes of a large graph. It is often sensible to think that the underlying signals in these functional observations vary smoothly over the graph, in that neighboring nodes have similar underlying signals. This qualitative information allows borrowing of strength over neighboring nodes and consequently leads to more accurate inference. In this paper, we consider a model with Gaussian functional observations and adopt a Bayesian approach to smoothing over the nodes of the graph. We characterize the minimax rate of estimation in terms of the regularity of the signals and their variation across…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
