← Search

Quentin Barthélemy

4 accepted papers

2026

Equivariant Splitting: Self-supervised learning from incomplete data

ICLR 2026poster

Self-supervised learning for inverse problems allows to train a reconstruction network from noise and/or incomplete data alone. These methods have the potential of enabling learning-based solutions when obtaining ground-truth references for training is expensive or even impossible. In this paper, we…

Cited by 0Source ↗Scholar ↗
2025

Bridging the Theoretical Gap in Randomized Smoothing

AISTATS 2025poster

Randomized smoothing has become a leading approach for certifying adversarial robustness in machine learning models. However, a persistent gap remains between theoretical certified robustness and empirical robustness accuracy. This paper introduces a new framework that bridges this gap by leveraging…

Cited by 0Source ↗code ↗Scholar ↗
2024

The Lipschitz-Variance-Margin Tradeoff for Enhanced Randomized Smoothing

ICLR 2024poster

Real-life applications of deep neural networks are hindered by their unsteady predictions when faced with noisy inputs and adversarial attacks. The certified radius in this context is a crucial indicator of the robustness of models. However how to design an efficient classifier with an associated ce…

Cited by 5Source ↗PDF ↗Scholar ↗
2023

Efficient Bound of Lipschitz Constant for Convolutional Layers by Gram Iteration

ICML 2023poster

Since the control of the Lipschitz constant has a great impact on the training stability, generalization, and robustness of neural networks, the estimation of this value is nowadays a real scientific challenge. In this paper we introduce a precise, fast, and differentiable upper bound for the spectr…