Robust Learning in Bayesian Parallel Branching Graph Neural Networks: The Narrow Width Limit
<|reference_start|>Robust Learning in Bayesian Parallel Branching Graph Neural Networks: The Narrow Width Limit: The infinite width limit of random neural networks is known to result in Neural Networks as Gaussian Process (NNGP) (Lee et al. [2018]), characterized by task-independent kernels. It is widely accepted that larger network widths contribute to improved generalization (Park et al. [2019]). However, this work challenges this notion by investigating the narrow width limit of the Bayesian Parallel Branching Graph Neural Network (BPB-GNN), an architecture that resembles residual networks. We demonstrate that when the width of a BPB-GNN is significantly smaller compared to the number of training examples, each branch exhibits more robust learning due to a symmetry breaking of branches in kernel renormalization. Surprisingly, the performance of a BPB-GNN in the narrow width limit is generally superior or comparable to that achieved in the wide width limit in bias-limited scenarios. Furthermore, the readout norms of each branch in the narrow width limit are mostly independent of the architectural hyperparameters but generally reflective of the nature of the data. Our results characterize a newly defined narrow-width regime for parallel branching networks in general.<|reference_end|>
@article{zhang2024robust,
    title={Robust Learning in Bayesian Parallel Branching Graph Neural Networks:
  The Narrow Width Limit},
    author={Zechen Zhang, Haim Sompolinsky},
    journal={arXiv preprint arXiv:2407.18807},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.18807},
    primaryClass={cs.LG cs.AI}
}