{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GBI5K5FFDK746V2QDIJCCNOGUG","short_pith_number":"pith:GBI5K5FF","schema_version":"1.0","canonical_sha256":"3051d574a51abfcf57501a122135c6a1a3a64fa4d704ea7e86ea65412230f97f","source":{"kind":"arxiv","id":"1802.07796","version":2},"attestation_state":"computed","paper":{"title":"Continuous Relaxation of MAP Inference: A Nonconvex Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"D. Khu\\^e L\\^e-Huu, Nikos Paragios","submitted_at":"2018-02-21T20:42:58Z","abstract_excerpt":"In this paper, we study a nonconvex continuous relaxation of MAP inference in discrete Markov random fields (MRFs). We show that for arbitrary MRFs, this relaxation is tight, and a discrete stationary point of it can be easily reached by a simple block coordinate descent algorithm. In addition, we study the resolution of this relaxation using popular gradient methods, and further propose a more effective solution using a multilinear decomposition framework based on the alternating direction method of multipliers (ADMM). Experiments on many real-world problems demonstrate that the proposed ADMM"},"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":"1802.07796","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-21T20:42:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"cf105d17e34f9eeaad6e0c3aeddb3b949ee80af9d3de91fc410e5e14079ace4c","abstract_canon_sha256":"ae75cc1cd82582459f9afd24d3502231e06f71a561ceee04d910dedc3f428979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.839382Z","signature_b64":"g8OWlDoiELtazHiI9twn3go3t9JnFDeluNuf/WuG0SbxDt5wsR8U8jgRzOGziMmeGO3RcErbSVRtHoiqiOjIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3051d574a51abfcf57501a122135c6a1a3a64fa4d704ea7e86ea65412230f97f","last_reissued_at":"2026-05-18T00:22:36.838919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.838919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Relaxation of MAP Inference: A Nonconvex Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"D. Khu\\^e L\\^e-Huu, Nikos Paragios","submitted_at":"2018-02-21T20:42:58Z","abstract_excerpt":"In this paper, we study a nonconvex continuous relaxation of MAP inference in discrete Markov random fields (MRFs). We show that for arbitrary MRFs, this relaxation is tight, and a discrete stationary point of it can be easily reached by a simple block coordinate descent algorithm. In addition, we study the resolution of this relaxation using popular gradient methods, and further propose a more effective solution using a multilinear decomposition framework based on the alternating direction method of multipliers (ADMM). Experiments on many real-world problems demonstrate that the proposed ADMM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07796","kind":"arxiv","version":2},"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":"1802.07796","created_at":"2026-05-18T00:22:36.838993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07796v2","created_at":"2026-05-18T00:22:36.838993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07796","created_at":"2026-05-18T00:22:36.838993+00:00"},{"alias_kind":"pith_short_12","alias_value":"GBI5K5FFDK74","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GBI5K5FFDK746V2Q","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GBI5K5FF","created_at":"2026-05-18T12:32:25.280505+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/GBI5K5FFDK746V2QDIJCCNOGUG","json":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG.json","graph_json":"https://pith.science/api/pith-number/GBI5K5FFDK746V2QDIJCCNOGUG/graph.json","events_json":"https://pith.science/api/pith-number/GBI5K5FFDK746V2QDIJCCNOGUG/events.json","paper":"https://pith.science/paper/GBI5K5FF"},"agent_actions":{"view_html":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG","download_json":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG.json","view_paper":"https://pith.science/paper/GBI5K5FF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07796&json=true","fetch_graph":"https://pith.science/api/pith-number/GBI5K5FFDK746V2QDIJCCNOGUG/graph.json","fetch_events":"https://pith.science/api/pith-number/GBI5K5FFDK746V2QDIJCCNOGUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG/action/storage_attestation","attest_author":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG/action/author_attestation","sign_citation":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG/action/citation_signature","submit_replication":"https://pith.science/pith/GBI5K5FFDK746V2QDIJCCNOGUG/action/replication_record"}},"created_at":"2026-05-18T00:22:36.838993+00:00","updated_at":"2026-05-18T00:22:36.838993+00:00"}