Metraipolis › archive › dc_a57dea437658

RapidDOC: Riccati-Preconditioned Implicit Differentiation for Differentiable Optimal Control under Operator Mismatch — arXiv:2610.41324

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41324
License (as archived)
CC0-1.0
Archived
2026-11-02T04:57:24.265Z
SHA-256 of the archived text
dba3864138927fcf428ad420e007f6ac2a7d3244e39ac167110e321dd9604e37
Stable URL of this page
https://metraipolis.com/documento/dc_a57dea437658

How to cite

RapidDOC: Riccati-Preconditioned Implicit Differentiation for Differentiable Optimal Control under Operator Mismatch — arXiv:2610.41324 — arXiv (en), https://arxiv.org/abs/2610.41324 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a57dea437658 (Metraipolis archive dc_a57dea437658, sha256 dba3864138927fcf428ad420e007f6ac2a7d3244e39ac167110e321dd9604e37)
BibTeX
@misc{dca57dea437658,
  title = {RapidDOC: Riccati-Preconditioned Implicit Differentiation for Differentiable Optimal Control under Operator Mismatch — arXiv:2610.41324},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41324},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a57dea437658; sha256 dba3864138927fcf428ad420e007f6ac2a7d3244e39ac167110e321dd9604e37},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41324. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Differentiable optimal control embeds constrained optimization problems in data-driven pipelines by differentiating their optimality conditions and propagating task-loss gradients to model or objective parameters. A key observation is that forward optimization and backward sensitivity computation involve related stage-structured linear systems, making reuse of forward factorization information natural. However, direct reuse is generally invalid, because differences in linearization, barrier terms, regularization, and curvature can create a mismatch between the retained forward operator and the target operator defining the derivative. We therefore propose RapidDOC, a factorization-reuse method that leaves the target adjoint equation unchanged. The retained cache produces a candidate adjoint and, when its target residual exceeds the prescribed tolerance, serves as a fixed right preconditioner for GMRES. A cache-action error operator characterizes directional exactness, the preconditioned iteration, and the relation between target residual and outer-gradient error. An ablation on three constrained robotic OCPs shows that the proposed method achieves lower backward time than both target-system refactorization and a no-reuse iterative method, demonstrating the computational benefit of reusing the retained forward factorizations. Across open- and closed-loop parameter-learning experiments, the proposed method achieves learning performance comparable to the baselines, while yielding the lowest open-loop backward time on all three tasks and reducing total closed-loop solver-call time by 40.5-83.1% relative to the fastest competing method. Finally, deploying the learned controller on a physical vehicle reduces the median figure-eight tracking RMSE from 22.75 to 6.09 cm, demonstrating its potential for hardware deployment.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.41324 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:46:57.661Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).