The Graphical Nadaraya-Watson Estimator on Latent Position Models

M. Gjorgjevski
3/30/2023
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

Given a graph with a subset of labeled nodes, we are interested in the quality of the averaging estimator which for an unlabeled node predicts the average of the observations of its labeled neighbors. We rigorously study concentration properties, variance bounds and risk bounds in this context. While the estimator itself is very simple we believe that our results will contribute towards the theoretical understanding of learning on graphs through more sophisticated methods such as Graph Neural Networks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Node Regression on Latent Position Random Graphs via Local Averaging

88% match2024

Semisupervised regression in latent structure networks on unknown manifolds

78% match2023

Intensity Dot Product Graphs

77% match1 repo2026

Graphon Estimation in bipartite graphs with observable edge labels and unobservable node labels

77% match2023

Residual Correlation in Graph Neural Network Regression

76% match1 repo222020

Learning Latent Graph Structures and their Uncertainty

76% match1 repo32024

Cite this paper

@article{gjorgjevski2023graphical,
  title  = {The Graphical Nadaraya-Watson Estimator on Latent Position Models},
  author = {M. Gjorgjevski},
  year   = {2023},
  eprint = {2303.17229},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.17229v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.17229.svg)](https://codeofpaper.com/paper/2303.17229)

Discussion