{"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/progressive-attention-memory-network-for","title":"Progressive Attention Memory Network for Movie Story Question Answering","arxiv_id":"1904.08607","date":"2019-04-18","proceeding":"CVPR 2019 6","authors":["Junyeong Kim","Minuk Ma","Kyung-Su Kim","Sungjin Kim","Chang D. Yoo"],"abstract":"This paper proposes the progressive attention memory network (PAMN) for movie\nstory question answering (QA). Movie story QA is challenging compared to VQA in\ntwo aspects: (1) pinpointing the temporal parts relevant to answer the question\nis difficult as the movies are typically longer than an hour, (2) it has both\nvideo and subtitle where different questions require different modality to\ninfer the answer. To overcome these challenges, PAMN involves three main\nfeatures: (1) progressive attention mechanism that utilizes cues from both\nquestion and answer to progressively prune out irrelevant temporal parts in\nmemory, (2) dynamic modality fusion that adaptively determines the contribution\nof each modality for answering the current question, and (3) belief correction\nanswering scheme that successively corrects the prediction score on each\ncandidate answer. Experiments on publicly available benchmark datasets, MovieQA\nand TVQA, demonstrate that each feature contributes to our movie story QA\narchitecture, PAMN, and improves performance to achieve the state-of-the-art\nresult. Qualitative analysis by visualizing the inference mechanism of PAMN is\nalso provided.","url_abs":"http://arxiv.org/abs/1904.08607v1","url_pdf":"http://arxiv.org/pdf/1904.08607v1.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":[],"tasks":[{"task_slug":"question-answering","task_name":"Question Answering"},{"task_slug":"video-story-qa","task_name":"Video Story QA"},{"task_slug":"visual-question-answering","task_name":"Visual Question Answering (VQA)"}],"methods":[{"method_slug":"memory-network","method_name":"Memory Network"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/video-story-qa-on-movieqa","task":"Video Story QA","dataset":"MovieQA","model":"PAMN","rank_in_archive_order":2,"of":3,"metrics":{"Accuracy":"42.53"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1904.08607","atlas_url":"https://app.syntology.ai/?focus=1904.08607","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":"1904.08607"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1904.08607\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1904.08607"},"call":"get_concepts_for_paper(arxiv_id=\"1904.08607\")"}],"by_repo":[],"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":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d0e65170392c8e1f1c09df3757e7f3d279ac19e1d184f43223ff7a9a5cad09be","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}