SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics
Connor Holmes, Frederike D\"umbgen, Timothy D. Barfoot

TL;DR
SDPRLayers introduces a method combining convex relaxations with implicit differentiation to ensure certifiable correctness of gradients in differentiable optimization, improving robustness in robotics applications.
Contribution
The paper presents SDPRLayers, a novel approach that integrates convex relaxations with implicit differentiation to provide certifiably correct solutions and gradients in differentiable optimization.
Findings
Demonstrated potential pitfalls of local optimization in differentiable methods.
Applied SDPRLayers to real-world robot localization, improving robustness.
Provided open-source implementation in PyTorch.
Abstract
A recent set of techniques in the robotics community, known as certifiably correct methods, frames robotics problems as polynomial optimization problems (POPs) and applies convex, semidefinite programming (SDP) relaxations to either find or certify their global optima. In parallel, differentiable optimization allows optimization problems to be embedded into end-to-end learning frameworks and has received considerable attention in the robotics community. In this paper, we consider the ill effect of convergence to spurious local minima in the context of learning frameworks that use differentiable optimization. We present SDPRLayers, an approach that seeks to address this issue by combining convex relaxations with implicit differentiation techniques to provide certifiably correct solutions and gradients throughout the training process. We provide theoretical results that outline conditions…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Formal Methods in Verification · Robotic Path Planning Algorithms
