Paolo Sylos Labini

Paolo Sylos Labini

Auto-generated profile, based on publicly available information

Paolo Sylos Labini

Free University of Bozen-Bolzano,Bolzano,Italy

Research Focus & Metrics

Academic Career Length

26Years (2001-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 November 2023
Verified
Conference Paper
Open access
MBMaciej Besta
Maciej Besta
PRPawel Renc
Pawel Renc
RGRobert Gerstenberger
Robert Gerstenberger
PLPaolo Sylos Labini
Paolo Sylos Labini
AZAlexandros Ziogas
Alexandros Ziogas
THTorsten Hoefler
Torsten Hoefler
Graph attention models (A-GNNs), a type of Graph Neural Networks (GNNs), have been shown to be more powerful than simpler convolutional GNNs (C-GNNs). However, A-GNNs are more complex to program and difficult to scale. To address this, we develop a novel mathematical formulation, based on tensors that group all the feature vectors, targeting both training and inference of A-GNNs. The formulation enables straightforward adoption of communication-minimizing routines, it fosters optimizations such as vectorization, and it enables seamless integration with established linear algebra DSLs or libraries such as GraphBLAS. Our implementation uses a data redistribution scheme explicitly developed for sparse-dense tensor operations used heavily in GNNs, and fusing optimizations that further minimize memory usage and communication cost. We ensure theoretical asymptotic reductions in communicated data compared to the established message-passing GNN paradigm. Finally, we provide excellent scalability and speedups of even 4--5x over modern libraries such as Deep Graph Library.

20 March 2024
Verified
Conference Paper
Closed access
PLPaolo Sylos Labini
Paolo Sylos Labini
AJAndrej Jurco
Andrej Jurco
MCMatteo Ceccarello
Matteo Ceccarello
SGStefano Guarino
Stefano Guarino
EMEnrico Mastrostefano
Enrico Mastrostefano
FVFlavio Vella
Flavio Vella
Structural centrality measures are often used to approximate or predict dynamical influence in a network. The recently proposed Expected Force of Infection (ExF) measures the entropy of all potential transmission paths starting at a node, effectively characterizing a node's role in epidemic diffusion processes. However, this promising metric has seen limited adoption mainly due to an inefficient formulation and the lack of an open-source implementation. In this paper, we present a novel cluster-centric, parallel algorithm enhancing ExF's efficiency and scalability. Compared to the simple parallel version of the original formulation of the ExF our efficient, open-source GPU implementation enables key nodes detection at previously intractable scales, with speed-ups of up to 300 x on networks with up to 44 million edges. Leveraging on our algorithm, we compare the ExF with other well-known centrality metrics, upon six real and synthetic contact networks. The ExF emerges as the best of the considered metrics in a few, important tasks: it predicts the likelihood of a global epidemic and its diffusion speed, based on the centrality of the seed node; and it predicts how many other infections will occur as a consequence, in some sense, of a specific node having caught the disease.

10 May 2001
Verified
Book Chapter
Closed access
PLPaolo Sylos Labini
Paolo Sylos Labini