{"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/deep-kalman-filters","title":"Deep Kalman Filters","arxiv_id":"1511.05121","date":"2015-11-16","proceeding":null,"authors":["Rahul G. Krishnan","Uri Shalit","David Sontag"],"abstract":"Kalman Filters are one of the most influential models of time-varying\nphenomena. They admit an intuitive probabilistic interpretation, have a simple\nfunctional form, and enjoy widespread adoption in a variety of disciplines.\nMotivated by recent variational methods for learning deep generative models, we\nintroduce a unified algorithm to efficiently learn a broad spectrum of Kalman\nfilters. Of particular interest is the use of temporal generative models for\ncounterfactual inference. We investigate the efficacy of such models for\ncounterfactual inference, and to that end we introduce the \"Healing MNIST\"\ndataset where long-term structure, noise and actions are applied to sequences\nof digits. We show the efficacy of our method for modeling this dataset. We\nfurther show how our model can be used for counterfactual inference for\npatients, based on electronic health record data of 8,000 patients over 4.5\nyears.","url_abs":"http://arxiv.org/abs/1511.05121v2","url_pdf":"http://arxiv.org/pdf/1511.05121v2.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":"deep-kalman-filters","repo_url":"https://github.com/clinicalml/structuredinference","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"deep-kalman-filters","repo_url":"https://github.com/GalaxyFox/DS-GA-3001-Deep_Kalman_Filter","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"deep-kalman-filters","repo_url":"https://github.com/clinicalml/dmm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"counterfactual-inference","task_name":"Counterfactual Inference"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":null,"task_name":"counterfactual"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.05121","atlas_url":"https://app.syntology.ai/?focus=1511.05121","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":"1511.05121"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.05121\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.05121"},"call":"get_concepts_for_paper(arxiv_id=\"1511.05121\")"}],"by_repo":[{"repo":"clinicalml/structuredinference","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1609.09869"],"harvested_for_calls":[{"arxiv_id":"1609.09869","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1609.09869"},"call":"get_harvested_code_for_paper(arxiv_id=\"1609.09869\")"}]},{"repo":"GalaxyFox/DS-GA-3001-Deep_Kalman_Filter","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"clinicalml/dmm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"73600ff0822d4a9715f404d80fa6bd77a44ab1f81277ea929616c53072b6202a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}