3 papers
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…