{"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/a-self-adaptive-proposal-model-for-temporal","title":"A Self-Adaptive Proposal Model for Temporal Action Detection based on Reinforcement Learning","arxiv_id":"1706.07251","date":"2017-06-22","proceeding":null,"authors":["Jingjia Huang","Nannan Li","Tao Zhang","Ge Li"],"abstract":"Existing action detection algorithms usually generate action proposals\nthrough an extensive search over the video at multiple temporal scales, which\nbrings about huge computational overhead and deviates from the human perception\nprocedure. We argue that the process of detecting actions should be naturally\none of observation and refinement: observe the current window and refine the\nspan of attended window to cover true action regions. In this paper, we propose\nan active action proposal model that learns to find actions through\ncontinuously adjusting the temporal bounds in a self-adaptive way. The whole\nprocess can be deemed as an agent, which is firstly placed at a position in the\nvideo at random, adopts a sequence of transformations on the current attended\nregion to discover actions according to a learned policy. We utilize\nreinforcement learning, especially the Deep Q-learning algorithm to learn the\nagent's decision policy. In addition, we use temporal pooling operation to\nextract more effective feature representation for the long temporal window, and\ndesign a regression network to adjust the position offsets between predicted\nresults and the ground truth. Experiment results on THUMOS 2014 validate the\neffectiveness of the proposed approach, which can achieve competitive\nperformance with current action detection algorithms via much fewer proposals.","url_abs":"http://arxiv.org/abs/1706.07251v1","url_pdf":"http://arxiv.org/pdf/1706.07251v1.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":"a-self-adaptive-proposal-model-for-temporal","repo_url":"https://github.com/Parapompadoo/Temporal_Action_Detection","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"action-detection","task_name":"Action Detection"},{"task_slug":null,"task_name":"Position"},{"task_slug":"q-learning","task_name":"Q-Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[{"method_slug":"q-learning","method_name":"Q-Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Parapompadoo/Temporal_Action_Detection","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":"827ca4d7f3203aef6176d5fe092dcedb5e4616f4c8e5dfb6f17265765edb0bce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}