{"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/a-fast-and-scalable-joint-estimator-for-1","title":"A Fast and Scalable Joint Estimator for Integrating Additional Knowledge in Learning Multiple Related Sparse Gaussian Graphical Models","arxiv_id":"1806.00548","date":"2018-06-01","proceeding":"ICML 2018 7","authors":["Beilun Wang","Arshdeep Sekhon","Yanjun Qi"],"abstract":"We consider the problem of including additional knowledge in estimating\nsparse Gaussian graphical models (sGGMs) from aggregated samples, arising often\nin bioinformatics and neuroimaging applications. Previous joint sGGM estimators\neither fail to use existing knowledge or cannot scale-up to many tasks (large\n$K$) under a high-dimensional (large $p$) situation. In this paper, we propose\na novel \\underline{J}oint \\underline{E}lementary \\underline{E}stimator\nincorporating additional \\underline{K}nowledge (JEEK) to infer multiple related\nsparse Gaussian Graphical models from large-scale heterogeneous data. Using\ndomain knowledge as weights, we design a novel hybrid norm as the minimization\nobjective to enforce the superposition of two weighted sparsity constraints,\none on the shared interactions and the other on the task-specific structural\npatterns. This enables JEEK to elegantly consider various forms of existing\nknowledge based on the domain at hand and avoid the need to design\nknowledge-specific optimization. JEEK is solved through a fast and entry-wise\nparallelizable solution that largely improves the computational efficiency of\nthe state-of-the-art $O(p^5K^4)$ to $O(p^2K^4)$. We conduct a rigorous\nstatistical analysis showing that JEEK achieves the same convergence rate\n$O(\\log(Kp)/n_{tot})$ as the state-of-the-art estimators that are much harder\nto compute. Empirically, on multiple synthetic datasets and two real-world\ndata, JEEK outperforms the speed of the state-of-arts significantly while\nachieving the same level of prediction accuracy. Available as R tool @\nhttp://jointnets.org/","url_abs":"http://arxiv.org/abs/1806.00548v4","url_pdf":"http://arxiv.org/pdf/1806.00548v4.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":"a-fast-and-scalable-joint-estimator-for-1","repo_url":"https://github.com/QData/JEEK","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-fast-and-scalable-joint-estimator-for-1","repo_url":"https://github.com/QData/JointNets","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"2k","task_name":"2k"},{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"structured-prediction","task_name":"Structured Prediction"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"QData/JEEK","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"QData/JointNets","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":"40adba9a1057709f4f76e41cba904cee64f373ab2a4b249ba8a4dac328f89f99","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}