72%Highly rated
?Highly ratedVote to see the score
On the Rademacher Complexity of Graph Neural Networks: Unifying Expressivity and Geometry
Rademacher complexity bounds unify GNN expressivity and input geometry through equivalence classes, covering numbers, and Wasserstein robustness.
Paris Poster Session 2, Wed, Dec 9, 5:00 PM–7:00 PM, Paris Poster Hall · Published 2026
– ReadersNo votes yet
8/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 8 of 20 reviewers recommend it
lenient 2/5
medium 5/10
strict 1/5