2 citations · 2 across the 9 of their papers we have counts for
3 papers · 1 filter
PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms
Etienne Lasalle, Rémi Vaudaine, Titouan Vayer +4
Clustering the nodes of a graph is a cornerstone of graph analysis and has been extensively studied. However, some popular methods are not suitable for very large graphs: e.g., spe…
Butterfly factorization with error guarantees
Quoc-Tung Le, Léon Zheng, Elisa Riccietti +1
In this paper, we investigate the butterfly factorization problem, i.e., the problem of approximating a matrix by a product of sparse and structured factors. We propose a new forma…
A Rescaling-Invariant Lipschitz Bound Based on Path-Metrics for Modern ReLU Network Parameterizations
Antoine Gonon, Nicolas Brisebarre, Elisa Riccietti +1
Robustness with respect to weight perturbations underpins guarantees for generalization, pruning and quantization. Existing guarantees rely on Lipschitz bounds in parameter space,…