{"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/learning-without-memorizing","title":"Learning without Memorizing","arxiv_id":"1811.08051","date":"2018-11-20","proceeding":"CVPR 2019 6","authors":["Prithviraj Dhar","Rajat Vikram Singh","Kuan-Chuan Peng","Ziyan Wu","Rama Chellappa"],"abstract":"Incremental learning (IL) is an important task aimed at increasing the\ncapability of a trained model, in terms of the number of classes recognizable\nby the model. The key problem in this task is the requirement of storing data\n(e.g. images) associated with existing classes, while teaching the classifier\nto learn new classes. However, this is impractical as it increases the memory\nrequirement at every incremental step, which makes it impossible to implement\nIL algorithms on edge devices with limited memory. Hence, we propose a novel\napproach, called `Learning without Memorizing (LwM)', to preserve the\ninformation about existing (base) classes, without storing any of their data,\nwhile making the classifier progressively learn the new classes. In LwM, we\npresent an information preserving penalty: Attention Distillation Loss\n($L_{AD}$), and demonstrate that penalizing the changes in classifiers'\nattention maps helps to retain information of the base classes, as new classes\nare added. We show that adding $L_{AD}$ to the distillation loss which is an\nexisting information preserving loss consistently outperforms the\nstate-of-the-art performance in the iILSVRC-small and iCIFAR-100 datasets in\nterms of the overall accuracy of base and incrementally learned classes.","url_abs":"http://arxiv.org/abs/1811.08051v2","url_pdf":"http://arxiv.org/pdf/1811.08051v2.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":"learning-without-memorizing","repo_url":"https://github.com/mmasana/FACIL","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":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.08051","atlas_url":"https://app.syntology.ai/?focus=1811.08051","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":"1811.08051"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.08051\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.08051"},"call":"get_concepts_for_paper(arxiv_id=\"1811.08051\")"}],"by_repo":[{"repo":"mmasana/FACIL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["1606.09282","1611.07725","1612.00796"],"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":"1611.07725","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1611.07725"},"call":"get_harvested_code_for_paper(arxiv_id=\"1611.07725\")"},{"arxiv_id":"1612.00796","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00796"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00796\")"}]}],"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":"b35345770b277ac891f01dd02b8b9ff49454ea2e5f1c1e6f24d7fb8d66083565","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}