activity
20092026
most citedWavelets on Graphs via Spectral Graph Theory

2 citations · 2 across the 9 of their papers we have counts for

collaborators

10 papers

eess.SP2026

On the Real Part of Butterfly Factorizations, with Application to Fast Transforms

Ma{ë}l Chaumette, R{é}mi Gribonval, Elisa Riccietti

Fast transforms such as the Discrete Cosine Transform can be expressed as the real part of a product of complex-valued structured sparse matrices known as Kronecker-sparse factors.…

stat.ML2026

Path-conditioned training: a principled way to rescale ReLU neural networks

Arthur Lebeurrier, Titouan Vayer, Rémi Gribonval

Despite recent algorithmic advances, we still lack principled ways to leverage the well-documented rescaling symmetries in ReLU neural network parameters. While two properly rescal…

stat.ML2025

Non-Vacuous Generalization Bounds: Can Rescaling Invariances Help?

Damien Rouchouse, Antoine Gonon, Rémi Gribonval +1

A central challenge in understanding generalization is to obtain non-vacuous guarantees that go beyond worst-case complexity over data or weight space. Among existing approaches, P…

cs.LG2024

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…

math.OC2024

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…

cs.LG2024

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,…

stat.ML2023

Compressive Recovery of Sparse Precision Matrices

Titouan Vayer, Etienne Lasalle, Rémi Gribonval +1

We consider the problem of learning a graph modeling the statistical relations of the variables from a dataset with samples . Standard approa…

stat.ML2023

A path-norm toolkit for modern networks: consequences, promises and challenges

Antoine Gonon, Nicolas Brisebarre, Elisa Riccietti +1

This work introduces the first toolkit around path-norms that fully encompasses general DAG ReLU networks with biases, skip connections and any operation based on the extraction of…

cs.IT2022

Approximation speed of quantized vs. unquantized ReLU neural networks and beyond

Antoine Gonon, Nicolas Brisebarre, Rémi Gribonval +1

We deal with two complementary questions about approximation properties of ReLU networks. First, we study how the uniform quantization of ReLU networks with real-valued weights imp…

math.FA2009★ 2 cited

Wavelets on Graphs via Spectral Graph Theory

David K Hammond, Pierre Vandergheynst, Rémi Gribonval

We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling…