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
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 changed | Where | Measured | Effect |
|---|---|---|---|
| increase number of unlabeled points n from 300 to 2000 with p=200 labeled | graph pCN · semi-supervised, p=200 | average acceptance probability: 0.230 -> 0.239 | No clear effect |
| increase n=p from 300 to 2000 in fully supervised setting | graph pCN · fully supervised, n=p | average acceptance probability: 0.4536 -> 0.1100 | Hurt |
Closest papers by meaning
- Unlabeled Data Help in Graph-Based Semi-Supervised Learning: A Bayesian Nonparametrics Perspective (JMLR 2022 · similarity 0.92)
- Bayesian Semi-supervised Learning with Graph Gaussian Processes (NeurIPS 2018 · similarity 0.90)
- Data driven semi-supervised learning (NeurIPS 2021 · similarity 0.89)
- Large-Scale Graph-Based Semi-Supervised Learning via Tree Laplacian Solver (AAAI 2016 · similarity 0.89)
- Graph–Smoothed Bayesian Black-Box Shift Estimator and Its Information Geometry (NeurIPS 2025 · similarity 0.85)
- Continuous Partitioning for Graph-Based Semi-Supervised Learning (NeurIPS 2024 · similarity 0.85)
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.
