4 papers
Structured vs. Unstructured Pruning: An Exponential Gap
Davide Ferre', Frédéric Giroire, Frederik Mallmann-Trenn +1
The Strong Lottery Ticket Hypothesis (SLTH) states that large, randomly initialized neural networks contain sparse subnetworks capable of approximating a target function at initial…
DejaVu: A Minimalistic Mechanism for Distributed Plurality Consensus
Francesco d'Amore, Niccolò D'Archivio, George Giakkoupis +2
We study the plurality consensus problem in distributed systems where a population of extremely simple agents, each initially holding one of opinions, aims to agree on the init…
Degree-Mass Message Passing for Betweenness Ranking in Directed and Undirected Networks
Justin Dachille, Aurora Rossi, Sunil Kumar Maurya +6
Computing the importance of nodes in networks is a long-standing fundamental problem that has driven extensive study of various centrality measures. A particularly well-known centr…
On the Sparsity of the Strong Lottery Ticket Hypothesis
Emanuele Natale, Davide Ferre', Giordano Giambartolomei +2
Considerable research efforts have recently been made to show that a random neural network contains subnetworks capable of accurately approximating any given neural network tha…