Efficient Learning of Linear Graph Neural Networks via Node Subsampling

Seiyun Shin, Ilan Shomorony, Han Zhao
2/12/2026

No confident code implementation found for this paper. 1 possible match can be shown below.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

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

Similar Papers

Recovery of Causal Graph Involving Latent Variables via Homologous Surrogates

100% match1 repo22026

Improving the Convergence of Dynamic NeRFs via Optimal Transport

96% match2026

Out-of-Distribution Generalization of Federated Learning via Implicit Invariant Relationships

96% match1 repo142026

Faster Inference of Flow-Based Generative Models via Improved Data-Noise Coupling

96% match1 repo152026

RODEO: Robust Outlier Detection via Exposing Adaptive Out-of-Distribution Samples

95% match2 repos62026

PromptCoT: Align Prompt Distribution via Adapted Chain-of-Thought

95% match2026

Cite this paper

@article{shin2026efficient,
  title  = {Efficient Learning of Linear Graph Neural Networks via Node Subsampling},
  author = {Seiyun Shin and Ilan Shomorony and Han Zhao},
  year   = {2026},
  doi    = {10.52202/075280-2422},
  url    = {https://doi.org/10.52202/075280-2422},
  journal = {NEURIPS 2023 2023}
}

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/4b11914b5b413e1defef73d37cf3322425601624.svg)](https://codeofpaper.com/paper/4b11914b5b413e1defef73d37cf3322425601624)

Discussion