Reinforcement Learning to Accelerate Primal-Dual Hybrid Gradient for Linear Programming

arXiv:2610.01546v1 Announce Type: cross Abstract: Primal-dual hybrid gradient (PDHG) methods solve large-scale linear programs (LPs) using GPU-friendly matrix-vector products and projections, but their practical performance depends on coordinating algorithm parameters, acceleration, and restarts. We introduce GALLOP, which uses reinforcement learning to jointly learn continuous algorithm parameters and discrete restart decisions without differentiating through the solver. Its generalized accelerated PDHG update combines separate primal and dual extrapolation, history corrections, and restart anchoring with independently adjustable coefficients. We train a dimension-agnostic feedback policy using a groupwise proximal policy optimization objective that clips likelihood ratios separately for different control groups and excludes inactive acceleration controls on restart transitions. We evaluate GALLOP on six LP families and a public item-placement benchmark. On the main evaluation settings across the six families, GALLOP reduces iteration counts by factors of 1.9-5.6 and achieves up to a 16.0imes speedup in algorithm wall-clock time over MPAX. With one policy trained per family, the learned policies generalize without retraining to within-family LPs 3imes-400imes larger than the largest training instances, including Transport LPs with 10.24 million variables.

Related

• Adaptive hybrid coupling with operator inference, the overlapping Schwarz alternating method and reinforcement learning
• iScheduler: Reinforcement Learning-Driven Continual Optimization for Large-Scale Resource Investment Problems
• GradMAP: Gradient-Based Multi-Agent Proximal Learning for Grid-Edge Flexibility

Source: arXiv cs.AI | 2026-10-02