Looped GNNs Beyond Fixed Depth: Graph Size Generalization and Parameter-Efficient Adaptation

arXiv:2610.24112 · cs.LG · Submitted 2026-10-16 · Read on arXiv

cs.LG

Submitted: 2026-10-16

Updated: 2026-10-16

Comments: 36 pages, 12 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Adaptation — 1× in this paper · explained in 1 episode
• GNNs — 1× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks