Mathematical Optimization for Data Science Group, Saarland University

Welcome to the homepage of the

Mathematical Optimization for Data Science Group

Department of Mathematics and Computer Science, Saarland University, Germany

Home
Teaching
Research
Publications
Job Offers

Saarland
University

Mathematics
and

Computer Science

Understanding the Curse of Unrolling

S. Mehmood, F. Knoll and P. Ochs

Abstract:
Numerous Optimization Algorithms have a time-varying update rule thanks to, for instance, a changing step size, momentum parameter or, Hessian approximation. In this paper, we apply unrolled or automatic differentiation to a time-varying iterative process and provide convergence (rate) guarantees for the resulting derivative iterates. We adapt these convergence results and apply them to proximal gradient descent with variable step size and FISTA when solving partly smooth problems. We confirm our findings numerically by solving l1 and l2-regularized linear and logisitc regression respectively. Our theoretical and numerical results show that the convergence rate of the algorithm is reflected in its derivative iterates.



pdf	Bibtex	arXiv

Latest update: 23.02.2026

Citation:
S. Mehmood, F. Knoll, P. Ochs:
Understanding the Curse of Unrolling.

Technical Report, ArXiv e-prints, arXiv:2602.19733, 2026.

Bibtex:
@techreport{MO26, title = {Understanding the Curse of Unrolling}, author = {S. Mehmood and F. Knoll and P. Ochs}, year = {2026}, journal = {ArXiv e-prints, arXiv:2602.19733}, }

Impressum
Datenschutz