{"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/progress-compress-a-scalable-framework-for","title":"Progress & Compress: A scalable framework for continual learning","arxiv_id":"1805.06370","date":"2018-05-16","proceeding":"ICML 2018 7","authors":["Jonathan Schwarz","Jelena Luketina","Wojciech M. Czarnecki","Agnieszka Grabska-Barwinska","Yee Whye Teh","Razvan Pascanu","Raia Hadsell"],"abstract":"We introduce a conceptually simple and scalable framework for continual\nlearning domains where tasks are learned sequentially. Our method is constant\nin the number of parameters and is designed to preserve performance on\npreviously encountered tasks while accelerating learning progress on subsequent\nproblems. This is achieved by training a network with two components: A\nknowledge base, capable of solving previously encountered problems, which is\nconnected to an active column that is employed to efficiently learn the current\ntask. After learning a new task, the active column is distilled into the\nknowledge base, taking care to protect any previously acquired skills. This\ncycle of active learning (progression) followed by consolidation (compression)\nrequires no architecture growth, no access to or storing of previous data or\ntasks, and no task-specific parameters. We demonstrate the progress & compress\napproach on sequential classification of handwritten alphabets as well as two\nreinforcement learning domains: Atari games and 3D maze navigation.","url_abs":"http://arxiv.org/abs/1805.06370v2","url_pdf":"http://arxiv.org/pdf/1805.06370v2.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":"progress-compress-a-scalable-framework-for","repo_url":"https://github.com/wabbajack1/tapd","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"atari-games","task_name":"Atari Games"},{"task_slug":"continual-learning","task_name":"Continual Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[{"method_slug":"ewc","method_name":"EWC"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.06370","atlas_url":"https://app.syntology.ai/?focus=1805.06370","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":"1805.06370"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.06370\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.06370"},"call":"get_concepts_for_paper(arxiv_id=\"1805.06370\")"}],"by_repo":[{"repo":"wabbajack1/tapd","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2411.16532"],"harvested_for_calls":[{"arxiv_id":"2411.16532","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2411.16532"},"call":"get_harvested_code_for_paper(arxiv_id=\"2411.16532\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"59e2043603ee3442457fe8256416dbd5767f562167d49b3a75e5ddb582d5a5af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}