Research map / Graph learning / GNN architectures

Minimax Sample Complexity of Graph Neural Networks: Lower Bounds and Structural Effects

ICLR 2026 · Graph learning › GNN architectures · approach: Expressive equivariant message passing

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.

Closest papers by meaning

• A Manifold Perspective on the Statistical Generalization of Graph Neural Networks (ICML 2025 · similarity 0.92)
• On the Interplay between Graph Structure and Learning Algorithms in Graph Neural Networks (ICML 2025 · similarity 0.91)
• Graph Neural Networks Are More Than Filters: Revisiting and Benchmarking from A Spectral Perspective (ICLR 2025 · similarity 0.91)
• On the Rademacher Complexity of Graph Neural Networks: Unifying Expressivity and Geometry (NeurIPS 2026 · similarity 0.91)
• Almost Surely Asymptotically Constant Graph Neural Networks (NeurIPS 2024 · similarity 0.90)
• Higher-Order Graphon Neural Networks: Approximation and Cut Distance (ICLR 2025 · similarity 0.90)