Bilevel learning of l1-regularizers with closed-form gradients(BLORC)
원문 초록
We present a method for supervised learning of sparsity-promoting regularizers, a key ingredient in many modern signal reconstruction problems. The parameters of the regularizer are learned to minimize the mean squared error of reconstruction on a training set of ground truth signal and measurement pairs. Training involves solving a challenging bilevel optimization problem with a nonsmooth lower-level objective. We derive an expression for the gradient of the training loss using the implicit closed-form solution of the lower-level variational problem given by its dual problem, and provide an accompanying gradient descent algorithm (dubbed BLORC) to minimize the loss. Our experiments on simple natural images and for denoising 1D signals show that the proposed method can learn meaningful operators and the analytical gradients calculated are faster than standard automatic differentiation methods. While the approach we present is applied to denoising, we believe that it can be adapted to a wide-variety of inverse problems with linear measurement models, thus giving it applicability in a wide range of scenarios.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Refining Few-Step Text-to-Multiview Diffusion via Reinforcement Learning
On Designing Diffusion Autoencoders for Efficient Generation and Representation Learning
ScoreAdv: Score-based Targeted Generation of Natural Adversarial Examples via Diffusion Models
LangMamba: A Language-driven Mamba Framework for Low-dose CT Denoising with Vision-language Models
Hierarchical Intent-guided Optimization with Pluggable LLM-Driven Semantics for Session-based Recommendation
Energy-Based Transformers are Scalable Learners and Thinkers
토론
이 논문과 연결된 포럼 글이 아직 없습니다.