Residual-Controlled Douglas--Rachford Splitting (RCDRS), a differentiable solver layer for conic linear programs that treats an unrolled solver as a feedback-controlled dynamical system, where a causal controller adapts the relaxation and objective-drive parameters while preserving the projection-splitting structure of Douglas--Rachford splitting.
Abstract
Differentiable solver layers embed constrained optimization into end-to-end learning systems, but fixed-depth unrolling must trade off solution quality, feasibility, and computational budget. We propose Residual-Controlled Douglas--Rachford Splitting (RCDRS), a differentiable solver layer for conic linear programs. RCDRS treats an unrolled solver as a feedback-controlled dynamical system, where a causal controller adapts the relaxation and objective-drive parameters while preserving the projection-splitting structure of Douglas--Rachford splitting. Theoretically, we show that each fixed admissible block remains an averaged relaxed DRS operator and admits finite-step fixed-point residual bounds. We further analyze safeguarded time-varying rollouts as summable perturbations of a limiting averaged operator, and recover terminal primal-dual diagnostics from the final splitting state. Experiments on mixed-cone benchmarks and engineering applications show that RCDRS improves solution quality, feasibility and downstream decision performance. The code is available at https://anonymous.4open.science/r/RC-DRS-180C/.
Optimization layers enable the incorporation of structured constraints and decision problems into learning systems. Training such systems requires differentiating through the embedded optimization problem, which can be challenging for general conic programs. We introduce dOPT, a solver-agnostic framework that, rather t...
Feng-Yu Yang, Connor W. Magoon, Tyler Watts et al.· 0 citations
Interior-point methods (IPMs) are among the most widely used algorithms for constrained optimization, yet their Newton-based search directions require costly second-order information and large linear-system solves. Learning to optimize offers cheaper updates learned from data, but the singular behavior of logarithmic b...
A. Madabhushi, Jia-Lin Liu, Min-Xin Zhang· 0 citations
Differentiable optimization brings the structural guarantees of mathematical optimization to network pipelines, allowing them to be trained end-to-end. However, its application remains challenging for nonconvex constrained problems, as existing differentiable solvers often suffer from limited modeling expressiveness du...
Yuan-Kun Chen, Zi-Fei Nie, Kang-Yu Lin et al.· 0 citations
We study continuous-time multi-asset portfolio choice and consumption under smooth pointwise constraints, including state-dependent feasible sets. The method separates dynamic information acquisition from local constrained recovery. A pointwise-feasible neural actor generates reference rollouts; after training, its rea...
Jaegi Jeon, Jeonggyu Huh, H. Koo et al.· 2 citations
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...
Jinhwan Sul, Alex Oshin, Evangelos A. Theodorou· 0 citations
Neural operators provide fast surrogates for time-dependent PDEs, but autoregressive deployment creates a refinement-allocation problem: prediction errors vary over space and time, while only a finite number of local corrections can be committed along a trajectory. We formulate this as budgeted adaptive neural-operator...
An-Ge Tong· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.