Curvature Recycling Douglas-Rachford Splitting: Transported Quasi-Newton Models for Expensive Smooth Proximal Subproblems
arXiv:2607.22895
2026
Optimization
2 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper introduces a practical way to reuse curvature across a sequence of related smooth proximal subproblems instead of restarting an inner optimizer at every Douglas–Rachford iteration. The transferable asset is the exact residual-transport identity: changing only the quadratic proximal center shifts the optimality residual by a known vector, allowing an old proximal state and quasi-Newton model to be reused before evaluating a new expensive gradient. This is relevant to composite neural objectives with expensive differentiable losses and cheap proximal regularizers such as group sparsity, pruning, or structured parameter constraints. A safeguarded limited-memory implementation is the most direct first experiment.
Ideas from this paper
✗ Failed on benchmark
2026
Replace independently restarted proximal-gradient or quasi-Newton solves for a composite neural objective with a curvature-recycling Douglas–Rachford loop. The previous proximal state, residual, and limited-memory BFGS curvature pairs are transported to the next proximal center, reducing expensive loss and gradient evaluations while retaining the cheap nonsmooth proximal operation.
Useful7/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add an acceptance gate around transported quasi-Newton steps: use recycled curvature only when it decreases the smooth proximal merit and reduces the new residual. Otherwise discard the candidate and execute a bounded number of conservative gradient steps, making curvature reuse robust to minibatch changes and stale models.
Useful6/10
Difficulty4/10
Novelty7/10