Sampling for network function learning
Given a valued graph, where both the nodes and the edges of the graph are associated with one or several values, any network function for a given node must be defined in terms of that node and its connected nodes in the graph. Generally, applying the same definition to the whole graph or any given subgraph of it would result in systematically different network functions. In this paper we consider the feasibility of graph sampling approach to network function learning, as well as the corresponding learning methods based on the sample graphs. This can be useful either when the edges are unknown to start with or the graph is too large (or dynamic) to be processed entirely.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph SamplingSimilar Papers 제목 키워드 기반
Adaptive Sampling for Convex Regression
In this paper, we introduce the first principled adaptive-sampling procedure for learning a convex function in the $L_\infty$ norm, a problem that arises often in the behavioral and social sciences. We present a function…
regressionImportance Sampling via Score-based Generative Models
Importance sampling, which involves sampling from a probability density function (PDF) proportional to the product of an importance weight function and a base PDF, is a powerful technique with applications in variance re…
Data AugmentationCoordinate Descent with Arbitrary Sampling II: Expected Separable Overapproximation
The design and complexity analysis of randomized coordinate descent methods, and in particular of variants which update a random subset (sampling) of coordinates in each iteration, depends on the notion of expected separ…
Scale factor point spread function matching: Beyond aliasing in image resampling
Imaging devices exploit the Nyquist-Shannon sampling theorem to avoid both aliasing and redundant oversampling by design. Conversely, in medical image resampling, images are considered as continuous functions, are warped…
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 est…