AI Paper Atlas

Research map / Graph learning / Graph self-supervised learning

On the consistency of graph-based Bayesian semi-supervised learning and the scalability of sampling algorithms

Nicolas Garcia Trillos, Zachary Kaplan, Thabo Samakhoana, Daniel Sanz-Alonso

JMLR 2020 · Graph learning › Graph self-supervised learning · approach: Heterophily and imbalance on graphs

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
increase number of unlabeled points n from 300 to 2000 with p=200 labeledgraph pCN · semi-supervised, p=200average acceptance probability: 0.230 -> 0.239No clear effect
increase n=p from 300 to 2000 in fully supervised settinggraph pCN · fully supervised, n=paverage acceptance probability: 0.4536 -> 0.1100Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy