{"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/temporal-attention-gated-model-for-robust","title":"Temporal Attention-Gated Model for Robust Sequence Classification","arxiv_id":"1612.00385","date":"2016-12-01","proceeding":"CVPR 2017 7","authors":["Wenjie Pei","Tadas Baltrušaitis","David M. J. Tax","Louis-Philippe Morency"],"abstract":"Typical techniques for sequence classification are designed for\nwell-segmented sequences which have been edited to remove noisy or irrelevant\nparts. Therefore, such methods cannot be easily applied on noisy sequences\nexpected in real-world applications. In this paper, we present the Temporal\nAttention-Gated Model (TAGM) which integrates ideas from attention models and\ngated recurrent networks to better deal with noisy or unsegmented sequences.\nSpecifically, we extend the concept of attention model to measure the relevance\nof each observation (time step) of a sequence. We then use a novel gated\nrecurrent network to learn the hidden representation for the final prediction.\nAn important advantage of our approach is interpretability since the temporal\nattention weights provide a meaningful value for the salience of each time step\nin the sequence. We demonstrate the merits of our TAGM approach, both for\nprediction accuracy and interpretability, on three different tasks: spoken\ndigit recognition, text-based sentiment analysis and visual event recognition.","url_abs":"http://arxiv.org/abs/1612.00385v2","url_pdf":"http://arxiv.org/pdf/1612.00385v2.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":"temporal-attention-gated-model-for-robust","repo_url":"https://github.com/wenjiepei/TAGM","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"torch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"sentiment-analysis","task_name":"Sentiment Analysis"},{"task_slug":"model","task_name":"model"}],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1612.00385","atlas_url":"https://app.syntology.ai/?focus=1612.00385","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":"1612.00385"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1612.00385\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1612.00385"},"call":"get_concepts_for_paper(arxiv_id=\"1612.00385\")"}],"by_repo":[{"repo":"wenjiepei/TAGM","kind":"official","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":"f6b9a9ac7586d65841eb43ad7549112e10b809efb64117b2d97a6b5bd3a88b5e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}