{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UCZF6BJGGLMM57YKIOI5TBNHSM","short_pith_number":"pith:UCZF6BJG","schema_version":"1.0","canonical_sha256":"a0b25f052632d8ceff0a4391d985a79308d0f7b51d4dcd8400517f3297c53c45","source":{"kind":"arxiv","id":"1704.02712","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Christoph Studer, Mario A. T. Figueiredo, Tom Goldstein, Xiaoming Yuan, Zheng Xu","submitted_at":"2017-04-10T05:07:38Z","abstract_excerpt":"Many modern computer vision and machine learning applications rely on solving difficult optimization problems that involve non-differentiable objective functions and constraints. The alternating direction method of multipliers (ADMM) is a widely used approach to solve such problems. Relaxed ADMM is a generalization of ADMM that often achieves better performance, but its efficiency depends strongly on algorithm parameters that must be chosen by an expert user. We propose an adaptive method that automatically tunes the key algorithm parameters to achieve optimal performance without user oversigh"},"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":"1704.02712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-04-10T05:07:38Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0469dca9a1516a0747d6d5667e33213c8cbc77a30be0317d18e1c4d221da42f6","abstract_canon_sha256":"cf210a1d75ac4d6497a41a358c1076ccb50a57d4dbe37b5aef88afe9e291e626"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:43.836248Z","signature_b64":"Zqnft9tuL3x5MDIXtqJ/znG/nI0VDzh70KXd3af3AZApSAdRpGTiARbW0y38F7wQgR+41ESGG0wf+OxIrzF6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0b25f052632d8ceff0a4391d985a79308d0f7b51d4dcd8400517f3297c53c45","last_reissued_at":"2026-05-18T00:46:43.835575Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:43.835575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Relaxed ADMM: Convergence Theory and Practical Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Christoph Studer, Mario A. T. Figueiredo, Tom Goldstein, Xiaoming Yuan, Zheng Xu","submitted_at":"2017-04-10T05:07:38Z","abstract_excerpt":"Many modern computer vision and machine learning applications rely on solving difficult optimization problems that involve non-differentiable objective functions and constraints. The alternating direction method of multipliers (ADMM) is a widely used approach to solve such problems. Relaxed ADMM is a generalization of ADMM that often achieves better performance, but its efficiency depends strongly on algorithm parameters that must be chosen by an expert user. We propose an adaptive method that automatically tunes the key algorithm parameters to achieve optimal performance without user oversigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02712","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":""},"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":"1704.02712","created_at":"2026-05-18T00:46:43.835690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02712v1","created_at":"2026-05-18T00:46:43.835690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02712","created_at":"2026-05-18T00:46:43.835690+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCZF6BJGGLMM","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCZF6BJGGLMM57YK","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCZF6BJG","created_at":"2026-05-18T12:31:46.661854+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/UCZF6BJGGLMM57YKIOI5TBNHSM","json":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM.json","graph_json":"https://pith.science/api/pith-number/UCZF6BJGGLMM57YKIOI5TBNHSM/graph.json","events_json":"https://pith.science/api/pith-number/UCZF6BJGGLMM57YKIOI5TBNHSM/events.json","paper":"https://pith.science/paper/UCZF6BJG"},"agent_actions":{"view_html":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM","download_json":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM.json","view_paper":"https://pith.science/paper/UCZF6BJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02712&json=true","fetch_graph":"https://pith.science/api/pith-number/UCZF6BJGGLMM57YKIOI5TBNHSM/graph.json","fetch_events":"https://pith.science/api/pith-number/UCZF6BJGGLMM57YKIOI5TBNHSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM/action/storage_attestation","attest_author":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM/action/author_attestation","sign_citation":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM/action/citation_signature","submit_replication":"https://pith.science/pith/UCZF6BJGGLMM57YKIOI5TBNHSM/action/replication_record"}},"created_at":"2026-05-18T00:46:43.835690+00:00","updated_at":"2026-05-18T00:46:43.835690+00:00"}