{"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/communication-avoiding-optimization-methods","title":"Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation","arxiv_id":"1710.10769","date":"2017-10-30","proceeding":null,"authors":["Penporn Koanantakool","Alnur Ali","Ariful Azad","Aydin Buluc","Dmitriy Morozov","Leonid Oliker","Katherine Yelick","Sang-Yun Oh"],"abstract":"Across a variety of scientific disciplines, sparse inverse covariance\nestimation is a popular tool for capturing the underlying dependency\nrelationships in multivariate data. Unfortunately, most estimators are not\nscalable enough to handle the sizes of modern high-dimensional data sets (often\non the order of terabytes), and assume Gaussian samples. To address these\ndeficiencies, we introduce HP-CONCORD, a highly scalable optimization method\nfor estimating a sparse inverse covariance matrix based on a regularized\npseudolikelihood framework, without assuming Gaussianity. Our parallel proximal\ngradient method uses a novel communication-avoiding linear algebra algorithm\nand runs across a multi-node cluster with up to 1k nodes (24k cores), achieving\nparallel scalability on problems with up to ~819 billion parameters (1.28\nmillion dimensions); even on a single node, HP-CONCORD demonstrates\nscalability, outperforming a state-of-the-art method. We also use HP-CONCORD to\nestimate the underlying dependency structure of the brain from fMRI data, and\nuse the result to identify functional regions automatically. The results show\ngood agreement with a clustering from the neuroscience literature.","url_abs":"http://arxiv.org/abs/1710.10769v2","url_pdf":"http://arxiv.org/pdf/1710.10769v2.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":"communication-avoiding-optimization-methods","repo_url":"https://bitbucket.org/penpornk/spdm3-hpconcord","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.10769","atlas_url":"https://app.syntology.ai/?focus=1710.10769","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1710.10769"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.10769\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.10769"},"call":"get_concepts_for_paper(arxiv_id=\"1710.10769\")"}],"by_repo":[{"repo":"bitbucket.org/penpornk/spdm3-hpconcord","kind":"official","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":"553bd09636960df4dace8d6c6f27b426cda63aa07b06dbdac1f11c8a95dfa60a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}