# Over-Smoothing in Graph Neural Networks

Over-smoothing is the problem that the representations on each node of the graph neural networks becomes way too similar to each other.^{1} In Chapter 7 of Hamilton2020, the author interprets this phenomenon using the lower pass filter theory in signal processing, i.e., multiplying a signal by $\mathbf A^n$ is similar to a low-pass filter when $n$ is large, with $\mathbf A$ being the adjacency matrix.

Planted:
by L Ma;

References:

Similar Articles:

Lei Ma (2022). 'Over-Smoothing in Graph Neural Networks', Datumorphism, 08 April. Available at: https://datumorphism.leima.is/cards/graph/graph-neural-networks-over-smoothing/.