← Search

Piero Deidda

1 accepted papers

2026

Are we measuring oversmoothing in graph neural networks correctly?

ICLR 2026poster

Oversmoothing is a fundamental challenge in graph neural networks (GNNs): as the number of layers increases, node embeddings become increasingly similar, and model performance drops sharply. Traditionally, oversmoothing has been quantified using metrics that measure the similarity of neighbouring no…

Cited by 5SourceScholar