{"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/network-inference-via-the-time-varying","title":"Network Inference via the Time-Varying Graphical Lasso","arxiv_id":"1703.01958","date":"2017-03-06","proceeding":null,"authors":["David Hallac","Youngsuk Park","Stephen Boyd","Jure Leskovec"],"abstract":"Many important problems can be modeled as a system of interconnected\nentities, where each entity is recording time-dependent observations or\nmeasurements. In order to spot trends, detect anomalies, and interpret the\ntemporal dynamics of such data, it is essential to understand the relationships\nbetween the different entities and how these relationships evolve over time. In\nthis paper, we introduce the time-varying graphical lasso (TVGL), a method of\ninferring time-varying networks from raw time series data. We cast the problem\nin terms of estimating a sparse time-varying inverse covariance matrix, which\nreveals a dynamic network of interdependencies between the entities. Since\ndynamic network inference is a computationally expensive task, we derive a\nscalable message-passing algorithm based on the Alternating Direction Method of\nMultipliers (ADMM) to solve this problem in an efficient way. We also discuss\nseveral extensions, including a streaming algorithm to update the model and\nincorporate new observations in real time. Finally, we evaluate our TVGL\nalgorithm on both real and synthetic datasets, obtaining interpretable results\nand outperforming state-of-the-art baselines in terms of both accuracy and\nscalability.","url_abs":"http://arxiv.org/abs/1703.01958v2","url_pdf":"http://arxiv.org/pdf/1703.01958v2.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":"network-inference-via-the-time-varying","repo_url":"https://github.com/ams129/TVGL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"network-inference-via-the-time-varying","repo_url":"https://github.com/tpetaja1/tvgl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1703.01958","atlas_url":"https://app.syntology.ai/?focus=1703.01958","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":"1703.01958"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1703.01958\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1703.01958"},"call":"get_concepts_for_paper(arxiv_id=\"1703.01958\")"}],"by_repo":[{"repo":"ams129/TVGL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tpetaja1/tvgl","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":"123dfa5b1ffb0a5a93dfa057996a0a6b2058d93f29e399bf6807a892c0d196a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}