{"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/riemannian-walk-for-incremental-learning","title":"Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigence","arxiv_id":"1801.10112","date":"2018-01-30","proceeding":"ECCV 2018 9","authors":["Arslan Chaudhry","Puneet K. Dokania","Thalaiyasingam Ajanthan","Philip H. S. Torr"],"abstract":"Incremental learning (IL) has received a lot of attention recently, however,\nthe literature lacks a precise problem definition, proper evaluation settings,\nand metrics tailored specifically for the IL problem. One of the main\nobjectives of this work is to fill these gaps so as to provide a common ground\nfor better understanding of IL. The main challenge for an IL algorithm is to\nupdate the classifier whilst preserving existing knowledge. We observe that, in\naddition to forgetting, a known issue while preserving knowledge, IL also\nsuffers from a problem we call intransigence, inability of a model to update\nits knowledge. We introduce two metrics to quantify forgetting and\nintransigence that allow us to understand, analyse, and gain better insights\ninto the behaviour of IL algorithms. We present RWalk, a generalization of\nEWC++ (our efficient version of EWC [Kirkpatrick2016EWC]) and Path Integral\n[Zenke2017Continual] with a theoretically grounded KL-divergence based\nperspective. We provide a thorough analysis of various IL algorithms on MNIST\nand CIFAR-100 datasets. In these experiments, RWalk obtains superior results in\nterms of accuracy, and also provides a better trade-off between forgetting and\nintransigence.","url_abs":"http://arxiv.org/abs/1801.10112v3","url_pdf":"http://arxiv.org/pdf/1801.10112v3.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":"riemannian-walk-for-incremental-learning","repo_url":"https://github.com/facebookresearch/agem","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null},{"paper_slug":"riemannian-walk-for-incremental-learning","repo_url":"https://github.com/ContinualAI/avalanche","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"incremental-learning","task_name":"Incremental Learning"}],"methods":[{"method_slug":"ewc","method_name":"EWC"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.10112","atlas_url":"https://app.syntology.ai/?focus=1801.10112","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.10112"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.10112\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.10112"},"call":"get_concepts_for_paper(arxiv_id=\"1801.10112\")"}],"by_repo":[{"repo":"facebookresearch/agem","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1812.00420"],"harvested_for_calls":[{"arxiv_id":"1812.00420","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.00420"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.00420\")"}]},{"repo":"ContinualAI/avalanche","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["1606.09282","2007.13904"],"harvested_for_calls":[{"arxiv_id":"1606.09282","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1606.09282"},"call":"get_harvested_code_for_paper(arxiv_id=\"1606.09282\")"},{"arxiv_id":"2007.13904","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.13904"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.13904\")"}]}],"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":"12eb73435509aa781511f80d1b783af0ef00c18053eff02fcb653c64e19591d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}