{"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/lifelong-learning-with-dynamically-expandable","title":"Lifelong Learning with Dynamically Expandable Networks","arxiv_id":"1708.01547","date":"2017-08-04","proceeding":"ICLR 2018 1","authors":["Jaehong Yoon","Eunho Yang","Jeongtae Lee","Sung Ju Hwang"],"abstract":"We propose a novel deep network architecture for lifelong learning which we\nrefer to as Dynamically Expandable Network (DEN), that can dynamically decide\nits network capacity as it trains on a sequence of tasks, to learn a compact\noverlapping knowledge sharing structure among tasks. DEN is efficiently trained\nin an online manner by performing selective retraining, dynamically expands\nnetwork capacity upon arrival of each task with only the necessary number of\nunits, and effectively prevents semantic drift by splitting/duplicating units\nand timestamping them. We validate DEN on multiple public datasets under\nlifelong learning scenarios, on which it not only significantly outperforms\nexisting lifelong learning methods for deep networks, but also achieves the\nsame level of performance as the batch counterparts with substantially fewer\nnumber of parameters. Further, the obtained network fine-tuned on all tasks\nobtained significantly better performance over the batch models, which shows\nthat it can be used to estimate the optimal network structure even when all\ntasks are available in the first place.","url_abs":"http://arxiv.org/abs/1708.01547v11","url_pdf":"http://arxiv.org/pdf/1708.01547v11.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":"lifelong-learning-with-dynamically-expandable","repo_url":"https://github.com/epsilon-deltta/ssd_guillotine","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"lifelong-learning-with-dynamically-expandable","repo_url":"https://github.com/mako-anon/mako","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"lifelong-learning-with-dynamically-expandable","repo_url":"https://github.com/jaehong-yoon93/DEN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"lifelong-learning","task_name":"Lifelong learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1708.01547","atlas_url":"https://app.syntology.ai/?focus=1708.01547","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":"1708.01547"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1708.01547\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1708.01547"},"call":"get_concepts_for_paper(arxiv_id=\"1708.01547\")"}],"by_repo":[{"repo":"epsilon-deltta/ssd_guillotine","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mako-anon/mako","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jaehong-yoon93/DEN","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":"fe91372d2520e50e65ed46662fb959e9a1cafcf899fe797619411eb53d5f4900","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}