{"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/incremental-learning-through-deep-adaptation","title":"Incremental Learning Through Deep Adaptation","arxiv_id":"1705.04228","date":"2017-05-11","proceeding":"ICLR 2018 1","authors":["Amir Rosenfeld","John K. Tsotsos"],"abstract":"Given an existing trained neural network, it is often desirable to learn new\ncapabilities without hindering performance of those already learned. Existing\napproaches either learn sub-optimal solutions, require joint training, or incur\na substantial increment in the number of parameters for each added domain,\ntypically as many as the original network. We propose a method called\n\\emph{Deep Adaptation Networks} (DAN) that constrains newly learned filters to\nbe linear combinations of existing ones. DANs precisely preserve performance on\nthe original domain, require a fraction (typically 13\\%, dependent on network\narchitecture) of the number of parameters compared to standard fine-tuning\nprocedures and converge in less cycles of training to a comparable or better\nlevel of performance. When coupled with standard network quantization\ntechniques, we further reduce the parameter cost to around 3\\% of the original\nwith negligible or no loss in accuracy. The learned architecture can be\ncontrolled to switch between various learned representations, enabling a single\nnetwork to solve a task from multiple different domains. We conduct extensive\nexperiments showing the effectiveness of our method on a range of image\nclassification tasks and explore different aspects of its behavior.","url_abs":"http://arxiv.org/abs/1705.04228v2","url_pdf":"http://arxiv.org/pdf/1705.04228v2.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":"continual-learning","task_name":"Continual Learning"},{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"incremental-learning","task_name":"Incremental Learning"},{"task_slug":"quantization","task_name":"Quantization"},{"task_slug":"image-classification","task_name":"image-classification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/continual-learning-on-visual-domain-decathlon","task":"Continual Learning","dataset":"visual domain decathlon (10 tasks)","model":"DAN","rank_in_archive_order":7,"of":14,"metrics":{"Avg. Accuracy":"77.01","decathlon discipline (Score)":"2851"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.04228","atlas_url":"https://app.syntology.ai/?focus=1705.04228","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":"1705.04228"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.04228\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.04228"},"call":"get_concepts_for_paper(arxiv_id=\"1705.04228\")"}],"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":"62837523c7ce13edb66203a5e55fccb45cac005552394272600fba2f172199a9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}