Robust Data-Driven Accelerated Mirror Descent

Learning-to-optimize is an emerging framework that leverages training data to speed up the solution of certain optimization problems. One such approach is based on the classical mirror descent algorithm, where the mirror map is modelled using input-convex neural networks. In this work, we extend this functional parameterization approach by introducing momentum into the iterations, based on the classical accelerated mirror descent. Our approach combines short-time accelerated convergence with stable long-time behavior. We empirically demonstrate additional robustness with respect to multiple parameters on denoising and deconvolution experiments.

[1]  C. Schonlieb,et al.  Data-Driven Mirror Descent with Input-Convex Neural Networks , 2022, SIAM J. Math. Data Sci..

[2]  Nicolas Loizou,et al.  Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize , 2021, ArXiv.

[3]  P. Maass,et al.  LoDoPaB-CT, a benchmark dataset for low-dose computed tomography reconstruction , 2021, Scientific data.

[4]  W. Yin,et al.  Learning to Optimize: A Primer and A Benchmark , 2021, J. Mach. Learn. Res..

[5]  Blake E. Woodworth,et al.  Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent , 2020, AISTATS.

[6]  Peter Richtarik,et al.  Accelerated Bregman proximal gradient methods for relatively smooth convex optimization , 2018, Computational Optimization and Applications.

[7]  Johan Karlsson,et al.  Data-Driven Nonsmooth Optimization , 2018, SIAM J. Optim..

[8]  J. Z. Kolter,et al.  Input Convex Neural Networks , 2016, ICML.

[9]  Alexandre M. Bayen,et al.  Accelerated Mirror Descent in Continuous and Discrete Time , 2015, NIPS.

[10]  Stephen P. Boyd,et al.  A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights , 2014, J. Mach. Learn. Res..

[11]  Sayan Mukherjee,et al.  The Information Geometry of Mirror Descent , 2013, IEEE Transactions on Information Theory.

[12]  Koby Crammer,et al.  A generalized online mirror descent with applications to classification and regression , 2013, Machine Learning.

[13]  Michael I. Jordan,et al.  Ergodic mirror descent , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Yang Wang,et al.  Total Variation Wavelet-Based Medical Image Denoising , 2006, Int. J. Biomed. Imaging.

[15]  Faming Liang,et al.  Statistical and Computational Inverse Problems , 2006, Technometrics.

[16]  Marc Teboulle,et al.  Mirror descent and nonlinear projected subgradient methods for convex optimization , 2003, Oper. Res. Lett..

[17]  E. Loli Piccolomini,et al.  An efficient method for nonnegatively constrained Total Variation-based denoising of medical images corrupted by Poisson noise , 2012, Comput. Medical Imaging Graph..

[18]  G. Evans,et al.  Learning to Optimize , 2008 .

[19]  Arkadi Nemirovski,et al.  The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography , 2001, SIAM J. Optim..

[20]  R. Tyrrell Rockafellar,et al.  Variational Analysis , 1998, Grundlehren der mathematischen Wissenschaften.

[21]  John Darzentas,et al.  Problem Complexity and Method Efficiency in Optimization , 1983 .

[22]  Y. Nesterov A method for solving the convex programming problem with convergence rate O(1/k^2) , 1983 .