{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/sdprlayers-certifiable-backpropagation","title":"SDPRLayers: Certifiable Backpropagation Through Polynomial Optimization Problems in Robotics","arxiv_id":"2405.19309","date":"2024-05-29","proceeding":null,"authors":["Connor Holmes","Frederike Dümbgen","Timothy D. Barfoot"],"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 for the correctness of these gradients and provide efficient means for their computation. Our approach is first applied to two simple-but-demonstrative simulated examples, which expose the potential pitfalls of reliance on local optimization in existing, state-of-the-art, differentiable optimization methods. We then apply our method in a real-world application: we train a deep neural network to detect image keypoints for robot localization in challenging lighting conditions. We provide our open-source, PyTorch implementation of SDPRLayers.","url_abs":"https://arxiv.org/abs/2405.19309v3","url_pdf":"https://arxiv.org/pdf/2405.19309v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"sdprlayers-certifiable-backpropagation","repo_url":"https://github.com/utiasasrl/sdprlayer","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2405.19309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19309"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/utiasasrl/sdprlayer","reach":null}],"summary":{"ran_fixture":1,"ran_draft_wrong":1,"ran_violates":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"b9edf97da9b778b5","entry":"get_nullspace","repo":"utiasasrl/sdprlayer","repo_kind":"official","path":"src/sdprlayers/layers/sdprlayer.py","file_url":"https://github.com/utiasasrl/sdprlayer/blob/HEAD/src/sdprlayers/layers/sdprlayer.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"b9edf97da9b778b5"}},{"code_sha256_prefix":"a89d0fd991c94657","entry":"make_jac_linop","repo":"utiasasrl/sdprlayer","repo_kind":"official","path":"src/sdprlayers/layers/sdprlayer.py","file_url":"https://github.com/utiasasrl/sdprlayer/blob/HEAD/src/sdprlayers/layers/sdprlayer.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a89d0fd991c94657"}},{"code_sha256_prefix":"3b052c4345ca170d","entry":"make_symmetric","repo":"utiasasrl/sdprlayer","repo_kind":"official","path":"src/sdprlayers/layers/sdprlayer.py","file_url":"https://github.com/utiasasrl/sdprlayer/blob/HEAD/src/sdprlayers/layers/sdprlayer.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"3b052c4345ca170d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}