{"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/intensity-free-learning-of-temporal-point","title":"Intensity-Free Learning of Temporal Point Processes","arxiv_id":"1909.12127","date":"2019-09-26","proceeding":"ICLR 2020 1","authors":["Oleksandr Shchur","Marin Biloš","Stephan Günnemann"],"abstract":"Temporal point processes are the dominant paradigm for modeling sequences of events happening at irregular intervals. The standard way of learning in such models is by estimating the conditional intensity function. However, parameterizing the intensity function usually incurs several trade-offs. We show how to overcome the limitations of intensity-based approaches by directly modeling the conditional distribution of inter-event times. We draw on the literature on normalizing flows to design models that are flexible and efficient. We additionally propose a simple mixture model that matches the flexibility of flow-based models, but also permits sampling and computing moments in closed form. The proposed models achieve state-of-the-art performance in standard prediction tasks and are suitable for novel applications, such as learning sequence embeddings and imputing missing data.","url_abs":"https://arxiv.org/abs/1909.12127v2","url_pdf":"https://arxiv.org/pdf/1909.12127v2.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":"intensity-free-learning-of-temporal-point","repo_url":"https://github.com/shchur/ifl-tpp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"intensity-free-learning-of-temporal-point","repo_url":"https://github.com/Yoontae6719/Point-Processes","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"intensity-free-learning-of-temporal-point","repo_url":"https://github.com/awslabs/gluon-ts","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"mxnet","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"intensity-free-learning-of-temporal-point","repo_url":"https://github.com/MindSpore-scientific-2/code-11/tree/main/temporal-normalizing-flows","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"intensity-free-learning-of-temporal-point","repo_url":"https://github.com/MindSpore-scientific/code-10/tree/main/temporal-normalizing-flows","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"point-processes","task_name":"Point Processes"}],"methods":[{"method_slug":"normalizing-flows","method_name":"Normalizing Flows"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1909.12127","atlas_url":"https://app.syntology.ai/?focus=1909.12127","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":"1909.12127"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1909.12127\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1909.12127"},"call":"get_concepts_for_paper(arxiv_id=\"1909.12127\")"}],"by_repo":[{"repo":"shchur/ifl-tpp","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2510.20414"],"harvested_for_calls":[{"arxiv_id":"2510.20414","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2510.20414"},"call":"get_harvested_code_for_paper(arxiv_id=\"2510.20414\")"}]},{"repo":"Yoontae6719/Point-Processes","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"awslabs/gluon-ts","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2108.00981"],"harvested_for_calls":[{"arxiv_id":"2108.00981","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.00981"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.00981\")"}]},{"repo":"MindSpore-scientific-2/code-11","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2408.14512"],"harvested_for_calls":[{"arxiv_id":"2408.14512","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2408.14512"},"call":"get_harvested_code_for_paper(arxiv_id=\"2408.14512\")"}]},{"repo":"MindSpore-scientific/code-10","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2412.20404"],"harvested_for_calls":[{"arxiv_id":"2412.20404","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2412.20404"},"call":"get_harvested_code_for_paper(arxiv_id=\"2412.20404\")"}]}],"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":"fd4c4a116b3fe418b3590bc62411affd13db7ce6568e8a8ad490a612aca0423c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}