paper-with-me

홈 › Papers

A lifted Bregman strategy for training unfolded proximal neural network Gaussian denoisers

2024-08-16 · Xiaoyu Wang, Martin Benning, Audrey Repetti

Unfolded proximal neural networks (PNNs) form a family of methods that combines deep learning and proximal optimization approaches. They consist in designing a neural network for a specific task by unrolling a proximal algorithm for a fixed number of iterations, where linearities can be learned from prior training procedure. PNNs have shown to be more robust than traditional deep learning approaches while reaching at least as good performances, in particular in computational imaging. However, training PNNs still depends on the efficiency of available training algorithms. In this work, we propose a lifted training formulation based on Bregman distances for unfolded PNNs. Leveraging the deterministic mini-batch block-coordinate forward-backward method, we design a bespoke computational strategy beyond traditional back-propagation methods for solving the resulting learning problem efficiently. We assess the behaviour of the proposed training approach for PNNs through numerical simulations on image denoising, considering a denoising PNN whose structure is based on dual proximal-gradient iterations.

📄 PDF Abstract BibTeX arXiv:2408.08742

Code (0)

등록된 구현이 없습니다.

Tasks

DenoisingImage Denoising

Similar Papers 제목 키워드 기반

A Unified Framework for Lifted Training and Inversion Approaches

2025-10-10 · Xiaoyu Wang, Alexandra Valavanis, Azhir Mahmood, Andreas Mang 외 arxiv

The training of deep neural networks predominantly relies on a combination of gradient-based optimisation and back-propagation for the computation of the gradient. While incredibly successful, this approach faces challen…

Lifted Bregman Training of Neural Networks

2022-08-18 · Xiaoyu Wang, Martin Benning

We introduce a novel mathematical formulation for the training of feed-forward neural networks with (potentially non-smooth) proximal maps as activation functions. This formulation is based on Bregman distances and a key…

Denoising

Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Non-Convex Optimization

2019-04-06 · Mahesh Chandra Mukkamala, Peter Ochs, Thomas Pock, Shoham Sabach

Backtracking line-search is an old yet powerful strategy for finding a better step sizes to be used in proximal gradient algorithms. The main principle is to locally find a simple convex upper bound of the objective func…

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

2023-06-06 · NeurIPS 2023 11

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

Image Restoration

Variable Bregman Majorization-Minimization Algorithm and its Application to Dirichlet Maximum Likelihood Estimation

2025-01-13 · Ségolène Martin, Jean-Christophe Pesquet, Gabriele Steidl, Ismail Ben Ayed

We propose a novel Bregman descent algorithm for minimizing a convex function that is expressed as the sum of a differentiable part (defined over an open set) and a possibly nonsmooth term. The approach, referred to as t…