Search Results for author: Giuseppe Alessio D'Inverno

Found 6 papers, 3 papers with code

Extension of Recurrent Kernels to different Reservoir Computing topologies

no code implementations25 Jan 2024 Giuseppe Alessio D'Inverno, Jonathan Dong

Reservoir Computing (RC) has become popular in recent years due to its fast and efficient computational capabilities.

VC dimension of Graph Neural Networks with Pfaffian activation functions

1 code implementation22 Jan 2024 Giuseppe Alessio D'Inverno, Monica Bianchini, Franco Scarselli

Graph Neural Networks (GNNs) have emerged in recent years as a powerful tool to learn tasks across a wide range of graph domains in a data-driven fashion; based on a message passing mechanism, GNNs have gained increasing popularity due to their intuitive formulation, closely linked with the Weisfeiler-Lehman (WL) test for graph isomorphism, to which they have proven equivalent.

A topological description of loss surfaces based on Betti Numbers

no code implementations8 Jan 2024 Maria Sofia Bucarelli, Giuseppe Alessio D'Inverno, Monica Bianchini, Franco Scarselli, Fabrizio Silvestri

In the context of deep learning models, attention has recently been paid to studying the surface of the loss function in order to better understand training with methods based on gradient descent.

Generalization Limits of Graph Neural Networks in Identity Effects Learning

1 code implementation30 Jun 2023 Giuseppe Alessio D'Inverno, Simone Brugiapaglia, Mirco Ravanelli

They are usually based on a message-passing mechanism and have gained increasing popularity for their intuitive formulation, which is closely linked to the Weisfeiler-Lehman (WL) test for graph isomorphism to which they have been proven equivalent in terms of expressive power.

Weisfeiler--Lehman goes Dynamic: An Analysis of the Expressive Power of Graph Neural Networks for Attributed and Dynamic Graphs

no code implementations8 Oct 2022 Silvia Beddar-Wiesing, Giuseppe Alessio D'Inverno, Caterina Graziani, Veronica Lachi, Alice Moallemy-Oureh, Franco Scarselli, Josephine Maria Thomas

Then, the results on the expressive power of GNNs are extended by proving that GNNs have the same capability as the 1-WL test in distinguishing dynamic and attributed graphs, the 1-WL equivalence equals unfolding equivalence and that GNNs are universal approximators modulo 1-WL/unfolding equivalence.

On the approximation capability of GNNs in node classification/regression tasks

1 code implementation16 Jun 2021 Giuseppe Alessio D'Inverno, Monica Bianchini, Maria Lucia Sampoli, Franco Scarselli

Furthermore, all current results are dedicated to graph classification/regression tasks, where the GNN must produce a single output for the whole graph, while also node classification/regression problems, in which an output is returned for each node, are very common.

Clustering Graph Classification +2

Cannot find the paper you are looking for? You can Submit a new open access paper.