Learning to Optimize by Differentiable Programming

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Tao, Liping, Tong, Xindi, Tan, Chee Wei
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912930721693696
author Tao, Liping
Tong, Xindi
Tan, Chee Wei
author_facet Tao, Liping
Tong, Xindi
Tan, Chee Wei
contents Solving massive-scale optimization problems requires scalable first-order methods with low per-iteration cost. This tutorial highlights a shift in optimization: using differentiable programming not only to execute algorithms but to learn how to design them. Modern frameworks such as PyTorch, TensorFlow, and JAX enable this paradigm through efficient automatic differentiation. Embedding first-order methods within these systems allows end-to-end training that improves convergence and solution quality. Guided by Fenchel-Rockafellar duality, the tutorial demonstrates how duality-informed iterative schemes such as ADMM and PDHG can be learned and adapted. Case studies across LP, OPF, Laplacian regularization, and neural network verification illustrate these gains.
format Preprint
id arxiv_https___arxiv_org_abs_2601_16510
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Learning to Optimize by Differentiable Programming
Tao, Liping
Tong, Xindi
Tan, Chee Wei
Mathematical Software
Machine Learning
Optimization and Control
Solving massive-scale optimization problems requires scalable first-order methods with low per-iteration cost. This tutorial highlights a shift in optimization: using differentiable programming not only to execute algorithms but to learn how to design them. Modern frameworks such as PyTorch, TensorFlow, and JAX enable this paradigm through efficient automatic differentiation. Embedding first-order methods within these systems allows end-to-end training that improves convergence and solution quality. Guided by Fenchel-Rockafellar duality, the tutorial demonstrates how duality-informed iterative schemes such as ADMM and PDHG can be learned and adapted. Case studies across LP, OPF, Laplacian regularization, and neural network verification illustrate these gains.
title Learning to Optimize by Differentiable Programming
topic Mathematical Software
Machine Learning
Optimization and Control
url https://arxiv.org/abs/2601.16510