26 citations · 95 across the 9 of their papers we have counts for
4 papers · 1 filter
Aligning random graphs with a sub-tree similarity message-passing algorithm
Giovanni Piccioli, Guilhem Semerjian, Gabriele Sicuro +1
The problem of aligning Erdös-Rényi random graphs is a noisy, average-case version of the graph isomorphism problem, in which a pair of correlated random graphs is observed through…
Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising
Antoine Maillard, Florent Krzakala, Marc Mézard +1
Factorization of matrices where the rank of the two factors diverges linearly with their sizes has many applications in diverse areas such as unsupervised representation learning,…
Large Deviations of Semi-supervised Learning in the Stochastic Block Model
Hugo Cui, Luca Saglietti, Lenka Zdeborová
In community detection on graphs, the semi-supervised learning problem entails inferring the ground-truth membership of each node in a graph, given the connectivity structure and a…
Probing transfer learning with a model of synthetic correlated datasets
Federica Gerace, Luca Saglietti, Stefano Sarao Mannelli +2
Transfer learning can significantly improve the sample efficiency of neural networks, by exploiting the relatedness between a data-scarce target task and a data-abundant source tas…