ADA-PT: An Adaptive Parameter Tuning Strategy Based on the Weighted Stein Unbiased Risk Estimator

The performance of iterative algorithms aimed at solving a regularized least squares problem typically depends on the value of some regularization parameter. Tuning the regularization parameter value is a fundamental step necessary to control the strength of the regularization and hence ensure a good performance. We address the problem of finding the optimal regularization parameter in such iterative algorithms. We propose to adaptively adjust the regularization parameter throughout the iterations of the algorithm by minimizing an estimate of the current risk, typically the Weighted Stein unbiased risk estimate (WSURE). We then prove that, for the case of the Tikhonov regularization, the proposed ADAptive Parameter Tuning (ADA-PT) strategy provides a stationary point consistent with the risk minimizer. We illustrate the efficiency of ADA-PT on two image deconvolution problems: one with the Tikhonov regularization and one with the weighted $\ell-1$ analysis wavelet regularization.

[1]  J. Anderson,et al.  LOFAR sparse image reconstruction , 2014, 1406.7242.

[2]  Gene H. Golub,et al.  Generalized cross-validation as a method for choosing a good ridge parameter , 1979, Milestones in Matrix Computation.

[3]  Yonina C. Eldar,et al.  The Projected GSURE for Automatic Parameter Tuning in Iterative Shrinkage Methods , 2010, Applied and Computational Harmonic Analysis.

[4]  Mohamed-Jalal Fadili,et al.  Stein Unbiased GrAdient estimator of the Risk (SUGAR) for Multiple Parameter Selection , 2014, SIAM J. Imaging Sci..

[5]  Teresa Reginska,et al.  A Regularization Parameter in Discrete Ill-Posed Problems , 1996, SIAM J. Sci. Comput..

[6]  Yves Wiaux,et al.  PURIFY: a new approach to radio-interferometric imaging , 2013, 1307.4370.

[7]  V. Morozov On the solution of functional equations by the method of regularization , 1966 .

[8]  Dianne P. O'Leary,et al.  The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems , 1993, SIAM J. Sci. Comput..

[9]  Thierry Blu,et al.  Blind optimization of algorithm parameters for signal denoising by Monte-Carlo SURE , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[10]  Yonina C. Eldar Generalized SURE for Exponential Families: Applications to Regularization , 2008, IEEE Transactions on Signal Processing.

[11]  W. Clem Karl,et al.  3.6 – Regularization in Image Restoration and Reconstruction , 2005 .

[12]  Bang Công Vu,et al.  A splitting algorithm for dual monotone inclusions involving cocoercive operators , 2011, Advances in Computational Mathematics.

[13]  Laurent Condat,et al.  A Generic Proximal Algorithm for Convex Optimization—Application to Total Variation Minimization , 2014, IEEE Signal Processing Letters.

[14]  Jeffrey A. Fessler,et al.  Regularization Parameter Selection for Nonlinear Iterative Image Restoration and MRI Reconstruction Using GCV and SURE-Based Methods , 2012, IEEE Transactions on Image Processing.

[15]  Jean-Philippe Thiran,et al.  Scalable splitting algorithms for big-data interferometric imaging in the SKA era , 2016, 1601.04026.

[16]  C. Stein Estimation of the Mean of a Multivariate Normal Distribution , 1981 .

[17]  David Mary,et al.  Distributed multi-frequency image reconstruction for radio-interferometry , 2016, 2016 24th European Signal Processing Conference (EUSIPCO).

[18]  David Mary,et al.  Multi-frequency image reconstruction for radio-interferometry with self-tuned regularization parameters , 2017, 2017 25th European Signal Processing Conference (EUSIPCO).