Goto

Collaborating Authors

 proximal operator


Learning Elastic Costs to Shape Monge Displacements

Neural Information Processing Systems

Given a source and a target probability measure, the Monge problem studies efficient ways to map the former onto the latter. This efficiency is quantified by defining a cost function between source and target data.






Convergent Bregman Plug-and-Play Image Restoration for Poisson Inverse Problems

Neural Information Processing Systems

Plug-and-Play (PnP) methods are efficient iterative algorithms for solving ill-posed image inverse problems. PnP methods are obtained by using deep Gaussian denois-ers instead of the proximal operator or the gradient-descent step within proximal algorithms.



84fec9a8e45846340fdf5c7c9f7ed66c-Supplemental.pdf

Neural Information Processing Systems

While this could be done using thesynthesis formulation, we demonstrate that this leads to slower performances. The main difficulty inapplying suchmethods intheanalysisformulation liesinproposing a way to compute the derivatives through the proximal operator.



Fasterproximalalgorithmsformatrixoptimization usingJacobi-basedeigenvaluemethods

Neural Information Processing Systems

In this paper we propose to use an old and surprisingly simple method due to Jacobi to compute these eigenvalue and singular value decompositions, and we demonstrate that it can lead to substantial gains in terms of computation time compared to standard approaches.