dorsal/arxiv
View SchemaPosition: Don't be Afraid of Over-Smoothing And Over-Squashing
| Authors | Niklas Kormann, Benjamin Doerr, Johannes F. Lutzeyer |
|---|---|
| Categories | |
| ArXiv ID | 2601.07419vv1 |
| URL | https://arxiv.org/abs/2601.07419 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Over-smoothing and over-squashing have been extensively studied in the literature on Graph Neural Networks (GNNs) over the past years. We challenge this prevailing focus in GNN research, arguing that these phenomena are less critical for practical applications than assumed. We suggest that performance decreases often stem from uninformative receptive fields rather than over-smoothing. We support this position with extensive experiments on several standard benchmark datasets, demonstrating that accuracy and over-smoothing are mostly uncorrelated and that optimal model depths remain small even with mitigation techniques, thus highlighting the negligible role of over-smoothing. Similarly, we challenge that over-squashing is always detrimental in practical applications. Instead, we posit that the distribution of relevant information over the graph frequently factorises and is often localised within a small k-hop neighbourhood, questioning the necessity of jointly observing entire receptive fields or engaging in an extensive search for long-range interactions. The results of our experiments show that architectural interventions designed to mitigate over-squashing fail to yield significant performance gains. This position paper advocates for a paradigm shift in theoretical research, urging a diligent analysis of learning tasks and datasets using statistics that measure the underlying distribution of label-relevant information to better understand their localisation and factorisation.
{
"annotation_id": "4f306da2-f5e9-4c40-b2c7-74df91552a37",
"date_created": "2026-02-17T05:53:12.050000Z",
"date_modified": "2026-02-17T05:53:12.050000Z",
"file_hash": "a5d61868ad1b2b0c59078a3485b59f756898f80c6d07c5e91f2a75ecabf15a96",
"private": false,
"record": {
"abstract": "Over-smoothing and over-squashing have been extensively studied in the literature on Graph Neural Networks (GNNs) over the past years. We challenge this prevailing focus in GNN research, arguing that these phenomena are less critical for practical applications than assumed. We suggest that performance decreases often stem from uninformative receptive fields rather than over-smoothing. We support this position with extensive experiments on several standard benchmark datasets, demonstrating that accuracy and over-smoothing are mostly uncorrelated and that optimal model depths remain small even with mitigation techniques, thus highlighting the negligible role of over-smoothing. Similarly, we challenge that over-squashing is always detrimental in practical applications. Instead, we posit that the distribution of relevant information over the graph frequently factorises and is often localised within a small k-hop neighbourhood, questioning the necessity of jointly observing entire receptive fields or engaging in an extensive search for long-range interactions. The results of our experiments show that architectural interventions designed to mitigate over-squashing fail to yield significant performance gains. This position paper advocates for a paradigm shift in theoretical research, urging a diligent analysis of learning tasks and datasets using statistics that measure the underlying distribution of label-relevant information to better understand their localisation and factorisation.",
"arxiv_id": "2601.07419",
"authors": [
"Niklas Kormann",
"Benjamin Doerr",
"Johannes F. Lutzeyer"
],
"categories": [
"stat.ML",
"cs.LG"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Position: Don\u0027t be Afraid of Over-Smoothing And Over-Squashing",
"url": "https://arxiv.org/abs/2601.07419",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "62785a18-774a-4d95-afb0-54e9553005a4",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}