Bilevel Programming Approach for Image Restoration Problems with Automatically Hyperparameter Selection
Hang Xie, Xuewen Li, Peili Li, and Qiuyu Wang

TL;DR
This paper introduces a bilevel programming method for automatic hyperparameter selection in image restoration, improving quality and efficiency over manual tuning.
Contribution
It presents a novel bilevel programming framework with convergence guarantees for automated hyperparameter tuning in image restoration.
Findings
Achieves higher restoration quality than existing methods.
Reduces computational time for hyperparameter tuning.
Demonstrates effectiveness on both simulated and real images.
Abstract
In optimization-based image restoration models, the correct selection of hyperparameters is crucial for achieving superior performance. However, current research typically involves manual tuning of these hyperparameters, which is highly time-consuming and often lacks accuracy. In this paper, we concentrate on the automated selection of hyperparameters in the context of image restoration and present a bilevel programming approach that can simultaneously select the optimal hyperparameters and achieve high-quality restoration results. For implementation, we reformulate the bilevel programming problem that incorporates an inequality constraint related to the difference-of-convex functions. Following this, we address a sequence of nonsmooth convex programming problems by employing a feasibility penalty function along with a proximal point term. In this context, the nonsmooth convex…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
