{"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/discrete-event-continuous-time-rnns","title":"Discrete Event, Continuous Time RNNs","arxiv_id":"1710.04110","date":"2017-10-11","proceeding":null,"authors":["Michael C. Mozer","Denis Kazakov","Robert V. Lindsey"],"abstract":"We investigate recurrent neural network architectures for event-sequence\nprocessing. Event sequences, characterized by discrete observations stamped\nwith continuous-valued times of occurrence, are challenging due to the\npotentially wide dynamic range of relevant time scales as well as interactions\nbetween time scales. We describe four forms of inductive bias that should\nbenefit architectures for event sequences: temporal locality, position and\nscale homogeneity, and scale interdependence. We extend the popular gated\nrecurrent unit (GRU) architecture to incorporate these biases via intrinsic\ntemporal dynamics, obtaining a continuous-time GRU. The CT-GRU arises by\ninterpreting the gates of a GRU as selecting a time scale of memory, and the\nCT-GRU generalizes the GRU by incorporating multiple time scales of memory and\nperforming context-dependent selection of time scales for information storage\nand retrieval. Event time-stamps drive decay dynamics of the CT-GRU, whereas\nthey serve as generic additional inputs to the GRU. Despite the very different\nmanner in which the two models consider time, their performance on eleven data\nsets we examined is essentially identical. Our surprising results point both to\nthe robustness of GRU and LSTM architectures for handling continuous time, and\nto the potency of incorporating continuous dynamics into neural architectures.","url_abs":"http://arxiv.org/abs/1710.04110v1","url_pdf":"http://arxiv.org/pdf/1710.04110v1.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":"discrete-event-continuous-time-rnns","repo_url":"https://github.com/raminmh/liquid_time_constant_networks","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"inductive-bias","task_name":"Inductive Bias"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[{"method_slug":"gru","method_name":"GRU"},{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.04110","atlas_url":"https://app.syntology.ai/?focus=1710.04110","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":"1710.04110"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.04110\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.04110"},"call":"get_concepts_for_paper(arxiv_id=\"1710.04110\")"}],"by_repo":[{"repo":"raminmh/liquid_time_constant_networks","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2006.04439"],"harvested_for_calls":[{"arxiv_id":"2006.04439","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.04439"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.04439\")"}]}],"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":"5ac65e6b7b3c2f6bdbe821d412417f5b16292ccbccbd406c52b3783cceee756a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}