{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/efficient-certifiably-optimal-clustering-with","title":"Efficient, Certifiably Optimal Clustering with Applications to Latent Variable Graphical Models","arxiv_id":"1806.00530","date":"2018-06-01","proceeding":null,"authors":["Carson Eisenach","Han Liu"],"abstract":"Motivated by the task of clustering either $d$ variables or $d$ points into\n$K$ groups, we investigate efficient algorithms to solve the Peng-Wei (P-W)\n$K$-means semi-definite programming (SDP) relaxation. The P-W SDP has been\nshown in the literature to have good statistical properties in a variety of\nsettings, but remains intractable to solve in practice. To this end we propose\nFORCE, a new algorithm to solve this SDP relaxation. Compared to the naive\ninterior point method, our method reduces the computational complexity of\nsolving the SDP from $\\tilde{O}(d^7\\log\\epsilon^{-1})$ to\n$\\tilde{O}(d^{6}K^{-2}\\epsilon^{-1})$ arithmetic operations for an\n$\\epsilon$-optimal solution. Our method combines a primal first-order method\nwith a dual optimality certificate search, which when successful, allows for\nearly termination of the primal method. We show for certain variable clustering\nproblems that, with high probability, FORCE is guaranteed to find the optimal\nsolution to the SDP relaxation and provide a certificate of exact optimality.\nAs verified by our numerical experiments, this allows FORCE to solve the P-W\nSDP with dimensions in the hundreds in only tens of seconds. For a variation of\nthe P-W SDP where $K$ is not known a priori a slight modification of FORCE\nreduces the computational complexity of solving this problem as well: from\n$\\tilde{O}(d^7\\log\\epsilon^{-1})$ using a standard SDP solver to\n$\\tilde{O}(d^{4}\\epsilon^{-1})$.","url_abs":"http://arxiv.org/abs/1806.00530v3","url_pdf":"http://arxiv.org/pdf/1806.00530v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"efficient-certifiably-optimal-clustering-with","repo_url":"https://github.com/ceisenach/R_GFORCE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"efficient-certifiably-optimal-clustering-with","repo_url":"https://github.com/cran/GFORCE","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"ceisenach/R_GFORCE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"cran/GFORCE","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"c9dc030a178e872c017ab56f0b40d559a3b5241830b92e2f89f40b6eea321054","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}