Reproduce “Kernel-based Graph Learning from Smooth Signals: A Functional Viewpoint” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Xingyue Pu, Siu Lun Chau, Xiaowen Dong, Dino Sejdinovic
Kernel-based Graph Learning (KGL) estimates a node graph from noisy or missing observations by fitting a function of node-side and observation-side covariates using a supplied observation-side kernel. On synthetic independent stochastic block model data, KGL-N’s APS falls about 0.1 and normalized graph SSE rises about 0.05 as missingness increases from none to around 90%; this result is specific to KGL-N.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.