English

Robust Data-Driven Accelerated Mirror Descent

Optimization and Control 2023-06-05 v2

Abstract

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.

Keywords

Cite

@article{arxiv.2210.12238,
  title  = {Robust Data-Driven Accelerated Mirror Descent},
  author = {Hong Ye Tan and Subhadip Mukherjee and Junqi Tang and Andreas Hauptmann and Carola-Bibiane Schönlieb},
  journal= {arXiv preprint arXiv:2210.12238},
  year   = {2023}
}

Comments

Note inconsistency with ICASSP paper for step-size choice in (4c) and associated Alg. 1, this version is correct with step-size kt/r