{"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/wasserstein-learning-of-deep-generative-point","title":"Wasserstein Learning of Deep Generative Point Process Models","arxiv_id":"1705.08051","date":"2017-05-23","proceeding":"NeurIPS 2017 12","authors":["Shuai Xiao","Mehrdad Farajtabar","Xiaojing Ye","Junchi Yan","Le Song","Hongyuan Zha"],"abstract":"Point processes are becoming very popular in modeling asynchronous sequential\ndata due to their sound mathematical foundation and strength in modeling a\nvariety of real-world phenomena. Currently, they are often characterized via\nintensity function which limits model's expressiveness due to unrealistic\nassumptions on its parametric form used in practice. Furthermore, they are\nlearned via maximum likelihood approach which is prone to failure in\nmulti-modal distributions of sequences. In this paper, we propose an\nintensity-free approach for point processes modeling that transforms nuisance\nprocesses to a target one. Furthermore, we train the model using a\nlikelihood-free leveraging Wasserstein distance between point processes.\nExperiments on various synthetic and real-world data substantiate the\nsuperiority of the proposed point process model over conventional ones.","url_abs":"http://arxiv.org/abs/1705.08051v1","url_pdf":"http://arxiv.org/pdf/1705.08051v1.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":"wasserstein-learning-of-deep-generative-point","repo_url":"https://github.com/xiaoshuai09/Wasserstein-Learning-For-Point-Process","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"point-processes","task_name":"Point Processes"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.08051","atlas_url":"https://app.syntology.ai/?focus=1705.08051","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":"1705.08051"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.08051\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.08051"},"call":"get_concepts_for_paper(arxiv_id=\"1705.08051\")"}],"by_repo":[{"repo":"xiaoshuai09/Wasserstein-Learning-For-Point-Process","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":"7225d2dc822793d65a63d22555f23b0f3525758108184234c7cf0b8a5e6ad13e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}