{"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/detpp-leveraging-object-detection-for-robust","title":"DeTPP: Leveraging Object Detection for Robust Long-Horizon Event Prediction","arxiv_id":"2408.13131","date":"2024-08-23","proceeding":null,"authors":["Ivan Karpukhin","Andrey Savchenko"],"abstract":"Long-horizon event forecasting is critical across various domains, including retail, finance, healthcare, and social networks. Traditional methods, such as Marked Temporal Point Processes (MTPP), often rely on autoregressive models to predict multiple future events. However, these models frequently suffer from issues like converging to constant or repetitive outputs, which limits their effectiveness and general applicability. To address these challenges, we introduce DeTPP (Detection-based Temporal Point Processes), a novel approach inspired by object detection techniques from computer vision. DeTPP employs a unique matching-based loss function that selectively prioritizes reliably predictable events, improving the accuracy and diversity of predictions during inference. Our method establishes a new state-of-the-art in long-horizon event forecasting, achieving up to a 77% relative improvement over existing MTPP and next-K methods. The proposed hybrid approach enhances the accuracy of next event prediction by up to 2.7% on a large transactional dataset. Notably, DeTPP is also among the fastest methods for inference. The implementation of DeTPP is publicly available on GitHub.","url_abs":"https://arxiv.org/abs/2408.13131v2","url_pdf":"https://arxiv.org/pdf/2408.13131v2.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":"detpp-leveraging-object-detection-for-robust","repo_url":"https://github.com/ivan-chai/hotpp-benchmark","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"detpp-leveraging-object-detection-for-robust","repo_url":"https://github.com/ivan-chai/torch-linear-assignment","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"point-processes","task_name":"Point Processes"},{"task_slug":"time-series-forecasting","task_name":"Time Series Forecasting"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/point-processes-on-agegroup-transactions-mtpp","task":"Point Processes","dataset":"AgeGroup Transactions MTPP","model":"DeTPP","rank_in_archive_order":1,"of":5,"metrics":{"OTD":"6.66","T-mAP":"9.17"},"uses_additional_data":false},{"leaderboard":"/sota/point-processes-on-amazon-mtpp","task":"Point Processes","dataset":"Amazon MTPP","model":"DeTPP","rank_in_archive_order":1,"of":4,"metrics":{"OTD":"5.98","T-mAP":"37.18"},"uses_additional_data":false},{"leaderboard":"/sota/point-processes-on-retweet-mtpp","task":"Point Processes","dataset":"Retweet MTPP","model":"DeTPP","rank_in_archive_order":1,"of":6,"metrics":{"OTD":"134.4","T-mAP":"57.37"},"uses_additional_data":false},{"leaderboard":"/sota/point-processes-on-stackoverflow-mtpp","task":"Point Processes","dataset":"StackOverflow MTPP","model":"DeTPP","rank_in_archive_order":1,"of":3,"metrics":{"OTD":"12.06","T-mAP":"23.11"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2408.13131","atlas_url":"https://app.syntology.ai/?focus=2408.13131","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":"2408.13131"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2408.13131\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2408.13131"},"call":"get_concepts_for_paper(arxiv_id=\"2408.13131\")"}],"by_repo":[{"repo":"ivan-chai/hotpp-benchmark","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.01753"],"harvested_for_calls":[{"arxiv_id":"2210.01753","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.01753"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.01753\")"}]},{"repo":"ivan-chai/torch-linear-assignment","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":"13de95043048f89e189d9f84858d239d8e702984cb5d8996452a03e7bbec45b1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}