Consistent sampling of Paley-Wiener functions on graphons
We study sampling methods for Paley-Wiener functions on graphons, thereby adapting and generalizing methods initially developed for graphs to the graphon setting. We then derive conditions under which such a sampling estimate is consistent with graphon convergence.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Nonparametric, Nonasymptotic Confidence Bands with Paley-Wiener Kernels for Band-Limited Functions
The paper introduces a method to construct confidence bands for bounded, band-limited functions based on a finite sample of input-output pairs. The approach is distribution-free w.r.t. the observation noises and only the…
Non-asymptotic confidence regions on RKHS. The Paley-Wiener and standard Sobolev space cases
We consider the problem of constructing a global, probabilistic, and non-asymptotic confidence region for an unknown function observed on a random design. The unknown function is assumed to lie in a reproducing kernel Hi…
A Poincaré Inequality and Consistency Results for Signal Sampling on Large Graphs
Large-scale graph machine learning is challenging as the complexity of learning models scales with the graph size. Subsampling the graph is a viable alternative, but sampling on graphs is nontrivial as graphs are non-Euc…
Graph SamplingLearning optimal smooth invariant subspaces for data approximation
In this article, we consider the problem of approximating a finite set of data (usually huge in applications) by invariant subspaces generated through a small set of smooth functions. The invariance is either by translat…
Composition operators on reproducing kernel Hilbert spaces with analytic positive definite functions
In this paper, we specify what functions induce the bounded composition operators on a reproducing kernel Hilbert space (RKHS) associated with an analytic positive definite function defined on $\mathbf{R}^d$. We prove th…