{"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/overcoming-catastrophic-forgetting-with-hard","title":"Overcoming catastrophic forgetting with hard attention to the task","arxiv_id":"1801.01423","date":"2018-01-04","proceeding":"ICML 2018 7","authors":["Joan Serrà","Dídac Surís","Marius Miron","Alexandros Karatzoglou"],"abstract":"Catastrophic forgetting occurs when a neural network loses the information\nlearned in a previous task after training on subsequent tasks. This problem\nremains a hurdle for artificial intelligence systems with sequential learning\ncapabilities. In this paper, we propose a task-based hard attention mechanism\nthat preserves previous tasks' information without affecting the current task's\nlearning. A hard attention mask is learned concurrently to every task, through\nstochastic gradient descent, and previous masks are exploited to condition such\nlearning. We show that the proposed mechanism is effective for reducing\ncatastrophic forgetting, cutting current rates by 45 to 80%. We also show that\nit is robust to different hyperparameter choices, and that it offers a number\nof monitoring capabilities. The approach features the possibility to control\nboth the stability and compactness of the learned knowledge, which we believe\nmakes it also attractive for online learning or network compression\napplications.","url_abs":"http://arxiv.org/abs/1801.01423v3","url_pdf":"http://arxiv.org/pdf/1801.01423v3.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":"overcoming-catastrophic-forgetting-with-hard","repo_url":"https://github.com/joansj/hat","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"overcoming-catastrophic-forgetting-with-hard","repo_url":"https://github.com/chilung/hat","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"hard-attention","task_name":"Hard Attention"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/continual-learning-on-20newsgroup-10-tasks","task":"Continual Learning","dataset":"20Newsgroup (10 tasks)","model":"HAT","rank_in_archive_order":2,"of":6,"metrics":{"F1 - macro":"0.9521"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-asc-19-tasks","task":"Continual Learning","dataset":"ASC (19 tasks)","model":"HAT","rank_in_archive_order":7,"of":15,"metrics":{"F1 - macro":"0.7816"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-dsc-10-tasks","task":"Continual Learning","dataset":"DSC (10 tasks)","model":"HAT","rank_in_archive_order":3,"of":6,"metrics":{"F1 - macro":"0.8614"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-f-celeba-10-tasks","task":"Continual Learning","dataset":"F-CelebA (10 tasks)","model":"HAT","rank_in_archive_order":6,"of":7,"metrics":{"Acc":"0.5673"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.01423","atlas_url":"https://app.syntology.ai/?focus=1801.01423","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":"1801.01423"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.01423\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.01423"},"call":"get_concepts_for_paper(arxiv_id=\"1801.01423\")"}],"by_repo":[{"repo":"joansj/hat","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"chilung/hat","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":"970a09cc3a278ac833c51fff7fff393f30c9ab78f1327915a0622163e7d00b70","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}