atlas

Research map / Graph learning / GNN architectures

A PAC-Bayesian Approach to Generalization Bounds for Graph Neural Networks

ICLR 2021 · Graph learning › GNN architectures · approach: Oversmoothing and heterophily · 12 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Use the PAC-Bayes bound instead of the Rademacher complexity boundMPGNN generalization analysis · MPGNN generalization boundmaximum node degree dependency: \mathcal{O}\left( d^{l-1} \sqrt{\log(d^{2l-3})} \right) -> \mathcal{O}\left( d^{l-1} \right)Helped
Use the PAC-Bayes bound instead of the Rademacher complexity boundMPGNN generalization analysis · MPGNN generalization boundmaximum hidden dimension dependency: \mathcal{O}\left( h \sqrt{\log h} \right) -> \mathcal{O}\left( \sqrt{h \log h} \right)Helped
Use the proposed PAC-Bayes bound rather than the Rademacher complexity boundMPGNN generalization analysis · Synthetic and real-world graph datasetsbound valueHelped
Increase message-passing steps/layersMPGNN generalization-bound evaluation · Synthetic and real-world graph datasetsbound valueHurt

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