190 citations · 442 across the 17 of their papers we have counts for
8 papers · 1 filter
In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting
Constantin Philippenko, Kevin Scaman, Laurent Massoulié
We analyze a distributed algorithm to compute a low-rank matrix factorization on clients, each holding a local dataset , mathematica…
Convergence beyond the over-parameterized regime using Rayleigh quotients
David A. R. Robin, Kevin Scaman, Marc Lelarge
In this paper, we present a new strategy to prove the convergence of deep learning architectures to a zero training (or even testing) loss by gradient flow. Our analysis is centere…
Lipschitz Normalization for Self-Attention Layers with Application to Graph Neural Networks
George Dasoulas, Kevin Scaman, Aladin Virmaux
Attention based neural networks are state of the art in a large range of applications. However, their performance tends to degrade when the number of layers increases. In this work…
Improving Hierarchical Adversarial Robustness of Deep Neural Networks
Avery Ma, Aladin Virmaux, Kevin Scaman +1
Do all adversarial examples have the same consequences? An autonomous driving system misclassifying a pedestrian as a car may induce a far more dangerous -- and even potentially le…
Ego-based Entropy Measures for Structural Representations on Graphs
George Dasoulas, Giannis Nikolentzos, Kevin Scaman +2
Machine learning on graph-structured data has attracted high research interest due to the emergence of Graph Neural Networks (GNNs). Most of the proposed GNNs are based on the node…
Ego-based Entropy Measures for Structural Representations
George Dasoulas, Giannis Nikolentzos, Kevin Scaman +2
In complex networks, nodes that share similar structural characteristics often exhibit similar roles (e.g type of users in a social network or the hierarchical position of employee…
Coloring graph neural networks for node disambiguation
George Dasoulas, Ludovic Dos Santos, Kevin Scaman +1
In this paper, we show that a simple coloring scheme can improve, both theoretically and empirically, the expressive power of Message Passing Neural Networks(MPNNs). More specifica…
KONG: Kernels for ordered-neighborhood graphs
Moez Draief, Konstantin Kutzkov, Kevin Scaman +1
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are…