{"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/helpful-or-harmful-inter-task-association-in","title":"Helpful or Harmful: Inter-Task Association in Continual Learning","arxiv_id":null,"date":"2022-10-23","proceeding":"Conference 2022 10","authors":["Hyundong Jin","Eunwoo Kim"],"abstract":"When optimizing sequentially incoming tasks, deep neural networks generally suffer from catastrophic forgetting due to their lack of ability to maintain knowledge from old tasks. This may lead to a significant performance drop of the previously learned tasks. To alleviate this problem, studies on continual learning have been conducted as a countermeasure. Nevertheless, it suffers from an increase in computational cost due to the expansion of the network size or a change in knowledge that is favorably linked to previous tasks. In this work, we propose a novel approach to differentiate helpful and harmful information for old tasks using a model search to learn a current task effectively. Given a new task, the proposed method discovers an underlying association knowledge from old tasks, which can provide additional support in acquiring the new task knowledge. In addition, by introducing a sensitivity measure to the loss of the current task from the associated tasks, we find cooperative relations between tasks while alleviating harmful interference. We apply the proposed approach to both task- and class-incremental scenarios in continual learning, using a wide range of datasets from small to large scales. Experimental results show that the proposed method outperforms a large variety of continual learning approaches for the experiments while effectively alleviating catastrophic forgetting.","url_abs":"https://www.ecva.net/papers/eccv_2022/papers_ECCV/papers/136710518.pdf","url_pdf":"https://www.ecva.net/papers/eccv_2022/papers_ECCV/papers/136710518.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":"helpful-or-harmful-inter-task-association-in","repo_url":"https://github.com/Jin0316/Helpful-or-Harmful-Inter-Task-Association","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"class-incremental-learning","task_name":"Class Incremental Learning"},{"task_slug":"continual-learning","task_name":"Continual Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/continual-learning-on-cubs-fine-grained-6","task":"Continual Learning","dataset":"CUBS (Fine-grained 6 Tasks)","model":"H$^{2}$","rank_in_archive_order":2,"of":6,"metrics":{"Accuracy":"84.1"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-flowers-fine-grained-6","task":"Continual Learning","dataset":"Flowers (Fine-grained 6 Tasks)","model":"H$^{2}$","rank_in_archive_order":3,"of":6,"metrics":{"Accuracy":"94.9"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-imagenet-fine-grained-6","task":"Continual Learning","dataset":"ImageNet (Fine-grained 6 Tasks)","model":"H$^{2}$","rank_in_archive_order":6,"of":6,"metrics":{"Accuracy":"75.71"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-sketch-fine-grained-6","task":"Continual Learning","dataset":"Sketch (Fine-grained 6 Tasks)","model":"H$^{2}$","rank_in_archive_order":5,"of":6,"metrics":{"Accuracy":"76.2"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-split-cifar-10-5-tasks","task":"Continual Learning","dataset":"Split CIFAR-10 (5 tasks)","model":"H$^{2}$","rank_in_archive_order":1,"of":1,"metrics":{"Top 1 Accuracy %":"97.3"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-split-mnist-5-tasks","task":"Continual Learning","dataset":"Split MNIST (5 tasks)","model":"H$^{2}$","rank_in_archive_order":1,"of":1,"metrics":{"Top 1 Accuracy %":"99.9"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-stanford-cars-fine","task":"Continual Learning","dataset":"Stanford Cars (Fine-grained 6 Tasks)","model":"H$^{2}$","rank_in_archive_order":3,"of":6,"metrics":{"Accuracy":"90.6"},"uses_additional_data":false},{"leaderboard":"/sota/continual-learning-on-wikiart-fine-grained-6","task":"Continual Learning","dataset":"Wikiart (Fine-grained 6 Tasks)","model":"H$^{2}$","rank_in_archive_order":3,"of":6,"metrics":{"Accuracy":"75.1"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"Jin0316/Helpful-or-Harmful-Inter-Task-Association","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":"ee20c4f314319a58ccc3e6d37a42086e55c2b81b7b146b2e4ce60c3725c6e1f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}