{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RXACAHFEZ4E77QGUSUSGRHTEMA","short_pith_number":"pith:RXACAHFE","schema_version":"1.0","canonical_sha256":"8dc0201ca4cf09ffc0d49524689e64602a44dc9ba8c6bed9c55f3a749b5f7c08","source":{"kind":"arxiv","id":"2504.02833","version":1},"attestation_state":"computed","paper":{"title":"Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Lajos Hanzo, Sangwoo Park, Stefan Vlaski","submitted_at":"2025-03-16T11:05:51Z","abstract_excerpt":"In multi-objective optimization, minimizing the worst objective can be preferable to minimizing the average objective, as this ensures improved fairness across objectives. Due to the non-smooth nature of the resultant min-max optimization problem, classical subgradient-based approaches typically exhibit slow convergence. Motivated by primal-dual consensus techniques in multi-agent optimization and learning, we formulate a smooth variant of the min-max problem based on the augmented Lagrangian. The resultant Exact Pareto Optimization via Augmented Lagrangian (EPO-AL) algorithm scales better wit"},"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":"2504.02833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-03-16T11:05:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"acdbfba09b9e0c81ae60a25093d68886977c4c78a08f9193a6b93cd624b95d7a","abstract_canon_sha256":"5e8c56300331375f5f62a6a31c37831900cfe2bc14085d11894475d6b1c23a96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:03.597903Z","signature_b64":"woPRtOiIsPRTH1psGiIxlZPOjrkTzorEMQu5efJd51lHO6MP9YWcKdBX4iYyDBqxqIM/kNx1WUqD2sBTHLmTCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dc0201ca4cf09ffc0d49524689e64602a44dc9ba8c6bed9c55f3a749b5f7c08","last_reissued_at":"2026-07-05T10:44:03.597461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:03.597461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Lajos Hanzo, Sangwoo Park, Stefan Vlaski","submitted_at":"2025-03-16T11:05:51Z","abstract_excerpt":"In multi-objective optimization, minimizing the worst objective can be preferable to minimizing the average objective, as this ensures improved fairness across objectives. Due to the non-smooth nature of the resultant min-max optimization problem, classical subgradient-based approaches typically exhibit slow convergence. Motivated by primal-dual consensus techniques in multi-agent optimization and learning, we formulate a smooth variant of the min-max problem based on the augmented Lagrangian. The resultant Exact Pareto Optimization via Augmented Lagrangian (EPO-AL) algorithm scales better wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02833","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/2504.02833/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":"2504.02833","created_at":"2026-07-05T10:44:03.597519+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.02833v1","created_at":"2026-07-05T10:44:03.597519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02833","created_at":"2026-07-05T10:44:03.597519+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXACAHFEZ4E7","created_at":"2026-07-05T10:44:03.597519+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXACAHFEZ4E77QGU","created_at":"2026-07-05T10:44:03.597519+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXACAHFE","created_at":"2026-07-05T10:44:03.597519+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/RXACAHFEZ4E77QGUSUSGRHTEMA","json":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA.json","graph_json":"https://pith.science/api/pith-number/RXACAHFEZ4E77QGUSUSGRHTEMA/graph.json","events_json":"https://pith.science/api/pith-number/RXACAHFEZ4E77QGUSUSGRHTEMA/events.json","paper":"https://pith.science/paper/RXACAHFE"},"agent_actions":{"view_html":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA","download_json":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA.json","view_paper":"https://pith.science/paper/RXACAHFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.02833&json=true","fetch_graph":"https://pith.science/api/pith-number/RXACAHFEZ4E77QGUSUSGRHTEMA/graph.json","fetch_events":"https://pith.science/api/pith-number/RXACAHFEZ4E77QGUSUSGRHTEMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/action/storage_attestation","attest_author":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/action/author_attestation","sign_citation":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/action/citation_signature","submit_replication":"https://pith.science/pith/RXACAHFEZ4E77QGUSUSGRHTEMA/action/replication_record"}},"created_at":"2026-07-05T10:44:03.597519+00:00","updated_at":"2026-07-05T10:44:03.597519+00:00"}