activity
20152026
most citedSelf-supervised learning with rotation-invariant kernels

3 citations · 7 across the 21 of their papers we have counts for

collaborators

24 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.…

eess.SP2026

Multiresolution Block-Coordinate Plug-and-Play Algorithm for Image Reconstruction

Edgar Desainte-Mar{é}ville, Marion Foare, Paulo Gon{\c c}alves +2

Plug-and-Play methods are among the state-of-the-art approaches for image reconstruction, but they do not scale well with the image size. We propose a multiresolution block-coordin…

eess.SP2026

Multiresolution Adaptive Block-Coordinate Forward-Backward for Image Reconstruction

Edgar Desainte-Maréville, Marion Foare, Paulo Gonçalves +2

Classical first-order optimization methods for imaging inverse problems scale poorly with image resolution. Wavelet based multilevel strategies can accelerate convergence under str…

math.OC2025

A flexible block-coordinate forward-backward algorithm for non-smooth and non-convex optimization

Luis Briceño-Arias, Paulo Gonçalves, Guillaume Lauga +2

Block coordinate descent (BCD) methods are prevalent in large scale optimization problems due to the low memory and computational costs per iteration, the predisposition to paralle…

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