{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3WSKYETSV6U2DXEE2YWST3ZGGX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1f73778937da9551527980341784bcab69651cf86642c9be7f5fe76be78e841f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-11T17:23:46Z","title_canon_sha256":"80aec3f9f5985c46068aced71f628cc5b3a596f4c8c7454d0ed3b69e4c64ae49"},"schema_version":"1.0","source":{"id":"2105.05210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.05210","created_at":"2026-07-05T02:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"2105.05210v1","created_at":"2026-07-05T02:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05210","created_at":"2026-07-05T02:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"3WSKYETSV6U2","created_at":"2026-07-05T02:39:29Z"},{"alias_kind":"pith_short_16","alias_value":"3WSKYETSV6U2DXEE","created_at":"2026-07-05T02:39:29Z"},{"alias_kind":"pith_short_8","alias_value":"3WSKYETS","created_at":"2026-07-05T02:39:29Z"}],"graph_snapshots":[{"event_id":"sha256:cc8da796792bef3458b83a94b7ce01368b04bee283a3d5796925397dbfb3f8a4","target":"graph","created_at":"2026-07-05T02:39:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.05210/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose several deep-learning accelerated optimization solvers with convergence guarantees. We use ideas from the analysis of accelerated forward-backward schemes like FISTA, but instead of the classical approach of proving convergence for a choice of parameters, such as a step-size, we show convergence whenever the update is chosen in a specific set. Rather than picking a point in this set using some predefined method, we train a deep neural network to pick the best update. Finally, we show that the method is applicable to several cases of smooth and non-smooth optimization and show superi","authors_text":"Jevgenija Rudzusika, Jonas Adler, Ozan \\\"Oktem, Sebastian Banert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-11T17:23:46Z","title":"Accelerated Forward-Backward Optimization using Deep Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.05210","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bfc11b476db4e88bbdfd4746febf950377d3866383d7e633c62de71d703acef7","target":"record","created_at":"2026-07-05T02:39:29Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1f73778937da9551527980341784bcab69651cf86642c9be7f5fe76be78e841f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-11T17:23:46Z","title_canon_sha256":"80aec3f9f5985c46068aced71f628cc5b3a596f4c8c7454d0ed3b69e4c64ae49"},"schema_version":"1.0","source":{"id":"2105.05210","kind":"arxiv","version":1}},"canonical_sha256":"dda4ac1272afa9a1dc84d62d29ef2635da1154704e957a9bfd3df8b6ceb512e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dda4ac1272afa9a1dc84d62d29ef2635da1154704e957a9bfd3df8b6ceb512e8","first_computed_at":"2026-07-05T02:39:29.577868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:39:29.577868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N7pYzHYN0hq+2ZyYeozIiMBgdEk4zNcPegr5/+l66RddZ3lOeIR4I3oH4PpsIWUCEIVL2B4zESxg2J2N6I5SDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:39:29.578294Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.05210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfc11b476db4e88bbdfd4746febf950377d3866383d7e633c62de71d703acef7","sha256:cc8da796792bef3458b83a94b7ce01368b04bee283a3d5796925397dbfb3f8a4"],"state_sha256":"79567a57584ed05f51cf0c467e5505529e299cea959df137b98b1b820b9d437b"}