{"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/hr-pro-point-supervised-temporal-action","title":"HR-Pro: Point-supervised Temporal Action Localization via Hierarchical Reliability Propagation","arxiv_id":"2308.12608","date":"2023-08-24","proceeding":null,"authors":["Huaxin Zhang","Xiang Wang","Xiaohao Xu","Zhiwu Qing","Changxin Gao","Nong Sang"],"abstract":"Point-supervised Temporal Action Localization (PSTAL) is an emerging research direction for label-efficient learning. However, current methods mainly focus on optimizing the network either at the snippet-level or the instance-level, neglecting the inherent reliability of point annotations at both levels. In this paper, we propose a Hierarchical Reliability Propagation (HR-Pro) framework, which consists of two reliability-aware stages: Snippet-level Discrimination Learning and Instance-level Completeness Learning, both stages explore the efficient propagation of high-confidence cues in point annotations. For snippet-level learning, we introduce an online-updated memory to store reliable snippet prototypes for each class. We then employ a Reliability-aware Attention Block to capture both intra-video and inter-video dependencies of snippets, resulting in more discriminative and robust snippet representation. For instance-level learning, we propose a point-based proposal generation approach as a means of connecting snippets and instances, which produces high-confidence proposals for further optimization at the instance level. Through multi-level reliability-aware learning, we obtain more reliable confidence scores and more accurate temporal boundaries of predicted proposals. Our HR-Pro achieves state-of-the-art performance on multiple challenging benchmarks, including an impressive average mAP of 60.3% on THUMOS14. Notably, our HR-Pro largely surpasses all previous point-supervised methods, and even outperforms several competitive fully supervised methods. Code will be available at https://github.com/pipixin321/HR-Pro.","url_abs":"https://arxiv.org/abs/2308.12608v3","url_pdf":"https://arxiv.org/pdf/2308.12608v3.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":"hr-pro-point-supervised-temporal-action","repo_url":"https://github.com/pipixin321/hr-pro","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"action-localization","task_name":"Action Localization"},{"task_slug":"action-recognition","task_name":"Temporal Action Localization"},{"task_slug":"weakly-supervised-action-localization","task_name":"Weakly Supervised Action Localization"}],"methods":[{"method_slug":"focus","method_name":"Focus"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/weakly-supervised-action-localization-on-6","task":"Weakly Supervised Action Localization","dataset":"BEOID","model":"HR-Pro","rank_in_archive_order":1,"of":5,"metrics":{"mAP@0.1:0.7":"59.4","mAP@0.5":"55.3"},"uses_additional_data":false},{"leaderboard":"/sota/weakly-supervised-action-localization-on-gtea","task":"Weakly Supervised Action Localization","dataset":"GTEA","model":"HR-Pro","rank_in_archive_order":2,"of":6,"metrics":{"mAP@0.1:0.7":"47.3","mAP@0.5":"37.3"},"uses_additional_data":false},{"leaderboard":"/sota/weakly-supervised-action-localization-on","task":"Weakly Supervised Action Localization","dataset":"THUMOS 2014","model":"HR-Pro","rank_in_archive_order":1,"of":30,"metrics":{"mAP@0.1:0.5":"71.6","mAP@0.1:0.7":"60.3","mAP@0.5":"52.2"},"uses_additional_data":true},{"leaderboard":"/sota/weakly-supervised-action-localization-on-5","task":"Weakly Supervised Action Localization","dataset":"THUMOS14","model":"HR-Pro","rank_in_archive_order":1,"of":12,"metrics":{"avg-mAP (0.1-0.5)":"71.6","avg-mAP (0.1:0.7)":"60.3","avg-mAP (0.3-0.7)":"51.1"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/2308.12608","atlas_url":"https://app.syntology.ai/?focus=2308.12608","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":"2308.12608"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2308.12608\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2308.12608"},"call":"get_concepts_for_paper(arxiv_id=\"2308.12608\")"}],"by_repo":[{"repo":"pipixin321/hr-pro","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["aaai_28539"],"harvested_for_calls":[]}],"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":"8e6b5d2b7c3b900908f9663ec8781743341399a6ba455814f09af92cac4aee4b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}