{"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/latent-variable-time-varying-network","title":"Latent Variable Time-varying Network Inference","arxiv_id":"1802.03987","date":"2018-02-12","proceeding":null,"authors":["Federico Tomasi","Veronica Tozzo","Saverio Salzo","Alessandro Verri"],"abstract":"In many applications of finance, biology and sociology, complex systems\ninvolve entities interacting with each other. These processes have the\npeculiarity of evolving over time and of comprising latent factors, which\ninfluence the system without being explicitly measured. In this work we present\nlatent variable time-varying graphical lasso (LTGL), a method for multivariate\ntime-series graphical modelling that considers the influence of hidden or\nunmeasurable factors. The estimation of the contribution of the latent factors\nis embedded in the model which produces both sparse and low-rank components for\neach time point. In particular, the first component represents the connectivity\nstructure of observable variables of the system, while the second represents\nthe influence of hidden factors, assumed to be few with respect to the observed\nvariables. Our model includes temporal consistency on both components,\nproviding an accurate evolutionary pattern of the system. We derive a tractable\noptimisation algorithm based on alternating direction method of multipliers,\nand develop a scalable and efficient implementation which exploits proximity\noperators in closed form. LTGL is extensively validated on synthetic data,\nachieving optimal performance in terms of accuracy, structure learning and\nscalability with respect to ground truth and state-of-the-art methods for\ngraphical inference. We conclude with the application of LTGL to real case\nstudies, from biology and finance, to illustrate how our method can be\nsuccessfully employed to gain insights on multivariate time-series data.","url_abs":"http://arxiv.org/abs/1802.03987v2","url_pdf":"http://arxiv.org/pdf/1802.03987v2.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":"latent-variable-time-varying-network","repo_url":"https://github.com/fdtomasi/regain","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"sociology","task_name":"Sociology"},{"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":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":"fdtomasi/regain","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":"71342475a71b8fd6063099ff4d79060def4bb1278925bd0cc3e6239ced5f5ee1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}