{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5ALCFCRSVJ2IDYILOHMOCNSU4P","short_pith_number":"pith:5ALCFCRS","schema_version":"1.0","canonical_sha256":"e816228a32aa7481e10b71d8e13654e3df782a3cda2b1bf670416f03adb093d4","source":{"kind":"arxiv","id":"1806.00530","version":3},"attestation_state":"computed","paper":{"title":"Efficient, Certifiably Optimal Clustering with Applications to Latent Variable Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Carson Eisenach, Han Liu","submitted_at":"2018-06-01T20:01:58Z","abstract_excerpt":"Motivated by the task of clustering either $d$ variables or $d$ points into $K$ groups, we investigate efficient algorithms to solve the Peng-Wei (P-W) $K$-means semi-definite programming (SDP) relaxation. The P-W SDP has been shown in the literature to have good statistical properties in a variety of settings, but remains intractable to solve in practice. To this end we propose FORCE, a new algorithm to solve this SDP relaxation. Compared to the naive interior point method, our method reduces the computational complexity of solving the SDP from $\\tilde{O}(d^7\\log\\epsilon^{-1})$ to $\\tilde{O}("},"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":"1806.00530","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-01T20:01:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e0f2d27a6ed3281651cd977e259166c3636d4c282b493b26f59e32f865f596c3","abstract_canon_sha256":"936f3259bdc845eb2b6ddeec93e075f78d65f36d1dd8563b572098d7b27701ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:44.785919Z","signature_b64":"gVV8SJCPRBlW30hKrIxIZFhEvbvqVQZn/Is9VymCcHeKOIXNWFIr+qjDeg5+NiaBfNIqIlcetsAjrl9Eus4SDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e816228a32aa7481e10b71d8e13654e3df782a3cda2b1bf670416f03adb093d4","last_reissued_at":"2026-05-18T00:02:44.785391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:44.785391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient, Certifiably Optimal Clustering with Applications to Latent Variable Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Carson Eisenach, Han Liu","submitted_at":"2018-06-01T20:01:58Z","abstract_excerpt":"Motivated by the task of clustering either $d$ variables or $d$ points into $K$ groups, we investigate efficient algorithms to solve the Peng-Wei (P-W) $K$-means semi-definite programming (SDP) relaxation. The P-W SDP has been shown in the literature to have good statistical properties in a variety of settings, but remains intractable to solve in practice. To this end we propose FORCE, a new algorithm to solve this SDP relaxation. Compared to the naive interior point method, our method reduces the computational complexity of solving the SDP from $\\tilde{O}(d^7\\log\\epsilon^{-1})$ to $\\tilde{O}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00530","kind":"arxiv","version":3},"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":"1806.00530","created_at":"2026-05-18T00:02:44.785468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00530v3","created_at":"2026-05-18T00:02:44.785468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00530","created_at":"2026-05-18T00:02:44.785468+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ALCFCRSVJ2I","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ALCFCRSVJ2IDYIL","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ALCFCRS","created_at":"2026-05-18T12:32:08.215937+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/5ALCFCRSVJ2IDYILOHMOCNSU4P","json":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P.json","graph_json":"https://pith.science/api/pith-number/5ALCFCRSVJ2IDYILOHMOCNSU4P/graph.json","events_json":"https://pith.science/api/pith-number/5ALCFCRSVJ2IDYILOHMOCNSU4P/events.json","paper":"https://pith.science/paper/5ALCFCRS"},"agent_actions":{"view_html":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P","download_json":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P.json","view_paper":"https://pith.science/paper/5ALCFCRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00530&json=true","fetch_graph":"https://pith.science/api/pith-number/5ALCFCRSVJ2IDYILOHMOCNSU4P/graph.json","fetch_events":"https://pith.science/api/pith-number/5ALCFCRSVJ2IDYILOHMOCNSU4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P/action/storage_attestation","attest_author":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P/action/author_attestation","sign_citation":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P/action/citation_signature","submit_replication":"https://pith.science/pith/5ALCFCRSVJ2IDYILOHMOCNSU4P/action/replication_record"}},"created_at":"2026-05-18T00:02:44.785468+00:00","updated_at":"2026-05-18T00:02:44.785468+00:00"}