{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:POHVSHDYV4OKAPNDFUYF7N2YDF","short_pith_number":"pith:POHVSHDY","schema_version":"1.0","canonical_sha256":"7b8f591c78af1ca03da32d305fb758197eb233c8b818e4dcc47b2376a5914e3a","source":{"kind":"arxiv","id":"1908.07615","version":1},"attestation_state":"computed","paper":{"title":"Iterative Linearized Control: Stable Algorithms and Complexity Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dmitriy Drusvyatskiy, Siddhartha Srinivasa, Vincent Roulet, Zaid Harchaoui","submitted_at":"2019-08-20T21:25:24Z","abstract_excerpt":"We examine popular gradient-based algorithms for nonlinear control in the light of the modern complexity analysis of first-order optimization algorithms. The examination reveals that the complexity bounds can be clearly stated in terms of calls to a computational oracle related to dynamic programming and implementable by gradient back-propagation using machine learning software libraries such as PyTorch or TensorFlow. Finally, we propose a regularized Gauss-Newton algorithm enjoying worst-case complexity bounds and improved convergence behavior in practice. The software library based on PyTorc"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.07615","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-20T21:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"2c75076d62e766fe0fa0e5bd5000057226b8edd1332c7ea2c8cf16fbc45f0d58","abstract_canon_sha256":"b478a79ff7a2d0f2f1bd6cee87594c02d4d373e72d7eefa731254cc0746f7578"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:59.673927Z","signature_b64":"sqVVvN/IhxPgk7Un8uduyD3LuJObtlc811VQGlJWKkMi5M/DvjFbDlg+R7sc5LIgnmp4OlZONagmkeXk8Cw6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b8f591c78af1ca03da32d305fb758197eb233c8b818e4dcc47b2376a5914e3a","last_reissued_at":"2026-07-04T23:58:59.673566Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:59.673566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Linearized Control: Stable Algorithms and Complexity Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dmitriy Drusvyatskiy, Siddhartha Srinivasa, Vincent Roulet, Zaid Harchaoui","submitted_at":"2019-08-20T21:25:24Z","abstract_excerpt":"We examine popular gradient-based algorithms for nonlinear control in the light of the modern complexity analysis of first-order optimization algorithms. The examination reveals that the complexity bounds can be clearly stated in terms of calls to a computational oracle related to dynamic programming and implementable by gradient back-propagation using machine learning software libraries such as PyTorch or TensorFlow. Finally, we propose a regularized Gauss-Newton algorithm enjoying worst-case complexity bounds and improved convergence behavior in practice. The software library based on PyTorc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07615","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07615/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.07615","created_at":"2026-07-04T23:58:59.673620+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07615v1","created_at":"2026-07-04T23:58:59.673620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07615","created_at":"2026-07-04T23:58:59.673620+00:00"},{"alias_kind":"pith_short_12","alias_value":"POHVSHDYV4OK","created_at":"2026-07-04T23:58:59.673620+00:00"},{"alias_kind":"pith_short_16","alias_value":"POHVSHDYV4OKAPND","created_at":"2026-07-04T23:58:59.673620+00:00"},{"alias_kind":"pith_short_8","alias_value":"POHVSHDY","created_at":"2026-07-04T23:58:59.673620+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF","json":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF.json","graph_json":"https://pith.science/api/pith-number/POHVSHDYV4OKAPNDFUYF7N2YDF/graph.json","events_json":"https://pith.science/api/pith-number/POHVSHDYV4OKAPNDFUYF7N2YDF/events.json","paper":"https://pith.science/paper/POHVSHDY"},"agent_actions":{"view_html":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF","download_json":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF.json","view_paper":"https://pith.science/paper/POHVSHDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07615&json=true","fetch_graph":"https://pith.science/api/pith-number/POHVSHDYV4OKAPNDFUYF7N2YDF/graph.json","fetch_events":"https://pith.science/api/pith-number/POHVSHDYV4OKAPNDFUYF7N2YDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/action/storage_attestation","attest_author":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/action/author_attestation","sign_citation":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/action/citation_signature","submit_replication":"https://pith.science/pith/POHVSHDYV4OKAPNDFUYF7N2YDF/action/replication_record"}},"created_at":"2026-07-04T23:58:59.673620+00:00","updated_at":"2026-07-04T23:58:59.673620+00:00"}