activity
20212026
most citedNot too little, not too much: a theoretical analysis of graph (over)smoothing

24 citations · 35 across the 14 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

stat.ML2024

Node Regression on Latent Position Random Graphs via Local Averaging

Martin Gjorgjevski, Nicolas Keriven, Simon Barthelmé +1

Node regression consists in predicting the value of a graph label at a node, given observations at the other nodes. To gain some insight into the performance of various estimators…

cs.LG2024

Graph Coarsening with Message-Passing Guarantees

Antonin Joly, Nicolas Keriven

Graph coarsening aims to reduce the size of a large graph while preserving some of its key properties, which has been used in many applications to reduce computational load and mem…