Search Results for author: Arthur Leclaire

Found 10 papers, 5 papers with code

Plug-and-Play image restoration with Stochastic deNOising REgularization

1 code implementation1 Feb 2024 Marien Renaud, Jean Prost, Arthur Leclaire, Nicolas Papadakis

Even if they produce impressive image restoration results, these algorithms rely on a non-standard use of a denoiser on images that are less and less noisy along the iterations, which contrasts with recent algorithms based on Diffusion Models (DM), where the denoiser is applied only on re-noised images.

Deblurring Denoising +1

Convergent plug-and-play with proximal denoiser and unconstrained regularization parameter

no code implementations2 Nov 2023 Samuel Hurault, Antonin Chambolle, Arthur Leclaire, Nicolas Papadakis

The stepsize condition for nonconvex convergence of the proximal algorithm in use then translates to restrictive conditions on the regularization parameter of the inverse problem.

Deblurring Image Restoration +1

On the potential benefits of entropic regularization for smoothing Wasserstein estimators

no code implementations13 Oct 2022 Jérémie Bigot, Paul Freulon, Boris P. Hejblum, Arthur Leclaire

This paper is focused on the study of entropic regularization in optimal transport as a smoothing method for Wasserstein estimators, through the prism of the classical tradeoff between approximation and estimation errors in statistics.

Proximal Denoiser for Convergent Plug-and-Play Optimization with Nonconvex Regularization

1 code implementation31 Jan 2022 Samuel Hurault, Arthur Leclaire, Nicolas Papadakis

Given this new result, we exploit the convergence theory of proximal algorithms in the nonconvex setting to obtain convergence results for PnP-PGD (Proximal Gradient Descent) and PnP-ADMM (Alternating Direction Method of Multipliers).

Deblurring Denoising +2

Gradient Step Denoiser for convergent Plug-and-Play

1 code implementation ICLR 2022 Samuel Hurault, Arthur Leclaire, Nicolas Papadakis

Exploiting convergence results for proximal gradient descent algorithms in the non-convex setting, we show that the proposed Plug-and-Play algorithm is a convergent iterative scheme that targets stationary points of an explicit global functional.

Deblurring Super-Resolution

On the Existence of Optimal Transport Gradient for Learning Generative Models

no code implementations10 Feb 2021 Antoine Houdard, Arthur Leclaire, Nicolas Papadakis, Julien Rabin

Training of WGAN relies on a theoretical background: the calculation of the gradient of the optimal transport cost with respect to the generative model parameters.

valid

Projected gradient descent for non-convex sparse spike estimation

no code implementations12 May 2020 Yann Traonmilin, Jean-François Aujol, Arthur Leclaire

We propose a new algorithm for sparse spike estimation from Fourier measurements.

Cannot find the paper you are looking for? You can Submit a new open access paper.