{"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/inference-of-sparse-networks-with-unobserved","title":"Inference of Sparse Networks with Unobserved Variables. Application to Gene Regulatory Networks","arxiv_id":"1406.0193","date":"2014-06-01","proceeding":null,"authors":["Nikolai Slavov"],"abstract":"Networks are a unifying framework for modeling complex systems and network\ninference problems are frequently encountered in many fields. Here, I develop\nand apply a generative approach to network inference (RCweb) for the case when\nthe network is sparse and the latent (not observed) variables affect the\nobserved ones. From all possible factor analysis (FA) decompositions explaining\nthe variance in the data, RCweb selects the FA decomposition that is consistent\nwith a sparse underlying network. The sparsity constraint is imposed by a novel\nmethod that significantly outperforms (in terms of accuracy, robustness to\nnoise, complexity scaling, and computational efficiency) Bayesian methods and\nMLE methods using l1 norm relaxation such as K-SVD and l1--based sparse\nprinciple component analysis (PCA). Results from simulated models demonstrate\nthat RCweb recovers exactly the model structures for sparsity as low (as\nnon-sparse) as 50% and with ratio of unobserved to observed variables as high\nas 2. RCweb is robust to noise, with gradual decrease in the parameter ranges\nas the noise level increases.","url_abs":"http://arxiv.org/abs/1406.0193v1","url_pdf":"http://arxiv.org/pdf/1406.0193v1.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":"inference-of-sparse-networks-with-unobserved","repo_url":"https://github.com/nslavov/RCweb","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"}],"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":"nslavov/RCweb","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":"57d282d5b4293ff4f1038a80f3846d77c6672274dd91bb8911c593c3b8739b8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}