{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HJIXXL5CL6TCS44DR7PSOQCCAK","short_pith_number":"pith:HJIXXL5C","schema_version":"1.0","canonical_sha256":"3a517bafa25fa62973838fdf27404202afaf4f17f92475fd16cb54168f37aa39","source":{"kind":"arxiv","id":"2403.19202","version":1},"attestation_state":"computed","paper":{"title":"Monitoring the Convergence Speed of PDHG to Find Better Primal and Dual Step Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"LTCI), Olivier Fercoq (S2A","submitted_at":"2024-03-28T07:57:09Z","abstract_excerpt":"Primal-dual algorithms for the resolution of convex-concave saddle point problems usually come with one or several step size parameters. Within the range where convergence is guaranteed, choosing well the step size can make the difference between a slow or a fast algorithm. A usual way to adaptively set step sizes is to ensure that there is a fair balance between primal and dual variable's amount of change. In this work, we show how to find even better step sizes for the primal-dual hybrid gradient. Getting inspiration from quadratic problems, we base our method on a spectral radius estimation"},"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":"2403.19202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-28T07:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"ca964227bece58071220b6c0cbf7f6cfb20e7a855ade496dec198816c88ad0d6","abstract_canon_sha256":"9872ab17cc8b0835e7c3630cf905109fbedc623b50c0277c6bd53aac09abe0d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:01:46.161262Z","signature_b64":"Ov1Jov/iOgsUG/89YxLQee0QXX/GY5jxNzdIRWtaeFlWsMgYUrtC+hNbUDhswOB5DEptXdmEZhDYoJkyM/HHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a517bafa25fa62973838fdf27404202afaf4f17f92475fd16cb54168f37aa39","last_reissued_at":"2026-07-05T08:01:46.160766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:01:46.160766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monitoring the Convergence Speed of PDHG to Find Better Primal and Dual Step Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"LTCI), Olivier Fercoq (S2A","submitted_at":"2024-03-28T07:57:09Z","abstract_excerpt":"Primal-dual algorithms for the resolution of convex-concave saddle point problems usually come with one or several step size parameters. Within the range where convergence is guaranteed, choosing well the step size can make the difference between a slow or a fast algorithm. A usual way to adaptively set step sizes is to ensure that there is a fair balance between primal and dual variable's amount of change. In this work, we show how to find even better step sizes for the primal-dual hybrid gradient. Getting inspiration from quadratic problems, we base our method on a spectral radius estimation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19202","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/2403.19202/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":"2403.19202","created_at":"2026-07-05T08:01:46.160824+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.19202v1","created_at":"2026-07-05T08:01:46.160824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19202","created_at":"2026-07-05T08:01:46.160824+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJIXXL5CL6TC","created_at":"2026-07-05T08:01:46.160824+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJIXXL5CL6TCS44D","created_at":"2026-07-05T08:01:46.160824+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJIXXL5C","created_at":"2026-07-05T08:01:46.160824+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.21068","citing_title":"Finite Horizon Optimization: Framework and Applications","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK","json":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK.json","graph_json":"https://pith.science/api/pith-number/HJIXXL5CL6TCS44DR7PSOQCCAK/graph.json","events_json":"https://pith.science/api/pith-number/HJIXXL5CL6TCS44DR7PSOQCCAK/events.json","paper":"https://pith.science/paper/HJIXXL5C"},"agent_actions":{"view_html":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK","download_json":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK.json","view_paper":"https://pith.science/paper/HJIXXL5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.19202&json=true","fetch_graph":"https://pith.science/api/pith-number/HJIXXL5CL6TCS44DR7PSOQCCAK/graph.json","fetch_events":"https://pith.science/api/pith-number/HJIXXL5CL6TCS44DR7PSOQCCAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK/action/storage_attestation","attest_author":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK/action/author_attestation","sign_citation":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK/action/citation_signature","submit_replication":"https://pith.science/pith/HJIXXL5CL6TCS44DR7PSOQCCAK/action/replication_record"}},"created_at":"2026-07-05T08:01:46.160824+00:00","updated_at":"2026-07-05T08:01:46.160824+00:00"}